Ceph » RADOS

The following code demonstrates the problem.

    interval_set<int> iset1;
    iset1.insert(2, 4);
    iset1.insert(8, 4);

    iset1.insert(6, 4);

With insert (as opposed to union_insert), this should panic, since the third insertion overlaps with the second. However, it does not assert. Worse still the result is a corrupt interval set.

The resulting interval set has length 12, with intervals 2~8 and 8~4 - these to intervals overlap, which is illegal in an interval set.

The new union_insert call will produce 2~10, with size 10, which is a valid interval_set.

I already have a fix for this and will raise a PR, but I want to have a tracker for future record.