emo/thin-provisioning-tools
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Some btree visitor tidying.

Browse Source 
Introduce node_location to replace the long list of parameters.  Also
add a depth field to keep track of the depth from root.
This commit is contained in:
Joe Thornber
2013-05-01 16:16:23 +01:00
parent 1884233a2b
commit 5d0b23beea
7 changed files with 109 additions and 95 deletions
Download Patch File Download Diff File Expand all files Collapse all files

16
unit-tests/btree_t.cc
View File

@@ -52,26 +52,24 @@ namespace {
//
class constraint_visitor : public btree<1, uint64_traits>::visitor {
public:
typedef btree_detail::node_location node_location;
typedef btree_detail::node_ref<uint64_traits> internal_node;
typedef btree_detail::node_ref<uint64_traits> leaf_node;
bool visit_internal(unsigned level, bool sub_root,
boost::optional<uint64_t> key,
bool visit_internal(node_location const &loc,
internal_node const &n) {
check_duplicate_block(n.get_location());
return true;
}
bool visit_internal_leaf(unsigned level, bool sub_root,
boost::optional<uint64_t> key,
internal_node const &n) {
bool visit_internal_leaf(node_location const &loc,
internal_node const &n) {
check_duplicate_block(n.get_location());
return true;
}
bool visit_leaf(unsigned level, bool sub_root,
boost::optional<uint64_t> key,
leaf_node const &n) {
bool visit_leaf(node_location const &loc,
leaf_node const &n) {
check_duplicate_block(n.get_location());
return true;
}
@@ -94,7 +92,7 @@ namespace {
typedef btree<1, uint64_traits> tree_type;
tree_type::visitor::ptr v(new constraint_visitor);
tree->visit(v);
tree->visit_depth_first(v);
}
}