for (;;) {
// Make a.end > b.start.
posA.advanceTo(posB.start());
- if (!posA.valid() || !Traits::stopLess(posB.end(), posA.start()))
+ if (!posA.valid() || !Traits::stopLess(posB.stop(), posA.start()))
return;
// Make b.end > a.start.
posB.advanceTo(posA.start());
- if (!posB.valid() || !Traits::stopLess(posA.end(), posB.start()))
+ if (!posB.valid() || !Traits::stopLess(posA.stop(), posB.start()))
return;
}
}
/// skipA - Move to the next overlap that doesn't involve a().
void skipA() {
++posA;
- if (!posA.valid() || !Traits::stopLess(posB.end(), posA.start()))
+ if (!posA.valid() || !Traits::stopLess(posB.stop(), posA.start()))
return;
// Second half-loop of advance().
posB.advanceTo(posA.start());
- if (!posB.valid() || !Traits::stopLess(posA.end(), posB.start()))
+ if (!posB.valid() || !Traits::stopLess(posA.stop(), posB.start()))
return ;
advance();
}
/// skipB - Move to the next overlap that doesn't involve b().
void skipB() {
++posB;
- if (!posB.valid() || !Traits::stopLess(posA.end(), posB.start()))
+ if (!posB.valid() || !Traits::stopLess(posA.stop(), posB.start()))
return;
advance();
}
/// Preincrement - Move to the next overlap.
IntervalMapOverlaps &operator++() {
// Bump the iterator that ends first. The other one may have more overlaps.
- if (Traits::startLess(posB.end(), posA.end()))
+ if (Traits::startLess(posB.stop(), posA.stop()))
skipB();
else
skipA();
}
+TEST(IntervalMapOverlapsTest, EmptyMaps) {
+ typedef IntervalMapOverlaps<UUMap,UUMap> UUOverlaps;
+ UUMap::Allocator allocator;
+ UUMap mapA(allocator);
+ UUMap mapB(allocator);
+
+ // empty, empty.
+ EXPECT_FALSE(UUOverlaps(mapA, mapB).valid());
+
+ mapA.insert(1, 2, 3);
+ // full, empty
+ EXPECT_FALSE(UUOverlaps(mapA, mapB).valid());
+ // empty, full
+ EXPECT_FALSE(UUOverlaps(mapB, mapA).valid());
+}
} // namespace