| /dports/games/frogatto/frogatto-1.3.1/MacOSJet/boost/include/boost/intrusive/ |
| H A D | sgtree_algorithms.hpp | 162 static void replace_node(node_ptr node_to_be_replaced, node_ptr new_node) in replace_node() argument
164 if(node_to_be_replaced == new_node) in replace_node()
166 replace_node(node_to_be_replaced, tree_algorithms::get_header(node_to_be_replaced), new_node); in replace_node()
185 static void replace_node(node_ptr node_to_be_replaced, node_ptr header, node_ptr new_node) in replace_node() argument
186 { tree_algorithms::replace_node(node_to_be_replaced, header, new_node); } in replace_node()
|
| H A D | treap_algorithms.hpp | 241 static void replace_node(node_ptr node_to_be_replaced, node_ptr new_node) in replace_node() argument
243 if(node_to_be_replaced == new_node) in replace_node()
245 replace_node(node_to_be_replaced, tree_algorithms::get_header(node_to_be_replaced), new_node); in replace_node()
264 static void replace_node(node_ptr node_to_be_replaced, node_ptr header, node_ptr new_node) in replace_node() argument
265 { tree_algorithms::replace_node(node_to_be_replaced, header, new_node); } in replace_node()
|
| H A D | avltree_algorithms.hpp | 200 static void replace_node(node_ptr node_to_be_replaced, node_ptr new_node) in replace_node() argument
202 if(node_to_be_replaced == new_node) in replace_node()
204 replace_node(node_to_be_replaced, tree_algorithms::get_header(node_to_be_replaced), new_node); in replace_node()
223 static void replace_node(node_ptr node_to_be_replaced, node_ptr header, node_ptr new_node) in replace_node() argument
225 tree_algorithms::replace_node(node_to_be_replaced, header, new_node); in replace_node()
226 NodeTraits::set_balance(new_node, NodeTraits::get_balance(node_to_be_replaced)); in replace_node()
|
| H A D | rbtree_algorithms.hpp | 252 static void replace_node(node_ptr node_to_be_replaced, node_ptr new_node) in replace_node() argument
254 if(node_to_be_replaced == new_node) in replace_node()
256 replace_node(node_to_be_replaced, tree_algorithms::get_header(node_to_be_replaced), new_node); in replace_node()
275 static void replace_node(node_ptr node_to_be_replaced, node_ptr header, node_ptr new_node) in replace_node() argument
277 tree_algorithms::replace_node(node_to_be_replaced, header, new_node); in replace_node()
278 NodeTraits::set_color(new_node, NodeTraits::get_color(node_to_be_replaced)); in replace_node()
|
| /dports/databases/percona57-pam-for-mysql/boost_1_59_0/boost/intrusive/ |
| H A D | rbtree_algorithms.hpp | 230 static void replace_node(const node_ptr & node_to_be_replaced, const node_ptr & new_node) in replace_node() argument
232 if(node_to_be_replaced == new_node) in replace_node()
234 replace_node(node_to_be_replaced, bstree_algo::get_header(node_to_be_replaced), new_node); in replace_node()
238 …static void replace_node(const node_ptr & node_to_be_replaced, const node_ptr & header, const node… in replace_node() argument
240 bstree_algo::replace_node(node_to_be_replaced, header, new_node); in replace_node()
241 NodeTraits::set_color(new_node, NodeTraits::get_color(node_to_be_replaced)); in replace_node()
|
| H A D | avltree_algorithms.hpp | 206 static void replace_node(const node_ptr & node_to_be_replaced, const node_ptr & new_node) in replace_node() argument
208 if(node_to_be_replaced == new_node) in replace_node()
210 replace_node(node_to_be_replaced, bstree_algo::get_header(node_to_be_replaced), new_node); in replace_node()
214 …static void replace_node(const node_ptr & node_to_be_replaced, const node_ptr & header, const node… in replace_node() argument
216 bstree_algo::replace_node(node_to_be_replaced, header, new_node); in replace_node()
217 NodeTraits::set_balance(new_node, NodeTraits::get_balance(node_to_be_replaced)); in replace_node()
|
| /dports/databases/xtrabackup/boost_1_59_0/boost/intrusive/ |
| H A D | rbtree_algorithms.hpp | 230 static void replace_node(const node_ptr & node_to_be_replaced, const node_ptr & new_node) in replace_node() argument
232 if(node_to_be_replaced == new_node) in replace_node()
234 replace_node(node_to_be_replaced, bstree_algo::get_header(node_to_be_replaced), new_node); in replace_node()
238 …static void replace_node(const node_ptr & node_to_be_replaced, const node_ptr & header, const node… in replace_node() argument
240 bstree_algo::replace_node(node_to_be_replaced, header, new_node); in replace_node()
241 NodeTraits::set_color(new_node, NodeTraits::get_color(node_to_be_replaced)); in replace_node()
|
| H A D | avltree_algorithms.hpp | 206 static void replace_node(const node_ptr & node_to_be_replaced, const node_ptr & new_node) in replace_node() argument
208 if(node_to_be_replaced == new_node) in replace_node()
210 replace_node(node_to_be_replaced, bstree_algo::get_header(node_to_be_replaced), new_node); in replace_node()
214 …static void replace_node(const node_ptr & node_to_be_replaced, const node_ptr & header, const node… in replace_node() argument
216 bstree_algo::replace_node(node_to_be_replaced, header, new_node); in replace_node()
217 NodeTraits::set_balance(new_node, NodeTraits::get_balance(node_to_be_replaced)); in replace_node()
|
| /dports/databases/percona57-server/boost_1_59_0/boost/intrusive/ |
| H A D | rbtree_algorithms.hpp | 230 static void replace_node(const node_ptr & node_to_be_replaced, const node_ptr & new_node) in replace_node() argument
232 if(node_to_be_replaced == new_node) in replace_node()
234 replace_node(node_to_be_replaced, bstree_algo::get_header(node_to_be_replaced), new_node); in replace_node()
238 …static void replace_node(const node_ptr & node_to_be_replaced, const node_ptr & header, const node… in replace_node() argument
240 bstree_algo::replace_node(node_to_be_replaced, header, new_node); in replace_node()
241 NodeTraits::set_color(new_node, NodeTraits::get_color(node_to_be_replaced)); in replace_node()
|
| H A D | avltree_algorithms.hpp | 206 static void replace_node(const node_ptr & node_to_be_replaced, const node_ptr & new_node) in replace_node() argument
208 if(node_to_be_replaced == new_node) in replace_node()
210 replace_node(node_to_be_replaced, bstree_algo::get_header(node_to_be_replaced), new_node); in replace_node()
214 …static void replace_node(const node_ptr & node_to_be_replaced, const node_ptr & header, const node… in replace_node() argument
216 bstree_algo::replace_node(node_to_be_replaced, header, new_node); in replace_node()
217 NodeTraits::set_balance(new_node, NodeTraits::get_balance(node_to_be_replaced)); in replace_node()
|
| /dports/databases/percona57-client/boost_1_59_0/boost/intrusive/ |
| H A D | rbtree_algorithms.hpp | 230 static void replace_node(const node_ptr & node_to_be_replaced, const node_ptr & new_node) in replace_node() argument
232 if(node_to_be_replaced == new_node) in replace_node()
234 replace_node(node_to_be_replaced, bstree_algo::get_header(node_to_be_replaced), new_node); in replace_node()
238 …static void replace_node(const node_ptr & node_to_be_replaced, const node_ptr & header, const node… in replace_node() argument
240 bstree_algo::replace_node(node_to_be_replaced, header, new_node); in replace_node()
241 NodeTraits::set_color(new_node, NodeTraits::get_color(node_to_be_replaced)); in replace_node()
|
| H A D | avltree_algorithms.hpp | 206 static void replace_node(const node_ptr & node_to_be_replaced, const node_ptr & new_node) in replace_node() argument
208 if(node_to_be_replaced == new_node) in replace_node()
210 replace_node(node_to_be_replaced, bstree_algo::get_header(node_to_be_replaced), new_node); in replace_node()
214 …static void replace_node(const node_ptr & node_to_be_replaced, const node_ptr & header, const node… in replace_node() argument
216 bstree_algo::replace_node(node_to_be_replaced, header, new_node); in replace_node()
217 NodeTraits::set_balance(new_node, NodeTraits::get_balance(node_to_be_replaced)); in replace_node()
|
| /dports/databases/mysqlwsrep57-server/boost_1_59_0/boost/intrusive/ |
| H A D | rbtree_algorithms.hpp | 230 static void replace_node(const node_ptr & node_to_be_replaced, const node_ptr & new_node) in replace_node() argument
232 if(node_to_be_replaced == new_node) in replace_node()
234 replace_node(node_to_be_replaced, bstree_algo::get_header(node_to_be_replaced), new_node); in replace_node()
238 …static void replace_node(const node_ptr & node_to_be_replaced, const node_ptr & header, const node… in replace_node() argument
240 bstree_algo::replace_node(node_to_be_replaced, header, new_node); in replace_node()
241 NodeTraits::set_color(new_node, NodeTraits::get_color(node_to_be_replaced)); in replace_node()
|
| /dports/databases/mysql57-client/mysql-5.7.36/boost/boost_1_59_0/boost/intrusive/ |
| H A D | rbtree_algorithms.hpp | 230 static void replace_node(const node_ptr & node_to_be_replaced, const node_ptr & new_node) in replace_node() argument
232 if(node_to_be_replaced == new_node) in replace_node()
234 replace_node(node_to_be_replaced, bstree_algo::get_header(node_to_be_replaced), new_node); in replace_node()
238 …static void replace_node(const node_ptr & node_to_be_replaced, const node_ptr & header, const node… in replace_node() argument
240 bstree_algo::replace_node(node_to_be_replaced, header, new_node); in replace_node()
241 NodeTraits::set_color(new_node, NodeTraits::get_color(node_to_be_replaced)); in replace_node()
|
| /dports/devel/boost-docs/boost_1_72_0/boost/intrusive/ |
| H A D | rbtree_algorithms.hpp | 230 static void replace_node(node_ptr node_to_be_replaced, node_ptr new_node) in replace_node() argument
232 if(node_to_be_replaced == new_node) in replace_node()
234 replace_node(node_to_be_replaced, bstree_algo::get_header(node_to_be_replaced), new_node); in replace_node()
238 static void replace_node(node_ptr node_to_be_replaced, node_ptr header, node_ptr new_node) in replace_node() argument
240 bstree_algo::replace_node(node_to_be_replaced, header, new_node); in replace_node()
241 NodeTraits::set_color(new_node, NodeTraits::get_color(node_to_be_replaced)); in replace_node()
|
| /dports/devel/hyperscan/boost_1_75_0/boost/intrusive/ |
| H A D | rbtree_algorithms.hpp | 230 static void replace_node(node_ptr node_to_be_replaced, node_ptr new_node) in replace_node() argument
232 if(node_to_be_replaced == new_node) in replace_node()
234 replace_node(node_to_be_replaced, bstree_algo::get_header(node_to_be_replaced), new_node); in replace_node()
238 static void replace_node(node_ptr node_to_be_replaced, node_ptr header, node_ptr new_node) in replace_node() argument
240 bstree_algo::replace_node(node_to_be_replaced, header, new_node); in replace_node()
241 NodeTraits::set_color(new_node, NodeTraits::get_color(node_to_be_replaced)); in replace_node()
|
| /dports/devel/R-cran-BH/BH/inst/include/boost/intrusive/ |
| H A D | rbtree_algorithms.hpp | 230 static void replace_node(node_ptr node_to_be_replaced, node_ptr new_node) BOOST_NOEXCEPT in replace_node() argument
232 if(node_to_be_replaced == new_node) in replace_node()
234 replace_node(node_to_be_replaced, bstree_algo::get_header(node_to_be_replaced), new_node); in replace_node()
238 …static void replace_node(node_ptr node_to_be_replaced, node_ptr header, node_ptr new_node) BOOST_N… in replace_node() argument
240 bstree_algo::replace_node(node_to_be_replaced, header, new_node); in replace_node()
241 NodeTraits::set_color(new_node, NodeTraits::get_color(node_to_be_replaced)); in replace_node()
|
| /dports/math/stanmath/math-4.2.0/lib/boost_1.75.0/boost/intrusive/ |
| H A D | rbtree_algorithms.hpp | 230 static void replace_node(node_ptr node_to_be_replaced, node_ptr new_node) in replace_node() argument
232 if(node_to_be_replaced == new_node) in replace_node()
234 replace_node(node_to_be_replaced, bstree_algo::get_header(node_to_be_replaced), new_node); in replace_node()
238 static void replace_node(node_ptr node_to_be_replaced, node_ptr header, node_ptr new_node) in replace_node() argument
240 bstree_algo::replace_node(node_to_be_replaced, header, new_node); in replace_node()
241 NodeTraits::set_color(new_node, NodeTraits::get_color(node_to_be_replaced)); in replace_node()
|
| /dports/science/py-scipy/scipy-1.7.1/scipy/_lib/boost/boost/intrusive/ |
| H A D | rbtree_algorithms.hpp | 230 static void replace_node(node_ptr node_to_be_replaced, node_ptr new_node) in replace_node() argument
232 if(node_to_be_replaced == new_node) in replace_node()
234 replace_node(node_to_be_replaced, bstree_algo::get_header(node_to_be_replaced), new_node); in replace_node()
238 static void replace_node(node_ptr node_to_be_replaced, node_ptr header, node_ptr new_node) in replace_node() argument
240 bstree_algo::replace_node(node_to_be_replaced, header, new_node); in replace_node()
241 NodeTraits::set_color(new_node, NodeTraits::get_color(node_to_be_replaced)); in replace_node()
|
| /dports/math/deal.ii/dealii-803d21ff957e349b3799cd3ef2c840bc78734305/bundled/boost-1.70.0/include/boost/intrusive/ |
| H A D | rbtree_algorithms.hpp | 230 static void replace_node(node_ptr node_to_be_replaced, node_ptr new_node) in replace_node() argument
232 if(node_to_be_replaced == new_node) in replace_node()
234 replace_node(node_to_be_replaced, bstree_algo::get_header(node_to_be_replaced), new_node); in replace_node()
238 static void replace_node(node_ptr node_to_be_replaced, node_ptr header, node_ptr new_node) in replace_node() argument
240 bstree_algo::replace_node(node_to_be_replaced, header, new_node); in replace_node()
241 NodeTraits::set_color(new_node, NodeTraits::get_color(node_to_be_replaced)); in replace_node()
|
| /dports/emulators/citra/citra-ac98458e0/externals/boost/boost/intrusive/ |
| H A D | rbtree_algorithms.hpp | 230 static void replace_node(node_ptr node_to_be_replaced, node_ptr new_node) in replace_node() argument
232 if(node_to_be_replaced == new_node) in replace_node()
234 replace_node(node_to_be_replaced, bstree_algo::get_header(node_to_be_replaced), new_node); in replace_node()
238 static void replace_node(node_ptr node_to_be_replaced, node_ptr header, node_ptr new_node) in replace_node() argument
240 bstree_algo::replace_node(node_to_be_replaced, header, new_node); in replace_node()
241 NodeTraits::set_color(new_node, NodeTraits::get_color(node_to_be_replaced)); in replace_node()
|
| /dports/emulators/citra-qt5/citra-ac98458e0/externals/boost/boost/intrusive/ |
| H A D | rbtree_algorithms.hpp | 230 static void replace_node(node_ptr node_to_be_replaced, node_ptr new_node) in replace_node() argument
232 if(node_to_be_replaced == new_node) in replace_node()
234 replace_node(node_to_be_replaced, bstree_algo::get_header(node_to_be_replaced), new_node); in replace_node()
238 static void replace_node(node_ptr node_to_be_replaced, node_ptr header, node_ptr new_node) in replace_node() argument
240 bstree_algo::replace_node(node_to_be_replaced, header, new_node); in replace_node()
241 NodeTraits::set_color(new_node, NodeTraits::get_color(node_to_be_replaced)); in replace_node()
|
| /dports/security/keybase/client-v5.7.1/shared/ios/Pods/boost-for-react-native/boost/intrusive/ |
| H A D | rbtree_algorithms.hpp | 230 static void replace_node(const node_ptr & node_to_be_replaced, const node_ptr & new_node) in replace_node() argument
232 if(node_to_be_replaced == new_node) in replace_node()
234 replace_node(node_to_be_replaced, bstree_algo::get_header(node_to_be_replaced), new_node); in replace_node()
238 …static void replace_node(const node_ptr & node_to_be_replaced, const node_ptr & header, const node… in replace_node() argument
240 bstree_algo::replace_node(node_to_be_replaced, header, new_node); in replace_node()
241 NodeTraits::set_color(new_node, NodeTraits::get_color(node_to_be_replaced)); in replace_node()
|
| /dports/devel/boost-libs/boost_1_72_0/boost/intrusive/ |
| H A D | rbtree_algorithms.hpp | 230 static void replace_node(node_ptr node_to_be_replaced, node_ptr new_node) in replace_node() argument
232 if(node_to_be_replaced == new_node) in replace_node()
234 replace_node(node_to_be_replaced, bstree_algo::get_header(node_to_be_replaced), new_node); in replace_node()
238 static void replace_node(node_ptr node_to_be_replaced, node_ptr header, node_ptr new_node) in replace_node() argument
240 bstree_algo::replace_node(node_to_be_replaced, header, new_node); in replace_node()
241 NodeTraits::set_color(new_node, NodeTraits::get_color(node_to_be_replaced)); in replace_node()
|
| /dports/devel/boost-python-libs/boost_1_72_0/boost/intrusive/ |
| H A D | rbtree_algorithms.hpp | 230 static void replace_node(node_ptr node_to_be_replaced, node_ptr new_node) in replace_node() argument
232 if(node_to_be_replaced == new_node) in replace_node()
234 replace_node(node_to_be_replaced, bstree_algo::get_header(node_to_be_replaced), new_node); in replace_node()
238 static void replace_node(node_ptr node_to_be_replaced, node_ptr header, node_ptr new_node) in replace_node() argument
240 bstree_algo::replace_node(node_to_be_replaced, header, new_node); in replace_node()
241 NodeTraits::set_color(new_node, NodeTraits::get_color(node_to_be_replaced)); in replace_node()
|