void treeAdvanceTo(KeyT x);
public:
+ /// const_iterator - Create an iterator that isn't pointing anywhere.
+ const_iterator() : map(0) {}
+
/// valid - Return true if the current position is valid, false for end().
bool valid() const { return path.valid(); }
void eraseNode(unsigned Level);
void treeErase(bool UpdateRoot = true);
public:
+ /// iterator - Create null iterator.
+ iterator() {}
+
/// insert - Insert mapping [a;b] -> y before the current position.
void insert(KeyT a, KeyT b, ValT y);
UUMap::iterator I = map.begin();
EXPECT_FALSE(I.valid());
EXPECT_TRUE(I == map.end());
+
+ // Default constructor and cross-constness compares.
+ UUMap::const_iterator CI;
+ CI = map.begin();
+ EXPECT_TRUE(CI == I);
+ UUMap::iterator I2;
+ I2 = map.end();
+ EXPECT_TRUE(I2 == CI);
}
// Single entry map tests