/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/ext/pb_ds/detail/ |
H A D | tree_trace_base.hpp | 119 trace_node(node_const_iterator nd_it, size_type level) const argument 121 if (nd_it.get_r_child() != node_end()) 122 trace_node(nd_it.get_r_child(), level + 1); 127 print_node_pointer(nd_it, integral_constant<int,Node_Based>()); 128 std::cerr << base_type::extract_key(*(*nd_it)); 133 trace_it_metadata(nd_it, m_type_ind_t()); 137 if (nd_it.get_l_child() != node_end()) 138 trace_node(nd_it.get_l_child(), level + 1); 145 trace_it_metadata(Node_CItr nd_it, type_to_type<Metadata_>) argument 147 const unsigned long ul = static_cast<unsigned long>(nd_it 160 print_node_pointer(Node_CItr nd_it, integral_constant<int,true>) argument 166 print_node_pointer(Node_CItr nd_it, integral_constant<int,false>) argument 167 { std::cerr << *nd_it << " "; } local [all...] |
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/ext/pb_ds/detail/trie_policy/ |
H A D | order_statistics_imp.hpp | 50 node_iterator nd_it = node_begin(); local 54 if (order > nd_it.get_metadata()) 55 return ++base_type::rightmost_it(nd_it); 57 const size_type num_children = nd_it.num_children(); 59 return *nd_it; 63 node_iterator child_nd_it = nd_it.get_child(i); 67 nd_it = child_nd_it; 104 node_const_iterator nd_it = node_begin(); local 110 const size_type num_children = nd_it.num_children(); 113 key_const_reference r_key = base_type::extract_key(*(*nd_it)); 151 operator ()(node_iterator nd_it, node_const_iterator ) const argument [all...] |
H A D | prefix_search_node_update_imp.hpp | 86 Node_Itr nd_it = node_begin(); local 94 if (nd_it == end_nd_it) 98 base_type::common_prefix_len(nd_it, b, e, r_traits); 102 iterator ret_b = this->leftmost_it(nd_it); 103 iterator ret_e = this->rightmost_it(nd_it); 106 nd_it = next_child(nd_it, b, e, end_nd_it, r_traits); 113 next_child(node_iterator nd_it, typename access_traits::const_iterator b, argument 117 const size_type num_children = nd_it.num_children(); 122 node_iterator pot = nd_it [all...] |
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/ext/pb_ds/detail/ |
H A D | tree_trace_base.hpp | 119 trace_node(node_const_iterator nd_it, size_type level) const argument 121 if (nd_it.get_r_child() != node_end()) 122 trace_node(nd_it.get_r_child(), level + 1); 127 print_node_pointer(nd_it, integral_constant<int,Node_Based>()); 128 std::cerr << base_type::extract_key(*(*nd_it)); 133 trace_it_metadata(nd_it, m_type_ind_t()); 137 if (nd_it.get_l_child() != node_end()) 138 trace_node(nd_it.get_l_child(), level + 1); 145 trace_it_metadata(Node_CItr nd_it, type_to_type<Metadata_>) argument 147 const unsigned long ul = static_cast<unsigned long>(nd_it 160 print_node_pointer(Node_CItr nd_it, integral_constant<int,true>) argument 166 print_node_pointer(Node_CItr nd_it, integral_constant<int,false>) argument 167 { std::cerr << *nd_it << " "; } local [all...] |
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/ext/pb_ds/detail/trie_policy/ |
H A D | order_statistics_imp.hpp | 50 node_iterator nd_it = node_begin(); local 54 if (order > nd_it.get_metadata()) 55 return ++base_type::rightmost_it(nd_it); 57 const size_type num_children = nd_it.num_children(); 59 return *nd_it; 63 node_iterator child_nd_it = nd_it.get_child(i); 67 nd_it = child_nd_it; 104 node_const_iterator nd_it = node_begin(); local 110 const size_type num_children = nd_it.num_children(); 113 key_const_reference r_key = base_type::extract_key(*(*nd_it)); 151 operator ()(node_iterator nd_it, node_const_iterator ) const argument [all...] |
H A D | prefix_search_node_update_imp.hpp | 86 Node_Itr nd_it = node_begin(); local 94 if (nd_it == end_nd_it) 98 base_type::common_prefix_len(nd_it, b, e, r_traits); 102 iterator ret_b = this->leftmost_it(nd_it); 103 iterator ret_e = this->rightmost_it(nd_it); 106 nd_it = next_child(nd_it, b, e, end_nd_it, r_traits); 113 next_child(node_iterator nd_it, typename access_traits::const_iterator b, argument 117 const size_type num_children = nd_it.num_children(); 122 node_iterator pot = nd_it [all...] |
/prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/mingw/include/c++/4.8.3/ext/pb_ds/detail/ |
H A D | tree_trace_base.hpp | 119 trace_node(node_const_iterator nd_it, size_type level) const argument 121 if (nd_it.get_r_child() != node_end()) 122 trace_node(nd_it.get_r_child(), level + 1); 127 print_node_pointer(nd_it, integral_constant<int,Node_Based>()); 128 std::cerr << base_type::extract_key(*(*nd_it)); 133 trace_it_metadata(nd_it, m_type_ind_t()); 137 if (nd_it.get_l_child() != node_end()) 138 trace_node(nd_it.get_l_child(), level + 1); 145 trace_it_metadata(Node_CItr nd_it, type_to_type<Metadata_>) argument 147 const unsigned long ul = static_cast<unsigned long>(nd_it 160 print_node_pointer(Node_CItr nd_it, integral_constant<int,true>) argument 166 print_node_pointer(Node_CItr nd_it, integral_constant<int,false>) argument 167 { std::cerr << *nd_it << " "; } local [all...] |
/prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/mingw/include/c++/4.8.3/ext/pb_ds/detail/trie_policy/ |
H A D | order_statistics_imp.hpp | 50 node_iterator nd_it = node_begin(); local 54 if (order > nd_it.get_metadata()) 55 return ++base_type::rightmost_it(nd_it); 57 const size_type num_children = nd_it.num_children(); 59 return *nd_it; 63 node_iterator child_nd_it = nd_it.get_child(i); 67 nd_it = child_nd_it; 104 node_const_iterator nd_it = node_begin(); local 110 const size_type num_children = nd_it.num_children(); 113 key_const_reference r_key = base_type::extract_key(*(*nd_it)); 151 operator ()(node_iterator nd_it, node_const_iterator ) const argument [all...] |
H A D | prefix_search_node_update_imp.hpp | 86 Node_Itr nd_it = node_begin(); local 94 if (nd_it == end_nd_it) 98 base_type::common_prefix_len(nd_it, b, e, r_traits); 102 iterator ret_b = this->leftmost_it(nd_it); 103 iterator ret_e = this->rightmost_it(nd_it); 106 nd_it = next_child(nd_it, b, e, end_nd_it, r_traits); 113 next_child(node_iterator nd_it, typename access_traits::const_iterator b, argument 117 const size_type num_children = nd_it.num_children(); 122 node_iterator pot = nd_it [all...] |
/prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/ext/pb_ds/detail/ |
H A D | tree_trace_base.hpp | 119 trace_node(node_const_iterator nd_it, size_type level) const argument 121 if (nd_it.get_r_child() != node_end()) 122 trace_node(nd_it.get_r_child(), level + 1); 127 print_node_pointer(nd_it, integral_constant<int,Node_Based>()); 128 std::cerr << base_type::extract_key(*(*nd_it)); 133 trace_it_metadata(nd_it, m_type_ind_t()); 137 if (nd_it.get_l_child() != node_end()) 138 trace_node(nd_it.get_l_child(), level + 1); 145 trace_it_metadata(Node_CItr nd_it, type_to_type<Metadata_>) argument 147 const unsigned long ul = static_cast<unsigned long>(nd_it 160 print_node_pointer(Node_CItr nd_it, integral_constant<int,true>) argument 166 print_node_pointer(Node_CItr nd_it, integral_constant<int,false>) argument 167 { std::cerr << *nd_it << " "; } local [all...] |
/prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/ext/pb_ds/detail/trie_policy/ |
H A D | order_statistics_imp.hpp | 50 node_iterator nd_it = node_begin(); local 54 if (order > nd_it.get_metadata()) 55 return ++base_type::rightmost_it(nd_it); 57 const size_type num_children = nd_it.num_children(); 59 return *nd_it; 63 node_iterator child_nd_it = nd_it.get_child(i); 67 nd_it = child_nd_it; 104 node_const_iterator nd_it = node_begin(); local 110 const size_type num_children = nd_it.num_children(); 113 key_const_reference r_key = base_type::extract_key(*(*nd_it)); 151 operator ()(node_iterator nd_it, node_const_iterator ) const argument [all...] |
H A D | prefix_search_node_update_imp.hpp | 86 Node_Itr nd_it = node_begin(); local 94 if (nd_it == end_nd_it) 98 base_type::common_prefix_len(nd_it, b, e, r_traits); 102 iterator ret_b = this->leftmost_it(nd_it); 103 iterator ret_e = this->rightmost_it(nd_it); 106 nd_it = next_child(nd_it, b, e, end_nd_it, r_traits); 113 next_child(node_iterator nd_it, typename access_traits::const_iterator b, argument 117 const size_type num_children = nd_it.num_children(); 122 node_iterator pot = nd_it [all...] |
/prebuilts/ndk/current/sources/cxx-stl/gnu-libstdc++/4.9/include/ext/pb_ds/detail/ |
H A D | tree_trace_base.hpp | 119 trace_node(node_const_iterator nd_it, size_type level) const argument 121 if (nd_it.get_r_child() != node_end()) 122 trace_node(nd_it.get_r_child(), level + 1); 127 print_node_pointer(nd_it, integral_constant<int,Node_Based>()); 128 std::cerr << base_type::extract_key(*(*nd_it)); 133 trace_it_metadata(nd_it, m_type_ind_t()); 137 if (nd_it.get_l_child() != node_end()) 138 trace_node(nd_it.get_l_child(), level + 1); 145 trace_it_metadata(Node_CItr nd_it, type_to_type<Metadata_>) argument 147 const unsigned long ul = static_cast<unsigned long>(nd_it 160 print_node_pointer(Node_CItr nd_it, integral_constant<int,true>) argument 166 print_node_pointer(Node_CItr nd_it, integral_constant<int,false>) argument 167 { std::cerr << *nd_it << " "; } local [all...] |
/prebuilts/ndk/current/sources/cxx-stl/gnu-libstdc++/4.9/include/ext/pb_ds/detail/trie_policy/ |
H A D | order_statistics_imp.hpp | 50 node_iterator nd_it = node_begin(); local 54 if (order > nd_it.get_metadata()) 55 return ++base_type::rightmost_it(nd_it); 57 const size_type num_children = nd_it.num_children(); 59 return *nd_it; 63 node_iterator child_nd_it = nd_it.get_child(i); 67 nd_it = child_nd_it; 104 node_const_iterator nd_it = node_begin(); local 110 const size_type num_children = nd_it.num_children(); 113 key_const_reference r_key = base_type::extract_key(*(*nd_it)); 151 operator ()(node_iterator nd_it, node_const_iterator ) const argument [all...] |
H A D | prefix_search_node_update_imp.hpp | 86 Node_Itr nd_it = node_begin(); local 94 if (nd_it == end_nd_it) 98 base_type::common_prefix_len(nd_it, b, e, r_traits); 102 iterator ret_b = this->leftmost_it(nd_it); 103 iterator ret_e = this->rightmost_it(nd_it); 106 nd_it = next_child(nd_it, b, e, end_nd_it, r_traits); 113 next_child(node_iterator nd_it, typename access_traits::const_iterator b, argument 117 const size_type num_children = nd_it.num_children(); 122 node_iterator pot = nd_it [all...] |
/prebuilts/ndk/r10/sources/cxx-stl/gnu-libstdc++/4.9/include/ext/pb_ds/detail/ |
H A D | tree_trace_base.hpp | 119 trace_node(node_const_iterator nd_it, size_type level) const argument 121 if (nd_it.get_r_child() != node_end()) 122 trace_node(nd_it.get_r_child(), level + 1); 127 print_node_pointer(nd_it, integral_constant<int,Node_Based>()); 128 std::cerr << base_type::extract_key(*(*nd_it)); 133 trace_it_metadata(nd_it, m_type_ind_t()); 137 if (nd_it.get_l_child() != node_end()) 138 trace_node(nd_it.get_l_child(), level + 1); 145 trace_it_metadata(Node_CItr nd_it, type_to_type<Metadata_>) argument 147 const unsigned long ul = static_cast<unsigned long>(nd_it 160 print_node_pointer(Node_CItr nd_it, integral_constant<int,true>) argument 166 print_node_pointer(Node_CItr nd_it, integral_constant<int,false>) argument 167 { std::cerr << *nd_it << " "; } local [all...] |
/prebuilts/ndk/r10/sources/cxx-stl/gnu-libstdc++/4.9/include/ext/pb_ds/detail/trie_policy/ |
H A D | order_statistics_imp.hpp | 50 node_iterator nd_it = node_begin(); local 54 if (order > nd_it.get_metadata()) 55 return ++base_type::rightmost_it(nd_it); 57 const size_type num_children = nd_it.num_children(); 59 return *nd_it; 63 node_iterator child_nd_it = nd_it.get_child(i); 67 nd_it = child_nd_it; 104 node_const_iterator nd_it = node_begin(); local 110 const size_type num_children = nd_it.num_children(); 113 key_const_reference r_key = base_type::extract_key(*(*nd_it)); 151 operator ()(node_iterator nd_it, node_const_iterator ) const argument [all...] |
H A D | prefix_search_node_update_imp.hpp | 86 Node_Itr nd_it = node_begin(); local 94 if (nd_it == end_nd_it) 98 base_type::common_prefix_len(nd_it, b, e, r_traits); 102 iterator ret_b = this->leftmost_it(nd_it); 103 iterator ret_e = this->rightmost_it(nd_it); 106 nd_it = next_child(nd_it, b, e, end_nd_it, r_traits); 113 next_child(node_iterator nd_it, typename access_traits::const_iterator b, argument 117 const size_type num_children = nd_it.num_children(); 122 node_iterator pot = nd_it [all...] |
/prebuilts/ndk/r11/sources/cxx-stl/gnu-libstdc++/4.9/include/ext/pb_ds/detail/ |
H A D | tree_trace_base.hpp | 119 trace_node(node_const_iterator nd_it, size_type level) const argument 121 if (nd_it.get_r_child() != node_end()) 122 trace_node(nd_it.get_r_child(), level + 1); 127 print_node_pointer(nd_it, integral_constant<int,Node_Based>()); 128 std::cerr << base_type::extract_key(*(*nd_it)); 133 trace_it_metadata(nd_it, m_type_ind_t()); 137 if (nd_it.get_l_child() != node_end()) 138 trace_node(nd_it.get_l_child(), level + 1); 145 trace_it_metadata(Node_CItr nd_it, type_to_type<Metadata_>) argument 147 const unsigned long ul = static_cast<unsigned long>(nd_it 160 print_node_pointer(Node_CItr nd_it, integral_constant<int,true>) argument 166 print_node_pointer(Node_CItr nd_it, integral_constant<int,false>) argument 167 { std::cerr << *nd_it << " "; } local [all...] |
/prebuilts/ndk/r11/sources/cxx-stl/gnu-libstdc++/4.9/include/ext/pb_ds/detail/trie_policy/ |
H A D | order_statistics_imp.hpp | 50 node_iterator nd_it = node_begin(); local 54 if (order > nd_it.get_metadata()) 55 return ++base_type::rightmost_it(nd_it); 57 const size_type num_children = nd_it.num_children(); 59 return *nd_it; 63 node_iterator child_nd_it = nd_it.get_child(i); 67 nd_it = child_nd_it; 104 node_const_iterator nd_it = node_begin(); local 110 const size_type num_children = nd_it.num_children(); 113 key_const_reference r_key = base_type::extract_key(*(*nd_it)); 151 operator ()(node_iterator nd_it, node_const_iterator ) const argument [all...] |
H A D | prefix_search_node_update_imp.hpp | 86 Node_Itr nd_it = node_begin(); local 94 if (nd_it == end_nd_it) 98 base_type::common_prefix_len(nd_it, b, e, r_traits); 102 iterator ret_b = this->leftmost_it(nd_it); 103 iterator ret_e = this->rightmost_it(nd_it); 106 nd_it = next_child(nd_it, b, e, end_nd_it, r_traits); 113 next_child(node_iterator nd_it, typename access_traits::const_iterator b, argument 117 const size_type num_children = nd_it.num_children(); 122 node_iterator pot = nd_it [all...] |
/prebuilts/ndk/r13/sources/cxx-stl/gnu-libstdc++/4.9/include/ext/pb_ds/detail/ |
H A D | tree_trace_base.hpp | 119 trace_node(node_const_iterator nd_it, size_type level) const argument 121 if (nd_it.get_r_child() != node_end()) 122 trace_node(nd_it.get_r_child(), level + 1); 127 print_node_pointer(nd_it, integral_constant<int,Node_Based>()); 128 std::cerr << base_type::extract_key(*(*nd_it)); 133 trace_it_metadata(nd_it, m_type_ind_t()); 137 if (nd_it.get_l_child() != node_end()) 138 trace_node(nd_it.get_l_child(), level + 1); 145 trace_it_metadata(Node_CItr nd_it, type_to_type<Metadata_>) argument 147 const unsigned long ul = static_cast<unsigned long>(nd_it 160 print_node_pointer(Node_CItr nd_it, integral_constant<int,true>) argument 166 print_node_pointer(Node_CItr nd_it, integral_constant<int,false>) argument 167 { std::cerr << *nd_it << " "; } local [all...] |
/prebuilts/ndk/r13/sources/cxx-stl/gnu-libstdc++/4.9/include/ext/pb_ds/detail/trie_policy/ |
H A D | order_statistics_imp.hpp | 50 node_iterator nd_it = node_begin(); local 54 if (order > nd_it.get_metadata()) 55 return ++base_type::rightmost_it(nd_it); 57 const size_type num_children = nd_it.num_children(); 59 return *nd_it; 63 node_iterator child_nd_it = nd_it.get_child(i); 67 nd_it = child_nd_it; 104 node_const_iterator nd_it = node_begin(); local 110 const size_type num_children = nd_it.num_children(); 113 key_const_reference r_key = base_type::extract_key(*(*nd_it)); 151 operator ()(node_iterator nd_it, node_const_iterator ) const argument [all...] |
H A D | prefix_search_node_update_imp.hpp | 86 Node_Itr nd_it = node_begin(); local 94 if (nd_it == end_nd_it) 98 base_type::common_prefix_len(nd_it, b, e, r_traits); 102 iterator ret_b = this->leftmost_it(nd_it); 103 iterator ret_e = this->rightmost_it(nd_it); 106 nd_it = next_child(nd_it, b, e, end_nd_it, r_traits); 113 next_child(node_iterator nd_it, typename access_traits::const_iterator b, argument 117 const size_type num_children = nd_it.num_children(); 122 node_iterator pot = nd_it [all...] |
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/ext/pb_ds/detail/ov_tree_map_/ |
H A D | constructors_destructor_fn_imps.hpp | 248 update(node_iterator nd_it, Node_Update* p_update) argument 251 if (nd_it != end_it) 253 update(nd_it.get_l_child(), p_update); 254 update(nd_it.get_r_child(), p_update); 255 node_update::operator()(nd_it, end_it);
|