| /dports/games/frogatto/frogatto-1.3.1/MacOSJet/boost/include/boost/intrusive/ |
| H A D | hashtable.hpp | 1220 this->priv_insert_in_group(node_ptr(0), n, optimize_multikey_t()); in insert_unique_commit()
1304 priv_erase(i, disposer, optimize_multikey_t()); in erase_and_dispose()
1400 (dcast_bucket_ptr(it.pointed_node()), optimize_multikey_t()))); in erase_and_dispose()
2043 (dcast_bucket_ptr(i.pointed_node()), optimize_multikey_t())); in incremental_rehash()
2297 priv_init_group(nxt.pointed_node(), optimize_multikey_t()); in priv_erase_range_impl()
2377 { return priv_get_bucket_num_no_hash_store(it, optimize_multikey_t()); } in priv_get_bucket_num_hash_dispatch()
2437 { return priv_get_previous(b, i, optimize_multikey_t()); } in priv_get_previous()
2457 { return priv_get_last(b, optimize_multikey_t()); } in priv_get_last()
2701 priv_clear_group_nodes(*buckets_ptr, optimize_multikey_t()); in priv_clear_buckets()
2786 this->priv_insert_in_group(first_in_group, n, optimize_multikey_t()); in priv_insert_equal_find()
[all …]
|
| /dports/databases/percona57-pam-for-mysql/boost_1_59_0/boost/intrusive/ |
| H A D | hashtable.hpp | 1673 typedef detail::bool_<optimize_multikey> optimize_multikey_t; typedef in boost::intrusive::hashtable_impl
2165 group_functions_t::insert_in_group(n, n, optimize_multikey_t()); in insert_unique_commit()
2250 …_pointer()[first_bucket_num], first_local_it, make_node_disposer(disposer), optimize_multikey_t()); in BOOST_INTRUSIVE_DOC1ST()
2293 , make_node_disposer(disposer), optimize_multikey_t()); in erase_and_dispose()
2347 …ucket_num], prev, ++(priv_last_in_group)(it), make_node_disposer(disposer), optimize_multikey_t()); in erase_and_dispose()
2894 … , bucket_plus_vtraits_t::priv_get_last(old_bucket, optimize_multikey_t())); in rehash()
3207 , n, optimize_multikey_t()); in priv_insert_equal_after_find()
3236 … (detail::dcast_bucket_ptr<node>(it_first_in_group.pointed_node()), optimize_multikey_t())); in priv_last_in_group()
3342 { return this->priv_get_bucket_num_no_hash_store(it, optimize_multikey_t()); } in priv_get_bucket_num_hash_dispatch()
3345 { return bucket_plus_vtraits_t::priv_get_previous(b, i, optimize_multikey_t()); } in priv_get_previous()
|
| /dports/databases/xtrabackup/boost_1_59_0/boost/intrusive/ |
| H A D | hashtable.hpp | 1673 typedef detail::bool_<optimize_multikey> optimize_multikey_t; typedef in boost::intrusive::hashtable_impl
2165 group_functions_t::insert_in_group(n, n, optimize_multikey_t()); in insert_unique_commit()
2250 …_pointer()[first_bucket_num], first_local_it, make_node_disposer(disposer), optimize_multikey_t()); in BOOST_INTRUSIVE_DOC1ST()
2293 , make_node_disposer(disposer), optimize_multikey_t()); in erase_and_dispose()
2347 …ucket_num], prev, ++(priv_last_in_group)(it), make_node_disposer(disposer), optimize_multikey_t()); in erase_and_dispose()
2894 … , bucket_plus_vtraits_t::priv_get_last(old_bucket, optimize_multikey_t())); in rehash()
3207 , n, optimize_multikey_t()); in priv_insert_equal_after_find()
3236 … (detail::dcast_bucket_ptr<node>(it_first_in_group.pointed_node()), optimize_multikey_t())); in priv_last_in_group()
3342 { return this->priv_get_bucket_num_no_hash_store(it, optimize_multikey_t()); } in priv_get_bucket_num_hash_dispatch()
3345 { return bucket_plus_vtraits_t::priv_get_previous(b, i, optimize_multikey_t()); } in priv_get_previous()
|
| /dports/databases/percona57-server/boost_1_59_0/boost/intrusive/ |
| H A D | hashtable.hpp | 1673 typedef detail::bool_<optimize_multikey> optimize_multikey_t; typedef in boost::intrusive::hashtable_impl
2165 group_functions_t::insert_in_group(n, n, optimize_multikey_t()); in insert_unique_commit()
2250 …_pointer()[first_bucket_num], first_local_it, make_node_disposer(disposer), optimize_multikey_t()); in BOOST_INTRUSIVE_DOC1ST()
2293 , make_node_disposer(disposer), optimize_multikey_t()); in erase_and_dispose()
2347 …ucket_num], prev, ++(priv_last_in_group)(it), make_node_disposer(disposer), optimize_multikey_t()); in erase_and_dispose()
2894 … , bucket_plus_vtraits_t::priv_get_last(old_bucket, optimize_multikey_t())); in rehash()
3207 , n, optimize_multikey_t()); in priv_insert_equal_after_find()
3236 … (detail::dcast_bucket_ptr<node>(it_first_in_group.pointed_node()), optimize_multikey_t())); in priv_last_in_group()
3342 { return this->priv_get_bucket_num_no_hash_store(it, optimize_multikey_t()); } in priv_get_bucket_num_hash_dispatch()
3345 { return bucket_plus_vtraits_t::priv_get_previous(b, i, optimize_multikey_t()); } in priv_get_previous()
|
| /dports/databases/percona57-client/boost_1_59_0/boost/intrusive/ |
| H A D | hashtable.hpp | 1673 typedef detail::bool_<optimize_multikey> optimize_multikey_t; typedef in boost::intrusive::hashtable_impl
2165 group_functions_t::insert_in_group(n, n, optimize_multikey_t()); in insert_unique_commit()
2250 …_pointer()[first_bucket_num], first_local_it, make_node_disposer(disposer), optimize_multikey_t()); in BOOST_INTRUSIVE_DOC1ST()
2293 , make_node_disposer(disposer), optimize_multikey_t()); in erase_and_dispose()
2347 …ucket_num], prev, ++(priv_last_in_group)(it), make_node_disposer(disposer), optimize_multikey_t()); in erase_and_dispose()
2894 … , bucket_plus_vtraits_t::priv_get_last(old_bucket, optimize_multikey_t())); in rehash()
3207 , n, optimize_multikey_t()); in priv_insert_equal_after_find()
3236 … (detail::dcast_bucket_ptr<node>(it_first_in_group.pointed_node()), optimize_multikey_t())); in priv_last_in_group()
3342 { return this->priv_get_bucket_num_no_hash_store(it, optimize_multikey_t()); } in priv_get_bucket_num_hash_dispatch()
3345 { return bucket_plus_vtraits_t::priv_get_previous(b, i, optimize_multikey_t()); } in priv_get_previous()
|
| /dports/security/keybase/client-v5.7.1/shared/ios/Pods/boost-for-react-native/boost/intrusive/ |
| H A D | hashtable.hpp | 1677 typedef detail::bool_<optimize_multikey> optimize_multikey_t; typedef in boost::intrusive::hashtable_impl
2194 group_functions_t::insert_in_group(n, n, optimize_multikey_t()); in insert_unique_commit()
2279 …_pointer()[first_bucket_num], first_local_it, make_node_disposer(disposer), optimize_multikey_t()); in BOOST_INTRUSIVE_DOC1ST()
2322 , make_node_disposer(disposer), optimize_multikey_t()); in erase_and_dispose()
2376 …ucket_num], prev, ++(priv_last_in_group)(it), make_node_disposer(disposer), optimize_multikey_t()); in erase_and_dispose()
3158 … , bucket_plus_vtraits_t::priv_get_last(old_bucket, optimize_multikey_t())); in rehash_impl()
3291 , n, optimize_multikey_t()); in priv_insert_equal_after_find()
3320 … (detail::dcast_bucket_ptr<node>(it_first_in_group.pointed_node()), optimize_multikey_t())); in priv_last_in_group()
3426 { return this->priv_get_bucket_num_no_hash_store(it, optimize_multikey_t()); } in priv_get_bucket_num_hash_dispatch()
3429 { return bucket_plus_vtraits_t::priv_get_previous(b, i, optimize_multikey_t()); } in priv_get_previous()
|
| /dports/databases/mysqlwsrep57-server/boost_1_59_0/boost/intrusive/ |
| H A D | hashtable.hpp | 1673 typedef detail::bool_<optimize_multikey> optimize_multikey_t; typedef in boost::intrusive::hashtable_impl
2165 group_functions_t::insert_in_group(n, n, optimize_multikey_t()); in insert_unique_commit()
2250 …_pointer()[first_bucket_num], first_local_it, make_node_disposer(disposer), optimize_multikey_t()); in BOOST_INTRUSIVE_DOC1ST()
2293 , make_node_disposer(disposer), optimize_multikey_t()); in erase_and_dispose()
2347 …ucket_num], prev, ++(priv_last_in_group)(it), make_node_disposer(disposer), optimize_multikey_t()); in erase_and_dispose()
2894 … , bucket_plus_vtraits_t::priv_get_last(old_bucket, optimize_multikey_t())); in rehash()
3207 , n, optimize_multikey_t()); in priv_insert_equal_after_find()
3236 … (detail::dcast_bucket_ptr<node>(it_first_in_group.pointed_node()), optimize_multikey_t())); in priv_last_in_group()
3342 { return this->priv_get_bucket_num_no_hash_store(it, optimize_multikey_t()); } in priv_get_bucket_num_hash_dispatch()
3345 { return bucket_plus_vtraits_t::priv_get_previous(b, i, optimize_multikey_t()); } in priv_get_previous()
|
| /dports/audio/supercollider/SuperCollider-3.11.0-Source/external_libraries/boost/boost/intrusive/ |
| H A D | hashtable.hpp | 1692 typedef detail::bool_<optimize_multikey> optimize_multikey_t; typedef in boost::intrusive::hashtable_impl
2216 group_functions_t::insert_in_group(n, n, optimize_multikey_t()); in insert_unique_commit()
2301 …_pointer()[first_bucket_num], first_local_it, make_node_disposer(disposer), optimize_multikey_t()); in BOOST_INTRUSIVE_DOC1ST()
2344 , make_node_disposer(disposer), optimize_multikey_t()); in erase_and_dispose()
2398 …ucket_num], prev, ++(priv_last_in_group)(it), make_node_disposer(disposer), optimize_multikey_t()); in erase_and_dispose()
3180 … , bucket_plus_vtraits_t::priv_get_last(old_bucket, optimize_multikey_t())); in rehash_impl()
3313 , n, optimize_multikey_t()); in priv_insert_equal_after_find()
3342 … (detail::dcast_bucket_ptr<node>(it_first_in_group.pointed_node()), optimize_multikey_t())); in priv_last_in_group()
3448 { return this->priv_get_bucket_num_no_hash_store(it, optimize_multikey_t()); } in priv_get_bucket_num_hash_dispatch()
3451 { return bucket_plus_vtraits_t::priv_get_previous(b, i, optimize_multikey_t()); } in priv_get_previous()
|
| /dports/databases/mysql57-client/mysql-5.7.36/boost/boost_1_59_0/boost/intrusive/ |
| H A D | hashtable.hpp | 1673 typedef detail::bool_<optimize_multikey> optimize_multikey_t; typedef in boost::intrusive::hashtable_impl
2165 group_functions_t::insert_in_group(n, n, optimize_multikey_t()); in insert_unique_commit()
2250 …_pointer()[first_bucket_num], first_local_it, make_node_disposer(disposer), optimize_multikey_t()); in BOOST_INTRUSIVE_DOC1ST()
2293 , make_node_disposer(disposer), optimize_multikey_t()); in erase_and_dispose()
2347 …ucket_num], prev, ++(priv_last_in_group)(it), make_node_disposer(disposer), optimize_multikey_t()); in erase_and_dispose()
2894 … , bucket_plus_vtraits_t::priv_get_last(old_bucket, optimize_multikey_t())); in rehash()
3207 , n, optimize_multikey_t()); in priv_insert_equal_after_find()
3236 … (detail::dcast_bucket_ptr<node>(it_first_in_group.pointed_node()), optimize_multikey_t())); in priv_last_in_group()
3342 { return this->priv_get_bucket_num_no_hash_store(it, optimize_multikey_t()); } in priv_get_bucket_num_hash_dispatch()
3345 { return bucket_plus_vtraits_t::priv_get_previous(b, i, optimize_multikey_t()); } in priv_get_previous()
|
| /dports/graphics/povray37/povray-3.7.0.10/libraries/boost/boost/intrusive/ |
| H A D | hashtable.hpp | 1677 typedef detail::bool_<optimize_multikey> optimize_multikey_t; typedef in boost::intrusive::hashtable_impl
2194 group_functions_t::insert_in_group(n, n, optimize_multikey_t()); in insert_unique_commit()
2279 …_pointer()[first_bucket_num], first_local_it, make_node_disposer(disposer), optimize_multikey_t()); in BOOST_INTRUSIVE_DOC1ST()
2322 , make_node_disposer(disposer), optimize_multikey_t()); in erase_and_dispose()
2376 …ucket_num], prev, ++(priv_last_in_group)(it), make_node_disposer(disposer), optimize_multikey_t()); in erase_and_dispose()
3158 … , bucket_plus_vtraits_t::priv_get_last(old_bucket, optimize_multikey_t())); in rehash_impl()
3291 , n, optimize_multikey_t()); in priv_insert_equal_after_find()
3320 … (detail::dcast_bucket_ptr<node>(it_first_in_group.pointed_node()), optimize_multikey_t())); in priv_last_in_group()
3426 { return this->priv_get_bucket_num_no_hash_store(it, optimize_multikey_t()); } in priv_get_bucket_num_hash_dispatch()
3429 { return bucket_plus_vtraits_t::priv_get_previous(b, i, optimize_multikey_t()); } in priv_get_previous()
|
| /dports/databases/mongodb36/mongodb-src-r3.6.23/src/third_party/boost-1.60.0/boost/intrusive/ |
| H A D | hashtable.hpp | 1673 typedef detail::bool_<optimize_multikey> optimize_multikey_t; typedef in boost::intrusive::hashtable_impl
2165 group_functions_t::insert_in_group(n, n, optimize_multikey_t()); in insert_unique_commit()
2250 …_pointer()[first_bucket_num], first_local_it, make_node_disposer(disposer), optimize_multikey_t()); in BOOST_INTRUSIVE_DOC1ST()
2293 , make_node_disposer(disposer), optimize_multikey_t()); in erase_and_dispose()
2347 …ucket_num], prev, ++(priv_last_in_group)(it), make_node_disposer(disposer), optimize_multikey_t()); in erase_and_dispose()
2894 … , bucket_plus_vtraits_t::priv_get_last(old_bucket, optimize_multikey_t())); in rehash()
3207 , n, optimize_multikey_t()); in priv_insert_equal_after_find()
3236 … (detail::dcast_bucket_ptr<node>(it_first_in_group.pointed_node()), optimize_multikey_t())); in priv_last_in_group()
3342 { return this->priv_get_bucket_num_no_hash_store(it, optimize_multikey_t()); } in priv_get_bucket_num_hash_dispatch()
3345 { return bucket_plus_vtraits_t::priv_get_previous(b, i, optimize_multikey_t()); } in priv_get_previous()
|
| /dports/devel/boost-docs/boost_1_72_0/boost/intrusive/ |
| H A D | hashtable.hpp | 1752 typedef detail::bool_<optimize_multikey> optimize_multikey_t; typedef in boost::intrusive::hashtable_impl
2276 group_functions_t::insert_in_group(n, n, optimize_multikey_t()); in insert_unique_commit()
2361 …_pointer()[first_bucket_num], first_local_it, make_node_disposer(disposer), optimize_multikey_t()); in BOOST_INTRUSIVE_DOC1ST()
2404 , make_node_disposer(disposer), optimize_multikey_t()); in erase_and_dispose()
2458 …ucket_num], prev, ++(priv_last_in_group)(it), make_node_disposer(disposer), optimize_multikey_t()); in erase_and_dispose()
3240 … , bucket_plus_vtraits_t::priv_get_last(old_bucket, optimize_multikey_t())); in rehash_impl()
3373 , n, optimize_multikey_t()); in priv_insert_equal_after_find()
3402 … (detail::dcast_bucket_ptr<node>(it_first_in_group.pointed_node()), optimize_multikey_t())); in priv_last_in_group()
3509 { return this->priv_get_bucket_num_no_hash_store(it, optimize_multikey_t()); } in priv_get_bucket_num_hash_dispatch()
3512 { return bucket_plus_vtraits_t::priv_get_previous(b, i, optimize_multikey_t()); } in priv_get_previous()
|
| /dports/devel/hyperscan/boost_1_75_0/boost/intrusive/ |
| H A D | hashtable.hpp | 1752 typedef detail::bool_<optimize_multikey> optimize_multikey_t; typedef in boost::intrusive::hashtable_impl
2276 group_functions_t::insert_in_group(n, n, optimize_multikey_t()); in insert_unique_commit()
2361 …_pointer()[first_bucket_num], first_local_it, make_node_disposer(disposer), optimize_multikey_t()); in BOOST_INTRUSIVE_DOC1ST()
2404 , make_node_disposer(disposer), optimize_multikey_t()); in erase_and_dispose()
2458 …ucket_num], prev, ++(priv_last_in_group)(it), make_node_disposer(disposer), optimize_multikey_t()); in erase_and_dispose()
3240 … , bucket_plus_vtraits_t::priv_get_last(old_bucket, optimize_multikey_t())); in rehash_impl()
3373 , n, optimize_multikey_t()); in priv_insert_equal_after_find()
3402 … (detail::dcast_bucket_ptr<node>(it_first_in_group.pointed_node()), optimize_multikey_t())); in priv_last_in_group()
3509 { return this->priv_get_bucket_num_no_hash_store(it, optimize_multikey_t()); } in priv_get_bucket_num_hash_dispatch()
3512 { return bucket_plus_vtraits_t::priv_get_previous(b, i, optimize_multikey_t()); } in priv_get_previous()
|
| /dports/devel/R-cran-BH/BH/inst/include/boost/intrusive/ |
| H A D | hashtable.hpp | 1760 typedef detail::bool_<optimize_multikey> optimize_multikey_t; typedef in boost::intrusive::hashtable_impl
2285 group_functions_t::insert_in_group(n, n, optimize_multikey_t()); in insert_unique_commit()
2370 …riv_bucket(first_bucket_num), first_local_it, make_node_disposer(disposer), optimize_multikey_t()); in BOOST_INTRUSIVE_DOC1ST()
2412 , make_node_disposer(disposer), optimize_multikey_t()); in erase_and_dispose()
2466 …ucket_num), prev, ++(priv_last_in_group)(it), make_node_disposer(disposer), optimize_multikey_t()); in erase_and_dispose()
3253 … , bucket_plus_vtraits_t::priv_get_last(old_bucket, optimize_multikey_t())); in rehash_impl()
3384 , n, optimize_multikey_t()); in priv_insert_equal_after_find()
3413 … (detail::dcast_bucket_ptr<node>(it_first_in_group.pointed_node()), optimize_multikey_t())); in priv_last_in_group()
3519 { return (size_type)this->priv_get_bucket_num_no_hash_store(it, optimize_multikey_t()); } in priv_get_bucket_num_hash_dispatch()
3522 { return bucket_plus_vtraits_t::priv_get_previous(b, i, optimize_multikey_t()); } in priv_get_previous()
|
| /dports/math/deal.ii/dealii-803d21ff957e349b3799cd3ef2c840bc78734305/bundled/boost-1.70.0/include/boost/intrusive/ |
| H A D | hashtable.hpp | 1752 typedef detail::bool_<optimize_multikey> optimize_multikey_t; typedef in boost::intrusive::hashtable_impl
2276 group_functions_t::insert_in_group(n, n, optimize_multikey_t()); in insert_unique_commit()
2361 …_pointer()[first_bucket_num], first_local_it, make_node_disposer(disposer), optimize_multikey_t()); in BOOST_INTRUSIVE_DOC1ST()
2404 , make_node_disposer(disposer), optimize_multikey_t()); in erase_and_dispose()
2458 …ucket_num], prev, ++(priv_last_in_group)(it), make_node_disposer(disposer), optimize_multikey_t()); in erase_and_dispose()
3240 … , bucket_plus_vtraits_t::priv_get_last(old_bucket, optimize_multikey_t())); in rehash_impl()
3373 , n, optimize_multikey_t()); in priv_insert_equal_after_find()
3402 … (detail::dcast_bucket_ptr<node>(it_first_in_group.pointed_node()), optimize_multikey_t())); in priv_last_in_group()
3509 { return this->priv_get_bucket_num_no_hash_store(it, optimize_multikey_t()); } in priv_get_bucket_num_hash_dispatch()
3512 { return bucket_plus_vtraits_t::priv_get_previous(b, i, optimize_multikey_t()); } in priv_get_previous()
|
| /dports/devel/boost-libs/boost_1_72_0/boost/intrusive/ |
| H A D | hashtable.hpp | 1752 typedef detail::bool_<optimize_multikey> optimize_multikey_t; typedef in boost::intrusive::hashtable_impl
2276 group_functions_t::insert_in_group(n, n, optimize_multikey_t()); in insert_unique_commit()
2361 …_pointer()[first_bucket_num], first_local_it, make_node_disposer(disposer), optimize_multikey_t()); in BOOST_INTRUSIVE_DOC1ST()
2404 , make_node_disposer(disposer), optimize_multikey_t()); in erase_and_dispose()
2458 …ucket_num], prev, ++(priv_last_in_group)(it), make_node_disposer(disposer), optimize_multikey_t()); in erase_and_dispose()
3240 … , bucket_plus_vtraits_t::priv_get_last(old_bucket, optimize_multikey_t())); in rehash_impl()
3373 , n, optimize_multikey_t()); in priv_insert_equal_after_find()
3402 … (detail::dcast_bucket_ptr<node>(it_first_in_group.pointed_node()), optimize_multikey_t())); in priv_last_in_group()
3509 { return this->priv_get_bucket_num_no_hash_store(it, optimize_multikey_t()); } in priv_get_bucket_num_hash_dispatch()
3512 { return bucket_plus_vtraits_t::priv_get_previous(b, i, optimize_multikey_t()); } in priv_get_previous()
|
| /dports/devel/boost-python-libs/boost_1_72_0/boost/intrusive/ |
| H A D | hashtable.hpp | 1752 typedef detail::bool_<optimize_multikey> optimize_multikey_t; typedef in boost::intrusive::hashtable_impl
2276 group_functions_t::insert_in_group(n, n, optimize_multikey_t()); in insert_unique_commit()
2361 …_pointer()[first_bucket_num], first_local_it, make_node_disposer(disposer), optimize_multikey_t()); in BOOST_INTRUSIVE_DOC1ST()
2404 , make_node_disposer(disposer), optimize_multikey_t()); in erase_and_dispose()
2458 …ucket_num], prev, ++(priv_last_in_group)(it), make_node_disposer(disposer), optimize_multikey_t()); in erase_and_dispose()
3240 … , bucket_plus_vtraits_t::priv_get_last(old_bucket, optimize_multikey_t())); in rehash_impl()
3373 , n, optimize_multikey_t()); in priv_insert_equal_after_find()
3402 … (detail::dcast_bucket_ptr<node>(it_first_in_group.pointed_node()), optimize_multikey_t())); in priv_last_in_group()
3509 { return this->priv_get_bucket_num_no_hash_store(it, optimize_multikey_t()); } in priv_get_bucket_num_hash_dispatch()
3512 { return bucket_plus_vtraits_t::priv_get_previous(b, i, optimize_multikey_t()); } in priv_get_previous()
|
| /dports/math/stanmath/math-4.2.0/lib/boost_1.75.0/boost/intrusive/ |
| H A D | hashtable.hpp | 1752 typedef detail::bool_<optimize_multikey> optimize_multikey_t; typedef in boost::intrusive::hashtable_impl
2276 group_functions_t::insert_in_group(n, n, optimize_multikey_t()); in insert_unique_commit()
2361 …_pointer()[first_bucket_num], first_local_it, make_node_disposer(disposer), optimize_multikey_t()); in BOOST_INTRUSIVE_DOC1ST()
2404 , make_node_disposer(disposer), optimize_multikey_t()); in erase_and_dispose()
2458 …ucket_num], prev, ++(priv_last_in_group)(it), make_node_disposer(disposer), optimize_multikey_t()); in erase_and_dispose()
3240 … , bucket_plus_vtraits_t::priv_get_last(old_bucket, optimize_multikey_t())); in rehash_impl()
3373 , n, optimize_multikey_t()); in priv_insert_equal_after_find()
3402 … (detail::dcast_bucket_ptr<node>(it_first_in_group.pointed_node()), optimize_multikey_t())); in priv_last_in_group()
3509 { return this->priv_get_bucket_num_no_hash_store(it, optimize_multikey_t()); } in priv_get_bucket_num_hash_dispatch()
3512 { return bucket_plus_vtraits_t::priv_get_previous(b, i, optimize_multikey_t()); } in priv_get_previous()
|
| /dports/science/py-scipy/scipy-1.7.1/scipy/_lib/boost/boost/intrusive/ |
| H A D | hashtable.hpp | 1752 typedef detail::bool_<optimize_multikey> optimize_multikey_t; typedef in boost::intrusive::hashtable_impl
2276 group_functions_t::insert_in_group(n, n, optimize_multikey_t()); in insert_unique_commit()
2361 …_pointer()[first_bucket_num], first_local_it, make_node_disposer(disposer), optimize_multikey_t()); in BOOST_INTRUSIVE_DOC1ST()
2404 , make_node_disposer(disposer), optimize_multikey_t()); in erase_and_dispose()
2458 …ucket_num], prev, ++(priv_last_in_group)(it), make_node_disposer(disposer), optimize_multikey_t()); in erase_and_dispose()
3240 … , bucket_plus_vtraits_t::priv_get_last(old_bucket, optimize_multikey_t())); in rehash_impl()
3373 , n, optimize_multikey_t()); in priv_insert_equal_after_find()
3402 … (detail::dcast_bucket_ptr<node>(it_first_in_group.pointed_node()), optimize_multikey_t())); in priv_last_in_group()
3509 { return this->priv_get_bucket_num_no_hash_store(it, optimize_multikey_t()); } in priv_get_bucket_num_hash_dispatch()
3512 { return bucket_plus_vtraits_t::priv_get_previous(b, i, optimize_multikey_t()); } in priv_get_previous()
|
| /dports/math/py-pystan/pystan-2.19.0.0/pystan/stan/lib/stan_math/lib/boost_1.69.0/boost/intrusive/ |
| H A D | hashtable.hpp | 1752 typedef detail::bool_<optimize_multikey> optimize_multikey_t; typedef in boost::intrusive::hashtable_impl
2276 group_functions_t::insert_in_group(n, n, optimize_multikey_t()); in insert_unique_commit()
2361 …_pointer()[first_bucket_num], first_local_it, make_node_disposer(disposer), optimize_multikey_t()); in BOOST_INTRUSIVE_DOC1ST()
2404 , make_node_disposer(disposer), optimize_multikey_t()); in erase_and_dispose()
2458 …ucket_num], prev, ++(priv_last_in_group)(it), make_node_disposer(disposer), optimize_multikey_t()); in erase_and_dispose()
3240 … , bucket_plus_vtraits_t::priv_get_last(old_bucket, optimize_multikey_t())); in rehash_impl()
3373 , n, optimize_multikey_t()); in priv_insert_equal_after_find()
3402 … (detail::dcast_bucket_ptr<node>(it_first_in_group.pointed_node()), optimize_multikey_t())); in priv_last_in_group()
3509 { return this->priv_get_bucket_num_no_hash_store(it, optimize_multikey_t()); } in priv_get_bucket_num_hash_dispatch()
3512 { return bucket_plus_vtraits_t::priv_get_previous(b, i, optimize_multikey_t()); } in priv_get_previous()
|