| /dports/databases/percona57-pam-for-mysql/boost_1_59_0/boost/intrusive/ |
| H A D | hashtable.hpp | 301 (group_traits::get_next(nxt) == prev_node)){ in get_bucket_before_begin()
348 { return group_traits::get_next(first_in_group); } in get_last_in_group()
381 group_traits::set_next(first, group_traits::get_next(new_first_in_group)); in split_group()
382 group_traits::set_next(new_first_in_group, last); in split_group()
689 group_traits::set_next(group1, end2); in priv_erase_from_single_bucket()
690 group_traits::set_next(group2, end1); in priv_erase_from_single_bucket()
732 if(nn != ne && group_traits::get_next(nn) == n){ in priv_erase_node()
736 else if(nn != ne && group_traits::get_next(nn) == n){ in priv_erase_node()
738 bn = group_traits::get_next(n); in priv_erase_node()
743 bn = group_traits::get_next(n); in priv_erase_node()
[all …]
|
| H A D | unordered_set_hook.hpp | 123 typedef unordered_group_adapter<NodeTraits> group_traits; typedef
124 typedef circular_slist_algorithms<group_traits> group_algorithms;
|
| /dports/databases/xtrabackup/boost_1_59_0/boost/intrusive/ |
| H A D | hashtable.hpp | 301 (group_traits::get_next(nxt) == prev_node)){ in get_bucket_before_begin()
348 { return group_traits::get_next(first_in_group); } in get_last_in_group()
381 group_traits::set_next(first, group_traits::get_next(new_first_in_group)); in split_group()
382 group_traits::set_next(new_first_in_group, last); in split_group()
689 group_traits::set_next(group1, end2); in priv_erase_from_single_bucket()
690 group_traits::set_next(group2, end1); in priv_erase_from_single_bucket()
732 if(nn != ne && group_traits::get_next(nn) == n){ in priv_erase_node()
736 else if(nn != ne && group_traits::get_next(nn) == n){ in priv_erase_node()
738 bn = group_traits::get_next(n); in priv_erase_node()
743 bn = group_traits::get_next(n); in priv_erase_node()
[all …]
|
| H A D | unordered_set_hook.hpp | 123 typedef unordered_group_adapter<NodeTraits> group_traits; typedef
124 typedef circular_slist_algorithms<group_traits> group_algorithms;
|
| /dports/databases/percona57-server/boost_1_59_0/boost/intrusive/ |
| H A D | hashtable.hpp | 301 (group_traits::get_next(nxt) == prev_node)){ in get_bucket_before_begin()
348 { return group_traits::get_next(first_in_group); } in get_last_in_group()
381 group_traits::set_next(first, group_traits::get_next(new_first_in_group)); in split_group()
382 group_traits::set_next(new_first_in_group, last); in split_group()
689 group_traits::set_next(group1, end2); in priv_erase_from_single_bucket()
690 group_traits::set_next(group2, end1); in priv_erase_from_single_bucket()
732 if(nn != ne && group_traits::get_next(nn) == n){ in priv_erase_node()
736 else if(nn != ne && group_traits::get_next(nn) == n){ in priv_erase_node()
738 bn = group_traits::get_next(n); in priv_erase_node()
743 bn = group_traits::get_next(n); in priv_erase_node()
[all …]
|
| H A D | unordered_set_hook.hpp | 123 typedef unordered_group_adapter<NodeTraits> group_traits; typedef
124 typedef circular_slist_algorithms<group_traits> group_algorithms;
|
| /dports/databases/percona57-client/boost_1_59_0/boost/intrusive/ |
| H A D | hashtable.hpp | 301 (group_traits::get_next(nxt) == prev_node)){ in get_bucket_before_begin()
348 { return group_traits::get_next(first_in_group); } in get_last_in_group()
381 group_traits::set_next(first, group_traits::get_next(new_first_in_group)); in split_group()
382 group_traits::set_next(new_first_in_group, last); in split_group()
689 group_traits::set_next(group1, end2); in priv_erase_from_single_bucket()
690 group_traits::set_next(group2, end1); in priv_erase_from_single_bucket()
732 if(nn != ne && group_traits::get_next(nn) == n){ in priv_erase_node()
736 else if(nn != ne && group_traits::get_next(nn) == n){ in priv_erase_node()
738 bn = group_traits::get_next(n); in priv_erase_node()
743 bn = group_traits::get_next(n); in priv_erase_node()
[all …]
|
| H A D | unordered_set_hook.hpp | 123 typedef unordered_group_adapter<NodeTraits> group_traits; typedef
124 typedef circular_slist_algorithms<group_traits> group_algorithms;
|
| /dports/security/keybase/client-v5.7.1/shared/ios/Pods/boost-for-react-native/boost/intrusive/ |
| H A D | hashtable.hpp | 305 (group_traits::get_next(nxt) == prev_node)){ in get_bucket_before_begin()
352 { return group_traits::get_next(first_in_group); } in get_last_in_group()
385 group_traits::set_next(first, group_traits::get_next(new_first_in_group)); in split_group()
386 group_traits::set_next(new_first_in_group, last); in split_group()
694 group_traits::set_next(group1, end2); in priv_erase_from_single_bucket()
695 group_traits::set_next(group2, end1); in priv_erase_from_single_bucket()
737 if(nn != ne && group_traits::get_next(nn) == n){ in priv_erase_node()
741 else if(nn != ne && group_traits::get_next(nn) == n){ in priv_erase_node()
743 bn = group_traits::get_next(n); in priv_erase_node()
748 bn = group_traits::get_next(n); in priv_erase_node()
[all …]
|
| /dports/databases/mysqlwsrep57-server/boost_1_59_0/boost/intrusive/ |
| H A D | hashtable.hpp | 301 (group_traits::get_next(nxt) == prev_node)){ in get_bucket_before_begin()
348 { return group_traits::get_next(first_in_group); } in get_last_in_group()
381 group_traits::set_next(first, group_traits::get_next(new_first_in_group)); in split_group()
382 group_traits::set_next(new_first_in_group, last); in split_group()
689 group_traits::set_next(group1, end2); in priv_erase_from_single_bucket()
690 group_traits::set_next(group2, end1); in priv_erase_from_single_bucket()
732 if(nn != ne && group_traits::get_next(nn) == n){ in priv_erase_node()
736 else if(nn != ne && group_traits::get_next(nn) == n){ in priv_erase_node()
738 bn = group_traits::get_next(n); in priv_erase_node()
743 bn = group_traits::get_next(n); in priv_erase_node()
[all …]
|
| /dports/audio/supercollider/SuperCollider-3.11.0-Source/external_libraries/boost/boost/intrusive/ |
| H A D | hashtable.hpp | 323 (group_traits::get_next(nxt) == prev_node)){ in get_bucket_before_begin()
370 { return group_traits::get_next(first_in_group); } in get_last_in_group()
403 group_traits::set_next(first, group_traits::get_next(new_first_in_group)); in split_group()
404 group_traits::set_next(new_first_in_group, last); in split_group()
711 group_traits::set_next(group1, end2); in priv_erase_from_single_bucket()
712 group_traits::set_next(group2, end1); in priv_erase_from_single_bucket()
754 if(nn != ne && group_traits::get_next(nn) == n){ in priv_erase_node()
758 else if(nn != ne && group_traits::get_next(nn) == n){ in priv_erase_node()
760 bn = group_traits::get_next(n); in priv_erase_node()
765 bn = group_traits::get_next(n); in priv_erase_node()
[all …]
|
| /dports/databases/mysql57-client/mysql-5.7.36/boost/boost_1_59_0/boost/intrusive/ |
| H A D | hashtable.hpp | 301 (group_traits::get_next(nxt) == prev_node)){ in get_bucket_before_begin()
348 { return group_traits::get_next(first_in_group); } in get_last_in_group()
381 group_traits::set_next(first, group_traits::get_next(new_first_in_group)); in split_group()
382 group_traits::set_next(new_first_in_group, last); in split_group()
689 group_traits::set_next(group1, end2); in priv_erase_from_single_bucket()
690 group_traits::set_next(group2, end1); in priv_erase_from_single_bucket()
732 if(nn != ne && group_traits::get_next(nn) == n){ in priv_erase_node()
736 else if(nn != ne && group_traits::get_next(nn) == n){ in priv_erase_node()
738 bn = group_traits::get_next(n); in priv_erase_node()
743 bn = group_traits::get_next(n); in priv_erase_node()
[all …]
|
| /dports/graphics/povray37/povray-3.7.0.10/libraries/boost/boost/intrusive/ |
| H A D | hashtable.hpp | 305 (group_traits::get_next(nxt) == prev_node)){ in get_bucket_before_begin()
352 { return group_traits::get_next(first_in_group); } in get_last_in_group()
385 group_traits::set_next(first, group_traits::get_next(new_first_in_group)); in split_group()
386 group_traits::set_next(new_first_in_group, last); in split_group()
694 group_traits::set_next(group1, end2); in priv_erase_from_single_bucket()
695 group_traits::set_next(group2, end1); in priv_erase_from_single_bucket()
737 if(nn != ne && group_traits::get_next(nn) == n){ in priv_erase_node()
741 else if(nn != ne && group_traits::get_next(nn) == n){ in priv_erase_node()
743 bn = group_traits::get_next(n); in priv_erase_node()
748 bn = group_traits::get_next(n); in priv_erase_node()
[all …]
|
| /dports/databases/mongodb36/mongodb-src-r3.6.23/src/third_party/boost-1.60.0/boost/intrusive/ |
| H A D | hashtable.hpp | 301 (group_traits::get_next(nxt) == prev_node)){ in get_bucket_before_begin()
348 { return group_traits::get_next(first_in_group); } in get_last_in_group()
381 group_traits::set_next(first, group_traits::get_next(new_first_in_group)); in split_group()
382 group_traits::set_next(new_first_in_group, last); in split_group()
689 group_traits::set_next(group1, end2); in priv_erase_from_single_bucket()
690 group_traits::set_next(group2, end1); in priv_erase_from_single_bucket()
732 if(nn != ne && group_traits::get_next(nn) == n){ in priv_erase_node()
736 else if(nn != ne && group_traits::get_next(nn) == n){ in priv_erase_node()
738 bn = group_traits::get_next(n); in priv_erase_node()
743 bn = group_traits::get_next(n); in priv_erase_node()
[all …]
|
| /dports/devel/boost-docs/boost_1_72_0/boost/intrusive/ |
| H A D | hashtable.hpp | 386 (group_traits::get_next(nxt) == prev_node)){ in get_bucket_before_begin()
433 { return group_traits::get_next(first_in_group); } in get_last_in_group()
466 group_traits::set_next(first, group_traits::get_next(new_first_in_group)); in split_group()
467 group_traits::set_next(new_first_in_group, last); in split_group()
774 group_traits::set_next(group1, end2); in priv_erase_from_single_bucket()
775 group_traits::set_next(group2, end1); in priv_erase_from_single_bucket()
817 if(nn != ne && group_traits::get_next(nn) == n){ in priv_erase_node()
821 else if(nn != ne && group_traits::get_next(nn) == n){ in priv_erase_node()
823 bn = group_traits::get_next(n); in priv_erase_node()
828 bn = group_traits::get_next(n); in priv_erase_node()
[all …]
|
| /dports/devel/hyperscan/boost_1_75_0/boost/intrusive/ |
| H A D | hashtable.hpp | 386 (group_traits::get_next(nxt) == prev_node)){ in get_bucket_before_begin()
433 { return group_traits::get_next(first_in_group); } in get_last_in_group()
466 group_traits::set_next(first, group_traits::get_next(new_first_in_group)); in split_group()
467 group_traits::set_next(new_first_in_group, last); in split_group()
774 group_traits::set_next(group1, end2); in priv_erase_from_single_bucket()
775 group_traits::set_next(group2, end1); in priv_erase_from_single_bucket()
817 if(nn != ne && group_traits::get_next(nn) == n){ in priv_erase_node()
821 else if(nn != ne && group_traits::get_next(nn) == n){ in priv_erase_node()
823 bn = group_traits::get_next(n); in priv_erase_node()
828 bn = group_traits::get_next(n); in priv_erase_node()
[all …]
|
| /dports/devel/R-cran-BH/BH/inst/include/boost/intrusive/ |
| H A D | hashtable.hpp | 386 (group_traits::get_next(nxt) == prev_node)){ in get_bucket_before_begin()
433 { return group_traits::get_next(first_in_group); } in get_last_in_group()
466 group_traits::set_next(first, group_traits::get_next(new_first_in_group)); in split_group()
467 group_traits::set_next(new_first_in_group, last); in split_group()
783 group_traits::set_next(group1, end2); in priv_erase_from_single_bucket()
784 group_traits::set_next(group2, end1); in priv_erase_from_single_bucket()
826 if(nn != ne && group_traits::get_next(nn) == n){ in priv_erase_node()
830 else if(nn != ne && group_traits::get_next(nn) == n){ in priv_erase_node()
832 bn = group_traits::get_next(n); in priv_erase_node()
837 bn = group_traits::get_next(n); in priv_erase_node()
[all …]
|
| /dports/math/deal.ii/dealii-803d21ff957e349b3799cd3ef2c840bc78734305/bundled/boost-1.70.0/include/boost/intrusive/ |
| H A D | hashtable.hpp | 386 (group_traits::get_next(nxt) == prev_node)){ in get_bucket_before_begin()
433 { return group_traits::get_next(first_in_group); } in get_last_in_group()
466 group_traits::set_next(first, group_traits::get_next(new_first_in_group)); in split_group()
467 group_traits::set_next(new_first_in_group, last); in split_group()
774 group_traits::set_next(group1, end2); in priv_erase_from_single_bucket()
775 group_traits::set_next(group2, end1); in priv_erase_from_single_bucket()
817 if(nn != ne && group_traits::get_next(nn) == n){ in priv_erase_node()
821 else if(nn != ne && group_traits::get_next(nn) == n){ in priv_erase_node()
823 bn = group_traits::get_next(n); in priv_erase_node()
828 bn = group_traits::get_next(n); in priv_erase_node()
[all …]
|
| /dports/devel/boost-libs/boost_1_72_0/boost/intrusive/ |
| H A D | hashtable.hpp | 386 (group_traits::get_next(nxt) == prev_node)){ in get_bucket_before_begin()
433 { return group_traits::get_next(first_in_group); } in get_last_in_group()
466 group_traits::set_next(first, group_traits::get_next(new_first_in_group)); in split_group()
467 group_traits::set_next(new_first_in_group, last); in split_group()
774 group_traits::set_next(group1, end2); in priv_erase_from_single_bucket()
775 group_traits::set_next(group2, end1); in priv_erase_from_single_bucket()
817 if(nn != ne && group_traits::get_next(nn) == n){ in priv_erase_node()
821 else if(nn != ne && group_traits::get_next(nn) == n){ in priv_erase_node()
823 bn = group_traits::get_next(n); in priv_erase_node()
828 bn = group_traits::get_next(n); in priv_erase_node()
[all …]
|
| /dports/devel/boost-python-libs/boost_1_72_0/boost/intrusive/ |
| H A D | hashtable.hpp | 386 (group_traits::get_next(nxt) == prev_node)){ in get_bucket_before_begin()
433 { return group_traits::get_next(first_in_group); } in get_last_in_group()
466 group_traits::set_next(first, group_traits::get_next(new_first_in_group)); in split_group()
467 group_traits::set_next(new_first_in_group, last); in split_group()
774 group_traits::set_next(group1, end2); in priv_erase_from_single_bucket()
775 group_traits::set_next(group2, end1); in priv_erase_from_single_bucket()
817 if(nn != ne && group_traits::get_next(nn) == n){ in priv_erase_node()
821 else if(nn != ne && group_traits::get_next(nn) == n){ in priv_erase_node()
823 bn = group_traits::get_next(n); in priv_erase_node()
828 bn = group_traits::get_next(n); in priv_erase_node()
[all …]
|
| /dports/math/stanmath/math-4.2.0/lib/boost_1.75.0/boost/intrusive/ |
| H A D | hashtable.hpp | 386 (group_traits::get_next(nxt) == prev_node)){ in get_bucket_before_begin()
433 { return group_traits::get_next(first_in_group); } in get_last_in_group()
466 group_traits::set_next(first, group_traits::get_next(new_first_in_group)); in split_group()
467 group_traits::set_next(new_first_in_group, last); in split_group()
774 group_traits::set_next(group1, end2); in priv_erase_from_single_bucket()
775 group_traits::set_next(group2, end1); in priv_erase_from_single_bucket()
817 if(nn != ne && group_traits::get_next(nn) == n){ in priv_erase_node()
821 else if(nn != ne && group_traits::get_next(nn) == n){ in priv_erase_node()
823 bn = group_traits::get_next(n); in priv_erase_node()
828 bn = group_traits::get_next(n); in priv_erase_node()
[all …]
|
| /dports/science/py-scipy/scipy-1.7.1/scipy/_lib/boost/boost/intrusive/ |
| H A D | hashtable.hpp | 386 (group_traits::get_next(nxt) == prev_node)){ in get_bucket_before_begin()
433 { return group_traits::get_next(first_in_group); } in get_last_in_group()
466 group_traits::set_next(first, group_traits::get_next(new_first_in_group)); in split_group()
467 group_traits::set_next(new_first_in_group, last); in split_group()
774 group_traits::set_next(group1, end2); in priv_erase_from_single_bucket()
775 group_traits::set_next(group2, end1); in priv_erase_from_single_bucket()
817 if(nn != ne && group_traits::get_next(nn) == n){ in priv_erase_node()
821 else if(nn != ne && group_traits::get_next(nn) == n){ in priv_erase_node()
823 bn = group_traits::get_next(n); in priv_erase_node()
828 bn = group_traits::get_next(n); in priv_erase_node()
[all …]
|
| /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 | 386 (group_traits::get_next(nxt) == prev_node)){ in get_bucket_before_begin()
433 { return group_traits::get_next(first_in_group); } in get_last_in_group()
466 group_traits::set_next(first, group_traits::get_next(new_first_in_group)); in split_group()
467 group_traits::set_next(new_first_in_group, last); in split_group()
774 group_traits::set_next(group1, end2); in priv_erase_from_single_bucket()
775 group_traits::set_next(group2, end1); in priv_erase_from_single_bucket()
817 if(nn != ne && group_traits::get_next(nn) == n){ in priv_erase_node()
821 else if(nn != ne && group_traits::get_next(nn) == n){ in priv_erase_node()
823 bn = group_traits::get_next(n); in priv_erase_node()
828 bn = group_traits::get_next(n); in priv_erase_node()
[all …]
|
| /dports/games/frogatto/frogatto-1.3.1/MacOSJet/boost/include/boost/intrusive/ |
| H A D | hashtable.hpp | 345 (group_traits::get_next(nxt) == prev_node)){ in priv_get_bucket_before_begin()
375 prev_node = group_traits::get_next(nxt); in priv_get_prev_to_first_in_group()
385 node_ptr possible_first = group_traits::get_next(last_in_group); in priv_get_first_in_group_of_last_in_group()
392 possible_first_prev = group_traits::get_next(possible_first); in priv_get_first_in_group_of_last_in_group()
401 node_ptr prev_in_group_ptr(group_traits::get_next(to_erase_ptr)); in priv_erase_from_group()
403 (group_traits::get_next(nxt_ptr) != to_erase_ptr); in priv_erase_from_group()
426 { return group_traits::get_next(first_in_group); } in priv_get_last_in_group()
2443 node_ptr prev_in_group(group_traits::get_next(elem)); in priv_get_previous()
2447 : *group_traits::get_next(elem) in priv_get_previous()
2489 node_ptr prev_in_group(group_traits::get_next(elem)); in priv_get_previous_and_next_in_group()
[all …]
|
| H A D | unordered_set_hook.hpp | 122 typedef unordered_group_adapter<NodeTraits> group_traits; typedef
123 typedef circular_slist_algorithms<group_traits> group_algorithms;
|