Leaf *allocLeaf() {
return new(allocator.template Allocate<Leaf>()) Leaf();
}
- void freeLeaf(Leaf *P) {
+ void deleteLeaf(Leaf *P) {
P->~Leaf();
allocator.Deallocate(P);
}
Branch *allocBranch() {
return new(allocator.template Allocate<Branch>()) Branch();
}
- void freeBranch(Branch *P) {
+ void deleteBranch(Branch *P) {
P->~Branch();
allocator.Deallocate(P);
}
bool branched() const { return height > 0; }
ValT treeSafeLookup(KeyT x, ValT NotFound) const;
-
void visitNodes(void (IntervalMap::*f)(NodeRef, unsigned Level));
+ void deleteNode(NodeRef Node, unsigned Level);
public:
explicit IntervalMap(Allocator &a) : height(0), rootSize(0), allocator(a) {
find(a).insert(a, b, y);
}
+ /// clear - Remove all entries.
+ void clear();
+
class const_iterator;
class iterator;
friend class const_iterator;
(this->*f)(Refs[i], 0);
}
+template <typename KeyT, typename ValT, unsigned N, typename Traits>
+void IntervalMap<KeyT, ValT, N, Traits>::
+deleteNode(NodeRef Node, unsigned Level) {
+ if (Level)
+ deleteBranch(&Node.branch());
+ else
+ deleteLeaf(&Node.leaf());
+}
+
+template <typename KeyT, typename ValT, unsigned N, typename Traits>
+void IntervalMap<KeyT, ValT, N, Traits>::
+clear() {
+ if (branched()) {
+ visitNodes(&IntervalMap::deleteNode);
+ switchRootToLeaf();
+ }
+ rootSize = 0;
+}
+
#ifndef NDEBUG
template <typename KeyT, typename ValT, unsigned N, typename Traits>
void IntervalMap<KeyT, ValT, N, Traits>::
EXPECT_EQ(320u, I.stop());
++I;
EXPECT_FALSE(I.valid());
+
+ // Test clear() on non-branched map.
+ map.clear();
+ EXPECT_TRUE(map.empty());
+ EXPECT_TRUE(map.begin() == map.end());
}
// Branched, non-coalescing tests.
}
EXPECT_TRUE(I == map.begin());
+ // Test clear() on branched map.
+ map.clear();
+ EXPECT_TRUE(map.empty());
+ EXPECT_TRUE(map.begin() == map.end());
}
} // namespace