/freebsd-11-stable/contrib/libstdc++/include/ext/pb_ds/detail/tree_policy/ |
H A D | sample_tree_node_update.hpp | 72 // Updates the rank of a node through a node_iterator node_it; end_nd_it is the end node iterator. 74 operator()(node_iterator node_it, const_node_iterator end_nd_it) const;
|
H A D | order_statistics_imp.hpp | 52 node_iterator it = node_begin(); 54 node_iterator end_it = node_end(); 58 node_iterator l_it = it.get_l_child(); 132 operator()(node_iterator node_it, const_node_iterator end_nd_it) const 134 node_iterator l_child_it = node_it.get_l_child(); 137 node_iterator r_child_it = node_it.get_r_child();
|
/freebsd-11-stable/contrib/libstdc++/include/ext/pb_ds/detail/trie_policy/ |
H A D | sample_trie_node_update.hpp | 72 // Updates the rank of a node through a node_iterator node_it; end_nd_it is the end node iterator. 74 operator()(node_iterator node_it, const_node_iterator end_nd_it) const;
|
H A D | trie_policy_base.hpp | 96 typedef Node_Iterator node_iterator; typedef in class:pb_ds::detail::trie_policy_base 100 typedef typename node_iterator::value_type iterator; 121 virtual node_iterator 127 virtual node_iterator 144 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) 199 leftmost_it(node_iterator nd_it) 210 rightmost_it(node_iterator nd_i [all...] |
H A D | prefix_search_node_update_imp.hpp | 125 typename PB_DS_CLASS_C_DEC::node_iterator 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) 131 node_iterator ret = end_nd_it; 137 node_iterator pot = nd_it.get_child(i); 156 operator()(node_iterator /*nd_it*/, const_node_iterator /*end_nd_it*/) const
|
H A D | order_statistics_imp.hpp | 57 node_iterator nd_it = node_begin(); 59 node_iterator end_nd_it = node_end(); 73 node_iterator child_nd_it = nd_it.get_child(i); 174 operator()(node_iterator nd_it, const_node_iterator /*end_nd_it*/) const
|
/freebsd-11-stable/contrib/libstdc++/include/ext/pb_ds/detail/pat_trie_/ |
H A D | update_fn_imps.hpp | 59 Node_Update_::operator()(node_iterator(p_nd, this),
|
H A D | iterators_fn_imps.hpp | 110 inline typename PB_DS_CLASS_C_DEC::node_iterator 113 { return node_iterator(m_p_head->m_p_parent, this); } 122 inline typename PB_DS_CLASS_C_DEC::node_iterator 125 { return node_iterator(NULL, this); }
|
H A D | traits.hpp | 200 node_iterator; typedef in struct:pb_ds::detail::trie_traits 205 node_iterator, 213 node_iterator, 333 typedef const_node_iterator node_iterator; typedef in struct:pb_ds::detail::trie_traits 338 node_iterator,
|
H A D | pat_trie_.hpp | 199 typedef typename Node_And_It_Traits::node_iterator node_iterator; typedef in class:pb_ds::detail::PB_DS_CLASS_NAME 326 inline node_iterator 332 inline node_iterator
|
/freebsd-11-stable/contrib/libstdc++/include/ext/pb_ds/detail/ov_tree_map_/ |
H A D | iterators_fn_imps.hpp | 60 inline typename PB_DS_CLASS_C_DEC::node_iterator 66 inline typename PB_DS_CLASS_C_DEC::node_iterator 93 inline typename PB_DS_CLASS_C_DEC::node_iterator 97 return node_iterator(mid_pointer(begin(), end()), begin(), end(), 102 inline typename PB_DS_CLASS_C_DEC::node_iterator 106 return node_iterator(end(), end(),
|
H A D | traits.hpp | 105 node_iterator; typedef in struct:pb_ds::detail::tree_traits 110 node_iterator, 118 node_iterator, 166 typedef const_node_iterator node_iterator; typedef in struct:pb_ds::detail::tree_traits 179 node_iterator,
|
H A D | ov_tree_map_.hpp | 112 typename Node_And_It_Traits::node_iterator, \ 203 typedef typename Node_And_It_Traits::node_iterator node_iterator; typedef in class:pb_ds::detail::PB_DS_OV_TREE_CLASS_NAME 377 inline node_iterator 380 inline node_iterator 386 update(node_iterator /*it*/, null_node_update_pointer); 390 update(node_iterator, Node_Update*); 488 inline node_iterator 491 inline node_iterator
|
H A D | constructors_destructor_fn_imps.hpp | 264 update(node_iterator /*it*/, null_node_update_pointer) 271 update(node_iterator nd_it, Node_Update* p_update)
|
/freebsd-11-stable/contrib/libstdc++/include/ext/pb_ds/ |
H A D | tree_policy.hpp | 90 typedef Node_Iterator node_iterator; typedef in class:pb_ds::tree_order_statistics_node_update 92 typedef typename node_iterator::value_type iterator; 134 // Returns the node_iterator associated with the tree's root node. 135 virtual node_iterator 142 // Returns the node_iterator associated with a just-after leaf node. 143 virtual node_iterator 151 // Updates the rank of a node through a node_iterator node_it; 154 operator()(node_iterator node_it, const_node_iterator end_nd_it) const;
|
H A D | trie_policy.hpp | 179 typedef Node_Iterator node_iterator; typedef in class:pb_ds::trie_prefix_search_node_update 181 typedef typename node_iterator::value_type iterator; 206 operator()(node_iterator node_it, const_node_iterator end_nd_it) const; 221 // Returns the node_iterator associated with the trie's root node. 222 virtual node_iterator 229 // Returns the node_iterator associated with a just-after leaf node. 230 virtual node_iterator 237 node_iterator 238 next_child(node_iterator, const_e_iterator, const_e_iterator, 239 node_iterator, cons 269 typedef Node_Iterator node_iterator; typedef in class:pb_ds::trie_order_statistics_node_update [all...] |
/freebsd-11-stable/contrib/libstdc++/include/ext/pb_ds/detail/bin_search_tree_/ |
H A D | iterators_fn_imps.hpp | 120 inline typename PB_DS_CLASS_C_DEC::node_iterator 124 return (node_iterator(m_p_head->m_p_parent)); 136 inline typename PB_DS_CLASS_C_DEC::node_iterator 140 return (node_iterator(NULL));
|
H A D | traits.hpp | 148 node_iterator; typedef in struct:pb_ds::detail::bin_search_tree_traits 153 node_iterator, 161 node_iterator, 234 typedef const_node_iterator node_iterator; typedef in struct:pb_ds::detail::bin_search_tree_traits 239 node_iterator, 247 node_iterator,
|
H A D | bin_search_tree_.hpp | 119 typename Node_And_It_Traits::node_iterator, \ 240 typedef typename Node_And_It_Traits::node_iterator node_iterator; typedef in class:pb_ds::detail::PB_DS_CLASS_NAME 323 inline node_iterator 329 inline node_iterator
|
H A D | rotate_fn_imps.hpp | 139 node_iterator(p_nd),
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Analysis/ |
H A D | IntervalPartition.cpp | 58 for (Interval::node_iterator It = I->Nodes.begin(), End = I->Nodes.end();
|
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/Analysis/ |
H A D | Interval.h | 45 using node_iterator = std::vector<BasicBlock*>::iterator;
|
/freebsd-11-stable/contrib/llvm-project/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ |
H A D | ExplodedGraph.h | 397 using node_iterator = AllNodesTy::iterator; 400 node_iterator nodes_begin() { return Nodes.begin(); } 402 node_iterator nodes_end() { return Nodes.end(); }
|
/freebsd-11-stable/contrib/llvm-project/clang/lib/StaticAnalyzer/Checkers/ |
H A D | AnalyzerStatsChecker.cpp | 54 for (ExplodedGraph::node_iterator I = G.nodes_begin();
|
H A D | UnreachableCodeChecker.cpp | 61 for (ExplodedGraph::node_iterator I = G.nodes_begin(), E = G.nodes_end();
|