equal
deleted
inserted
replaced
1350 // . parent and child point to each other |
1350 // . parent and child point to each other |
1351 // . each node's key correctly related to that of its child(ren) |
1351 // . each node's key correctly related to that of its child(ren) |
1352 template <class Chunk_t, template <class> class FreeList_t> |
1352 template <class Chunk_t, template <class> class FreeList_t> |
1353 void BinaryTreeDictionary<Chunk_t, FreeList_t>::verify_tree() const { |
1353 void BinaryTreeDictionary<Chunk_t, FreeList_t>::verify_tree() const { |
1354 guarantee(root() == NULL || total_free_blocks() == 0 || |
1354 guarantee(root() == NULL || total_free_blocks() == 0 || |
1355 total_size() != 0, "_total_size should't be 0?"); |
1355 total_size() != 0, "_total_size shouldn't be 0?"); |
1356 guarantee(root() == NULL || root()->parent() == NULL, "_root shouldn't have parent"); |
1356 guarantee(root() == NULL || root()->parent() == NULL, "_root shouldn't have parent"); |
1357 verify_tree_helper(root()); |
1357 verify_tree_helper(root()); |
1358 } |
1358 } |
1359 |
1359 |
1360 template <class Chunk_t, template <class> class FreeList_t> |
1360 template <class Chunk_t, template <class> class FreeList_t> |