Searched refs:nd_it (Results 1 - 5 of 5) sorted by relevance

/freebsd-11-stable/contrib/libstdc++/include/ext/pb_ds/detail/
H A Dtree_trace_base.hpp105 trace_node(const_node_iterator nd_it, size_type level) const;
117 print_node_pointer(Const_Node_Iterator nd_it, integral_constant<int,true>);
120 print_node_pointer(Const_Node_Iterator nd_it, integral_constant<int,false>);
124 trace_it_metadata(Const_Node_Iterator nd_it, type_to_type<Metadata_>);
144 trace_node(const_node_iterator nd_it, size_type level) const argument
146 if (nd_it.get_r_child() != node_end())
147 trace_node(nd_it.get_r_child(), level + 1);
152 print_node_pointer(nd_it, integral_constant<int,Node_Based>());
153 std::cerr << base_type::extract_key(*(*nd_it));
160 trace_it_metadata(nd_it, m_type_ind_
172 trace_it_metadata(Const_Node_Iterator nd_it, type_to_type<Metadata_>) argument
187 print_node_pointer(Const_Node_Iterator nd_it, integral_constant<int,true>) argument
195 print_node_pointer(Const_Node_Iterator nd_it, integral_constant<int,false>) argument
197 std::cerr <<* nd_it << " "; local
[all...]
/freebsd-11-stable/contrib/libstdc++/include/ext/pb_ds/detail/trie_policy/
H A Dorder_statistics_imp.hpp57 node_iterator nd_it = node_begin(); local
63 if (order > nd_it.get_metadata())
64 return (++base_type::rightmost_it(nd_it));
66 const size_type num_children = nd_it.num_children();
69 return (*nd_it);
73 node_iterator child_nd_it = nd_it.get_child(i);
79 nd_it = child_nd_it;
119 const_node_iterator nd_it = node_begin(); local
127 const size_type num_children = nd_it.num_children();
132 base_type::extract_key(*(*nd_it));
174 operator ()(node_iterator nd_it, const_node_iterator ) const argument
[all...]
H A Dprefix_search_node_update_imp.hpp95 Node_Iterator nd_it = node_begin(); local
105 if (nd_it == end_nd_it)
109 PB_DS_BASE_C_DEC::common_prefix_len(nd_it, b, e, r_traits);
113 iterator ret_b = leftmost_it(nd_it);
115 iterator ret_e = rightmost_it(nd_it);
120 nd_it = next_child(nd_it, b, e, end_nd_it, r_traits);
127 next_child(node_iterator nd_it, typename e_access_traits::const_iterator b, typename e_access_traits::const_iterator e, node_iterator end_nd_it, const e_access_traits& r_traits) argument
129 const size_type num_children = nd_it.num_children();
137 node_iterator pot = nd_it
[all...]
H A Dtrie_policy_base.hpp144 common_prefix_len(node_iterator nd_it, typename e_access_traits::const_iterator b_r, typename e_access_traits::const_iterator e_r, const e_access_traits& r_traits);
147 leftmost_it(node_iterator nd_it);
150 rightmost_it(node_iterator nd_it);
159 common_prefix_len(node_iterator nd_it, typename e_access_traits::const_iterator b_r, typename e_access_traits::const_iterator e_r, const e_access_traits& r_traits) argument
161 prefix_range_t pref_range = nd_it.valid_prefix();
199 leftmost_it(node_iterator nd_it) argument
201 if (nd_it.num_children() == 0)
202 return (*nd_it);
204 return (leftmost_it(nd_it.get_child(0)));
210 rightmost_it(node_iterator nd_it) argument
[all...]
/freebsd-11-stable/contrib/libstdc++/include/ext/pb_ds/detail/ov_tree_map_/
H A Dconstructors_destructor_fn_imps.hpp271 update(node_iterator nd_it, Node_Update* p_update) argument
274 if (nd_it == end_it)
276 update(nd_it.get_l_child(), p_update);
277 update(nd_it.get_r_child(), p_update);
278 node_update::operator()(nd_it, end_it);

Completed in 57 milliseconds