Home
last modified time | relevance | path

Searched refs:splay_down (Results 1 – 25 of 72) sorted by relevance

123

/dports/databases/percona57-pam-for-mysql/boost_1_59_0/boost/intrusive/
H A Dsplaytree_algorithms.hpp293 splay_down(detail::uncast(header), key, comp); in lower_bound()
312 splay_down(detail::uncast(header), key, comp); in upper_bound()
331 splay_down(detail::uncast(header), key, comp); in find()
348 splay_down(detail::uncast(header), key, comp); in equal_range()
367 splay_down(detail::uncast(header), key, comp); in lower_bound_range()
387 splay_down(detail::uncast(header), lower_key, comp); in bounded_range()
408 splay_down(header, new_node, comp); in insert_equal_upper_bound()
418 splay_down(header, new_node, comp); in insert_equal_lower_bound()
428 splay_down(header, new_node, comp); in insert_equal()
465 splay_down(header, key, comp); in insert_unique_check()
[all …]
H A Dsplaytree.hpp469 iterator splay_down(const KeyType &key, KeyTypeKeyCompare comp) in splay_down() function in boost::intrusive::splaytree_impl
473 node_ptr r = node_algorithms::splay_down(tree_type::header_ptr(), key, key_node_comp); in splay_down()
486 iterator splay_down(const key_type &key) in splay_down() function in boost::intrusive::splaytree_impl
487 { return this->splay_down(key, this->key_comp()); } in splay_down()
/dports/databases/xtrabackup/boost_1_59_0/boost/intrusive/
H A Dsplaytree_algorithms.hpp293 splay_down(detail::uncast(header), key, comp); in lower_bound()
312 splay_down(detail::uncast(header), key, comp); in upper_bound()
331 splay_down(detail::uncast(header), key, comp); in find()
348 splay_down(detail::uncast(header), key, comp); in equal_range()
367 splay_down(detail::uncast(header), key, comp); in lower_bound_range()
387 splay_down(detail::uncast(header), lower_key, comp); in bounded_range()
408 splay_down(header, new_node, comp); in insert_equal_upper_bound()
418 splay_down(header, new_node, comp); in insert_equal_lower_bound()
428 splay_down(header, new_node, comp); in insert_equal()
465 splay_down(header, key, comp); in insert_unique_check()
[all …]
H A Dsplaytree.hpp469 iterator splay_down(const KeyType &key, KeyTypeKeyCompare comp) in splay_down() function in boost::intrusive::splaytree_impl
473 node_ptr r = node_algorithms::splay_down(tree_type::header_ptr(), key, key_node_comp); in splay_down()
486 iterator splay_down(const key_type &key) in splay_down() function in boost::intrusive::splaytree_impl
487 { return this->splay_down(key, this->key_comp()); } in splay_down()
/dports/databases/percona57-server/boost_1_59_0/boost/intrusive/
H A Dsplaytree_algorithms.hpp293 splay_down(detail::uncast(header), key, comp); in lower_bound()
312 splay_down(detail::uncast(header), key, comp); in upper_bound()
331 splay_down(detail::uncast(header), key, comp); in find()
348 splay_down(detail::uncast(header), key, comp); in equal_range()
367 splay_down(detail::uncast(header), key, comp); in lower_bound_range()
387 splay_down(detail::uncast(header), lower_key, comp); in bounded_range()
408 splay_down(header, new_node, comp); in insert_equal_upper_bound()
418 splay_down(header, new_node, comp); in insert_equal_lower_bound()
428 splay_down(header, new_node, comp); in insert_equal()
465 splay_down(header, key, comp); in insert_unique_check()
[all …]
/dports/databases/percona57-client/boost_1_59_0/boost/intrusive/
H A Dsplaytree_algorithms.hpp293 splay_down(detail::uncast(header), key, comp); in lower_bound()
312 splay_down(detail::uncast(header), key, comp); in upper_bound()
331 splay_down(detail::uncast(header), key, comp); in find()
348 splay_down(detail::uncast(header), key, comp); in equal_range()
367 splay_down(detail::uncast(header), key, comp); in lower_bound_range()
387 splay_down(detail::uncast(header), lower_key, comp); in bounded_range()
408 splay_down(header, new_node, comp); in insert_equal_upper_bound()
418 splay_down(header, new_node, comp); in insert_equal_lower_bound()
428 splay_down(header, new_node, comp); in insert_equal()
465 splay_down(header, key, comp); in insert_unique_check()
[all …]
/dports/databases/mysqlwsrep57-server/boost_1_59_0/boost/intrusive/
H A Dsplaytree_algorithms.hpp293 splay_down(detail::uncast(header), key, comp); in lower_bound()
312 splay_down(detail::uncast(header), key, comp); in upper_bound()
331 splay_down(detail::uncast(header), key, comp); in find()
348 splay_down(detail::uncast(header), key, comp); in equal_range()
367 splay_down(detail::uncast(header), key, comp); in lower_bound_range()
387 splay_down(detail::uncast(header), lower_key, comp); in bounded_range()
408 splay_down(header, new_node, comp); in insert_equal_upper_bound()
418 splay_down(header, new_node, comp); in insert_equal_lower_bound()
428 splay_down(header, new_node, comp); in insert_equal()
465 splay_down(header, key, comp); in insert_unique_check()
[all …]
/dports/databases/mysql57-client/mysql-5.7.36/boost/boost_1_59_0/boost/intrusive/
H A Dsplaytree_algorithms.hpp293 splay_down(detail::uncast(header), key, comp); in lower_bound()
312 splay_down(detail::uncast(header), key, comp); in upper_bound()
331 splay_down(detail::uncast(header), key, comp); in find()
348 splay_down(detail::uncast(header), key, comp); in equal_range()
367 splay_down(detail::uncast(header), key, comp); in lower_bound_range()
387 splay_down(detail::uncast(header), lower_key, comp); in bounded_range()
408 splay_down(header, new_node, comp); in insert_equal_upper_bound()
418 splay_down(header, new_node, comp); in insert_equal_lower_bound()
428 splay_down(header, new_node, comp); in insert_equal()
465 splay_down(header, key, comp); in insert_unique_check()
[all …]
/dports/databases/mongodb36/mongodb-src-r3.6.23/src/third_party/boost-1.60.0/boost/intrusive/
H A Dsplaytree_algorithms.hpp293 splay_down(detail::uncast(header), key, comp); in lower_bound()
312 splay_down(detail::uncast(header), key, comp); in upper_bound()
331 splay_down(detail::uncast(header), key, comp); in find()
348 splay_down(detail::uncast(header), key, comp); in equal_range()
367 splay_down(detail::uncast(header), key, comp); in lower_bound_range()
387 splay_down(detail::uncast(header), lower_key, comp); in bounded_range()
408 splay_down(header, new_node, comp); in insert_equal_upper_bound()
418 splay_down(header, new_node, comp); in insert_equal_lower_bound()
428 splay_down(header, new_node, comp); in insert_equal()
465 splay_down(header, key, comp); in insert_unique_check()
[all …]
/dports/devel/boost-docs/boost_1_72_0/boost/intrusive/
H A Dsplaytree_algorithms.hpp275 splay_down(header1, z, comp); in transfer_equal()
320 splay_down(detail::uncast(header), key, comp); in lower_bound()
339 splay_down(detail::uncast(header), key, comp); in upper_bound()
358 splay_down(detail::uncast(header), key, comp); in find()
375 splay_down(detail::uncast(header), key, comp); in equal_range()
394 splay_down(detail::uncast(header), key, comp); in lower_bound_range()
435 splay_down(header, new_node, comp); in insert_equal_upper_bound()
445 splay_down(header, new_node, comp); in insert_equal_lower_bound()
455 splay_down(header, new_node, comp); in insert_equal()
492 splay_down(header, key, comp); in insert_unique_check()
[all …]
/dports/devel/hyperscan/boost_1_75_0/boost/intrusive/
H A Dsplaytree_algorithms.hpp275 splay_down(header1, z, comp); in transfer_equal()
320 splay_down(detail::uncast(header), key, comp); in lower_bound()
339 splay_down(detail::uncast(header), key, comp); in upper_bound()
358 splay_down(detail::uncast(header), key, comp); in find()
375 splay_down(detail::uncast(header), key, comp); in equal_range()
394 splay_down(detail::uncast(header), key, comp); in lower_bound_range()
435 splay_down(header, new_node, comp); in insert_equal_upper_bound()
445 splay_down(header, new_node, comp); in insert_equal_lower_bound()
455 splay_down(header, new_node, comp); in insert_equal()
492 splay_down(header, key, comp); in insert_unique_check()
[all …]
/dports/devel/R-cran-BH/BH/inst/include/boost/intrusive/
H A Dsplaytree_algorithms.hpp275 splay_down(header1, z, comp); in transfer_equal()
320 splay_down(detail::uncast(header), key, comp); in lower_bound()
339 splay_down(detail::uncast(header), key, comp); in upper_bound()
358 splay_down(detail::uncast(header), key, comp); in find()
375 splay_down(detail::uncast(header), key, comp); in equal_range()
394 splay_down(detail::uncast(header), key, comp); in lower_bound_range()
435 splay_down(header, new_node, comp); in insert_equal_upper_bound()
445 splay_down(header, new_node, comp); in insert_equal_lower_bound()
455 splay_down(header, new_node, comp); in insert_equal()
492 splay_down(header, key, comp); in insert_unique_check()
[all …]
/dports/science/py-scipy/scipy-1.7.1/scipy/_lib/boost/boost/intrusive/
H A Dsplaytree_algorithms.hpp275 splay_down(header1, z, comp); in transfer_equal()
320 splay_down(detail::uncast(header), key, comp); in lower_bound()
339 splay_down(detail::uncast(header), key, comp); in upper_bound()
358 splay_down(detail::uncast(header), key, comp); in find()
375 splay_down(detail::uncast(header), key, comp); in equal_range()
394 splay_down(detail::uncast(header), key, comp); in lower_bound_range()
435 splay_down(header, new_node, comp); in insert_equal_upper_bound()
445 splay_down(header, new_node, comp); in insert_equal_lower_bound()
455 splay_down(header, new_node, comp); in insert_equal()
492 splay_down(header, key, comp); in insert_unique_check()
[all …]
/dports/math/deal.ii/dealii-803d21ff957e349b3799cd3ef2c840bc78734305/bundled/boost-1.70.0/include/boost/intrusive/
H A Dsplaytree_algorithms.hpp275 splay_down(header1, z, comp); in transfer_equal()
320 splay_down(detail::uncast(header), key, comp); in lower_bound()
339 splay_down(detail::uncast(header), key, comp); in upper_bound()
358 splay_down(detail::uncast(header), key, comp); in find()
375 splay_down(detail::uncast(header), key, comp); in equal_range()
394 splay_down(detail::uncast(header), key, comp); in lower_bound_range()
435 splay_down(header, new_node, comp); in insert_equal_upper_bound()
445 splay_down(header, new_node, comp); in insert_equal_lower_bound()
455 splay_down(header, new_node, comp); in insert_equal()
492 splay_down(header, key, comp); in insert_unique_check()
[all …]
/dports/emulators/citra/citra-ac98458e0/externals/boost/boost/intrusive/
H A Dsplaytree_algorithms.hpp275 splay_down(header1, z, comp); in transfer_equal()
320 splay_down(detail::uncast(header), key, comp); in lower_bound()
339 splay_down(detail::uncast(header), key, comp); in upper_bound()
358 splay_down(detail::uncast(header), key, comp); in find()
375 splay_down(detail::uncast(header), key, comp); in equal_range()
394 splay_down(detail::uncast(header), key, comp); in lower_bound_range()
435 splay_down(header, new_node, comp); in insert_equal_upper_bound()
445 splay_down(header, new_node, comp); in insert_equal_lower_bound()
455 splay_down(header, new_node, comp); in insert_equal()
492 splay_down(header, key, comp); in insert_unique_check()
[all …]
/dports/emulators/citra-qt5/citra-ac98458e0/externals/boost/boost/intrusive/
H A Dsplaytree_algorithms.hpp275 splay_down(header1, z, comp); in transfer_equal()
320 splay_down(detail::uncast(header), key, comp); in lower_bound()
339 splay_down(detail::uncast(header), key, comp); in upper_bound()
358 splay_down(detail::uncast(header), key, comp); in find()
375 splay_down(detail::uncast(header), key, comp); in equal_range()
394 splay_down(detail::uncast(header), key, comp); in lower_bound_range()
435 splay_down(header, new_node, comp); in insert_equal_upper_bound()
445 splay_down(header, new_node, comp); in insert_equal_lower_bound()
455 splay_down(header, new_node, comp); in insert_equal()
492 splay_down(header, key, comp); in insert_unique_check()
[all …]
/dports/security/keybase/client-v5.7.1/shared/ios/Pods/boost-for-react-native/boost/intrusive/
H A Dsplaytree_algorithms.hpp275 splay_down(header1, z, comp); in transfer_equal()
320 splay_down(detail::uncast(header), key, comp); in lower_bound()
339 splay_down(detail::uncast(header), key, comp); in upper_bound()
358 splay_down(detail::uncast(header), key, comp); in find()
375 splay_down(detail::uncast(header), key, comp); in equal_range()
394 splay_down(detail::uncast(header), key, comp); in lower_bound_range()
435 splay_down(header, new_node, comp); in insert_equal_upper_bound()
445 splay_down(header, new_node, comp); in insert_equal_lower_bound()
455 splay_down(header, new_node, comp); in insert_equal()
492 splay_down(header, key, comp); in insert_unique_check()
[all …]
/dports/devel/boost-libs/boost_1_72_0/boost/intrusive/
H A Dsplaytree_algorithms.hpp275 splay_down(header1, z, comp); in transfer_equal()
320 splay_down(detail::uncast(header), key, comp); in lower_bound()
339 splay_down(detail::uncast(header), key, comp); in upper_bound()
358 splay_down(detail::uncast(header), key, comp); in find()
375 splay_down(detail::uncast(header), key, comp); in equal_range()
394 splay_down(detail::uncast(header), key, comp); in lower_bound_range()
435 splay_down(header, new_node, comp); in insert_equal_upper_bound()
445 splay_down(header, new_node, comp); in insert_equal_lower_bound()
455 splay_down(header, new_node, comp); in insert_equal()
492 splay_down(header, key, comp); in insert_unique_check()
[all …]
/dports/devel/boost-python-libs/boost_1_72_0/boost/intrusive/
H A Dsplaytree_algorithms.hpp275 splay_down(header1, z, comp); in transfer_equal()
320 splay_down(detail::uncast(header), key, comp); in lower_bound()
339 splay_down(detail::uncast(header), key, comp); in upper_bound()
358 splay_down(detail::uncast(header), key, comp); in find()
375 splay_down(detail::uncast(header), key, comp); in equal_range()
394 splay_down(detail::uncast(header), key, comp); in lower_bound_range()
435 splay_down(header, new_node, comp); in insert_equal_upper_bound()
445 splay_down(header, new_node, comp); in insert_equal_lower_bound()
455 splay_down(header, new_node, comp); in insert_equal()
492 splay_down(header, key, comp); in insert_unique_check()
[all …]
/dports/math/stanmath/math-4.2.0/lib/boost_1.75.0/boost/intrusive/
H A Dsplaytree_algorithms.hpp275 splay_down(header1, z, comp); in transfer_equal()
320 splay_down(detail::uncast(header), key, comp); in lower_bound()
339 splay_down(detail::uncast(header), key, comp); in upper_bound()
358 splay_down(detail::uncast(header), key, comp); in find()
375 splay_down(detail::uncast(header), key, comp); in equal_range()
394 splay_down(detail::uncast(header), key, comp); in lower_bound_range()
435 splay_down(header, new_node, comp); in insert_equal_upper_bound()
445 splay_down(header, new_node, comp); in insert_equal_lower_bound()
455 splay_down(header, new_node, comp); in insert_equal()
492 splay_down(header, key, comp); in insert_unique_check()
[all …]
/dports/math/py-pystan/pystan-2.19.0.0/pystan/stan/lib/stan_math/lib/boost_1.69.0/boost/intrusive/
H A Dsplaytree_algorithms.hpp275 splay_down(header1, z, comp);
320 splay_down(detail::uncast(header), key, comp);
339 splay_down(detail::uncast(header), key, comp);
358 splay_down(detail::uncast(header), key, comp);
375 splay_down(detail::uncast(header), key, comp);
394 splay_down(detail::uncast(header), key, comp);
435 splay_down(header, new_node, comp);
445 splay_down(header, new_node, comp);
455 splay_down(header, new_node, comp);
492 splay_down(header, key, comp);
[all …]
/dports/audio/supercollider/SuperCollider-3.11.0-Source/external_libraries/boost/boost/intrusive/
H A Dsplaytree_algorithms.hpp275 splay_down(header1, z, comp); in transfer_equal()
320 splay_down(detail::uncast(header), key, comp); in lower_bound()
339 splay_down(detail::uncast(header), key, comp); in upper_bound()
358 splay_down(detail::uncast(header), key, comp); in find()
375 splay_down(detail::uncast(header), key, comp); in equal_range()
394 splay_down(detail::uncast(header), key, comp); in lower_bound_range()
435 splay_down(header, new_node, comp); in insert_equal_upper_bound()
445 splay_down(header, new_node, comp); in insert_equal_lower_bound()
455 splay_down(header, new_node, comp); in insert_equal()
492 splay_down(header, key, comp); in insert_unique_check()
[all …]
/dports/graphics/povray37/povray-3.7.0.10/libraries/boost/boost/intrusive/
H A Dsplaytree_algorithms.hpp275 splay_down(header1, z, comp); in transfer_equal()
320 splay_down(detail::uncast(header), key, comp); in lower_bound()
339 splay_down(detail::uncast(header), key, comp); in upper_bound()
358 splay_down(detail::uncast(header), key, comp); in find()
375 splay_down(detail::uncast(header), key, comp); in equal_range()
394 splay_down(detail::uncast(header), key, comp); in lower_bound_range()
435 splay_down(header, new_node, comp); in insert_equal_upper_bound()
445 splay_down(header, new_node, comp); in insert_equal_lower_bound()
455 splay_down(header, new_node, comp); in insert_equal()
492 splay_down(header, key, comp); in insert_unique_check()
[all …]
/dports/games/frogatto/frogatto-1.3.1/MacOSJet/boost/include/boost/intrusive/
H A Dsplaytree_algorithms.hpp411 splay_down(header, key, comp); in insert_unique_check()
420 splay_down(header, key, comp); in insert_unique_check()
443 splay_down(uncast(header), key, comp); in find()
542 splay_down(header, new_node, comp); in insert_equal()
623 splay_down(header, new_node, comp); in insert_equal_upper_bound()
643 splay_down(header, new_node, comp); in insert_equal_lower_bound()
756 static node_ptr splay_down(node_ptr header, const KeyType &key, KeyNodePtrCompare comp) in splay_down() function in boost::intrusive::splaytree_algorithms
H A Dsplay_set.hpp1049 iterator splay_down(const KeyType &key, KeyNodePtrCompare comp) in splay_down() function in boost::intrusive::splay_set_impl
1050 { return tree_.splay_down(key, comp); } in splay_down()
1061 iterator splay_down(const value_type &value) in splay_down() function in boost::intrusive::splay_set_impl
1062 { return tree_.splay_down(value); } in splay_down()
2170 iterator splay_down(const KeyType &key, KeyNodePtrCompare comp) in splay_down() function in boost::intrusive::splay_multiset_impl
2171 { return tree_.splay_down(key, comp); } in splay_down()
2182 iterator splay_down(const value_type &value) in splay_down() function in boost::intrusive::splay_multiset_impl
2183 { return tree_.splay_down(value); } in splay_down()

123