| /dports/databases/percona57-pam-for-mysql/boost_1_59_0/boost/intrusive/ |
| H A D | sgtree_algorithms.hpp | 145 tree_size < alpha_by_maxsize(max_tree_size)){ in erase()
147 max_tree_size = tree_size; in erase()
198 ,std::size_t tree_size, H_Alpha h_alpha, std::size_t &max_tree_size) in insert_equal_upper_bound() argument
210 ,std::size_t tree_size, H_Alpha h_alpha, std::size_t &max_tree_size) in insert_equal_lower_bound() argument
222 ,std::size_t tree_size, H_Alpha h_alpha, std::size_t &max_tree_size) in insert_equal() argument
234 ,std::size_t tree_size, H_Alpha h_alpha, std::size_t &max_tree_size) in insert_before() argument
293 ,std::size_t tree_size, H_Alpha h_alpha, std::size_t &max_tree_size) in insert_unique_commit() argument
316 , std::size_t tree_size, H_Alpha h_alpha, std::size_t &max_tree_size) in rebalance_after_insertion() argument
318 if(tree_size > max_tree_size) in rebalance_after_insertion()
319 max_tree_size = tree_size; in rebalance_after_insertion()
[all …]
|
| H A D | sgtree.hpp | 83 std::size_t operator()(std::size_t max_tree_size) const in operator ()()
86 return max_tree_size > max_tree_size_limit ? max_tree_size/4*3 : max_tree_size*3/4; in operator ()()
127 float operator()(std::size_t max_tree_size) const in operator ()()
128 { return float(max_tree_size)*alpha_; } in operator ()()
437 this->max_tree_size_ = (size_type)max_tree_size; in insert_equal()
452 this->max_tree_size_ = (size_type)max_tree_size; in insert_equal()
521 this->max_tree_size_ = (size_type)max_tree_size; in insert_unique_commit()
551 this->max_tree_size_ = (size_type)max_tree_size; in insert_before()
566 this->max_tree_size_ = (size_type)max_tree_size; in push_back()
580 this->max_tree_size_ = (size_type)max_tree_size; in push_front()
[all …]
|
| /dports/databases/xtrabackup/boost_1_59_0/boost/intrusive/ |
| H A D | sgtree_algorithms.hpp | 145 tree_size < alpha_by_maxsize(max_tree_size)){ in erase()
147 max_tree_size = tree_size; in erase()
198 ,std::size_t tree_size, H_Alpha h_alpha, std::size_t &max_tree_size) in insert_equal_upper_bound() argument
210 ,std::size_t tree_size, H_Alpha h_alpha, std::size_t &max_tree_size) in insert_equal_lower_bound() argument
222 ,std::size_t tree_size, H_Alpha h_alpha, std::size_t &max_tree_size) in insert_equal() argument
234 ,std::size_t tree_size, H_Alpha h_alpha, std::size_t &max_tree_size) in insert_before() argument
293 ,std::size_t tree_size, H_Alpha h_alpha, std::size_t &max_tree_size) in insert_unique_commit() argument
316 , std::size_t tree_size, H_Alpha h_alpha, std::size_t &max_tree_size) in rebalance_after_insertion() argument
318 if(tree_size > max_tree_size) in rebalance_after_insertion()
319 max_tree_size = tree_size; in rebalance_after_insertion()
[all …]
|
| H A D | sgtree.hpp | 83 std::size_t operator()(std::size_t max_tree_size) const in operator ()()
86 return max_tree_size > max_tree_size_limit ? max_tree_size/4*3 : max_tree_size*3/4; in operator ()()
127 float operator()(std::size_t max_tree_size) const in operator ()()
128 { return float(max_tree_size)*alpha_; } in operator ()()
437 this->max_tree_size_ = (size_type)max_tree_size; in insert_equal()
452 this->max_tree_size_ = (size_type)max_tree_size; in insert_equal()
521 this->max_tree_size_ = (size_type)max_tree_size; in insert_unique_commit()
551 this->max_tree_size_ = (size_type)max_tree_size; in insert_before()
566 this->max_tree_size_ = (size_type)max_tree_size; in push_back()
580 this->max_tree_size_ = (size_type)max_tree_size; in push_front()
[all …]
|
| /dports/databases/percona57-server/boost_1_59_0/boost/intrusive/ |
| H A D | sgtree_algorithms.hpp | 145 tree_size < alpha_by_maxsize(max_tree_size)){ in erase()
147 max_tree_size = tree_size; in erase()
198 ,std::size_t tree_size, H_Alpha h_alpha, std::size_t &max_tree_size) in insert_equal_upper_bound() argument
210 ,std::size_t tree_size, H_Alpha h_alpha, std::size_t &max_tree_size) in insert_equal_lower_bound() argument
222 ,std::size_t tree_size, H_Alpha h_alpha, std::size_t &max_tree_size) in insert_equal() argument
234 ,std::size_t tree_size, H_Alpha h_alpha, std::size_t &max_tree_size) in insert_before() argument
293 ,std::size_t tree_size, H_Alpha h_alpha, std::size_t &max_tree_size) in insert_unique_commit() argument
316 , std::size_t tree_size, H_Alpha h_alpha, std::size_t &max_tree_size) in rebalance_after_insertion() argument
318 if(tree_size > max_tree_size) in rebalance_after_insertion()
319 max_tree_size = tree_size; in rebalance_after_insertion()
[all …]
|
| H A D | sgtree.hpp | 83 std::size_t operator()(std::size_t max_tree_size) const in operator ()()
86 return max_tree_size > max_tree_size_limit ? max_tree_size/4*3 : max_tree_size*3/4; in operator ()()
127 float operator()(std::size_t max_tree_size) const in operator ()()
128 { return float(max_tree_size)*alpha_; } in operator ()()
437 this->max_tree_size_ = (size_type)max_tree_size; in insert_equal()
452 this->max_tree_size_ = (size_type)max_tree_size; in insert_equal()
521 this->max_tree_size_ = (size_type)max_tree_size; in insert_unique_commit()
551 this->max_tree_size_ = (size_type)max_tree_size; in insert_before()
566 this->max_tree_size_ = (size_type)max_tree_size; in push_back()
580 this->max_tree_size_ = (size_type)max_tree_size; in push_front()
[all …]
|
| /dports/databases/percona57-client/boost_1_59_0/boost/intrusive/ |
| H A D | sgtree_algorithms.hpp | 145 tree_size < alpha_by_maxsize(max_tree_size)){ in erase()
147 max_tree_size = tree_size; in erase()
198 ,std::size_t tree_size, H_Alpha h_alpha, std::size_t &max_tree_size) in insert_equal_upper_bound() argument
210 ,std::size_t tree_size, H_Alpha h_alpha, std::size_t &max_tree_size) in insert_equal_lower_bound() argument
222 ,std::size_t tree_size, H_Alpha h_alpha, std::size_t &max_tree_size) in insert_equal() argument
234 ,std::size_t tree_size, H_Alpha h_alpha, std::size_t &max_tree_size) in insert_before() argument
293 ,std::size_t tree_size, H_Alpha h_alpha, std::size_t &max_tree_size) in insert_unique_commit() argument
316 , std::size_t tree_size, H_Alpha h_alpha, std::size_t &max_tree_size) in rebalance_after_insertion() argument
318 if(tree_size > max_tree_size) in rebalance_after_insertion()
319 max_tree_size = tree_size; in rebalance_after_insertion()
[all …]
|
| /dports/databases/mysqlwsrep57-server/boost_1_59_0/boost/intrusive/ |
| H A D | sgtree_algorithms.hpp | 145 tree_size < alpha_by_maxsize(max_tree_size)){ in erase()
147 max_tree_size = tree_size; in erase()
198 ,std::size_t tree_size, H_Alpha h_alpha, std::size_t &max_tree_size) in insert_equal_upper_bound() argument
210 ,std::size_t tree_size, H_Alpha h_alpha, std::size_t &max_tree_size) in insert_equal_lower_bound() argument
222 ,std::size_t tree_size, H_Alpha h_alpha, std::size_t &max_tree_size) in insert_equal() argument
234 ,std::size_t tree_size, H_Alpha h_alpha, std::size_t &max_tree_size) in insert_before() argument
293 ,std::size_t tree_size, H_Alpha h_alpha, std::size_t &max_tree_size) in insert_unique_commit() argument
316 , std::size_t tree_size, H_Alpha h_alpha, std::size_t &max_tree_size) in rebalance_after_insertion() argument
318 if(tree_size > max_tree_size) in rebalance_after_insertion()
319 max_tree_size = tree_size; in rebalance_after_insertion()
[all …]
|
| /dports/databases/mysql57-client/mysql-5.7.36/boost/boost_1_59_0/boost/intrusive/ |
| H A D | sgtree_algorithms.hpp | 145 tree_size < alpha_by_maxsize(max_tree_size)){ in erase()
147 max_tree_size = tree_size; in erase()
198 ,std::size_t tree_size, H_Alpha h_alpha, std::size_t &max_tree_size) in insert_equal_upper_bound() argument
210 ,std::size_t tree_size, H_Alpha h_alpha, std::size_t &max_tree_size) in insert_equal_lower_bound() argument
222 ,std::size_t tree_size, H_Alpha h_alpha, std::size_t &max_tree_size) in insert_equal() argument
234 ,std::size_t tree_size, H_Alpha h_alpha, std::size_t &max_tree_size) in insert_before() argument
293 ,std::size_t tree_size, H_Alpha h_alpha, std::size_t &max_tree_size) in insert_unique_commit() argument
316 , std::size_t tree_size, H_Alpha h_alpha, std::size_t &max_tree_size) in rebalance_after_insertion() argument
318 if(tree_size > max_tree_size) in rebalance_after_insertion()
319 max_tree_size = tree_size; in rebalance_after_insertion()
[all …]
|
| /dports/databases/mongodb36/mongodb-src-r3.6.23/src/third_party/boost-1.60.0/boost/intrusive/ |
| H A D | sgtree_algorithms.hpp | 145 tree_size < alpha_by_maxsize(max_tree_size)){ in erase()
147 max_tree_size = tree_size; in erase()
198 ,std::size_t tree_size, H_Alpha h_alpha, std::size_t &max_tree_size) in insert_equal_upper_bound() argument
210 ,std::size_t tree_size, H_Alpha h_alpha, std::size_t &max_tree_size) in insert_equal_lower_bound() argument
222 ,std::size_t tree_size, H_Alpha h_alpha, std::size_t &max_tree_size) in insert_equal() argument
234 ,std::size_t tree_size, H_Alpha h_alpha, std::size_t &max_tree_size) in insert_before() argument
293 ,std::size_t tree_size, H_Alpha h_alpha, std::size_t &max_tree_size) in insert_unique_commit() argument
316 , std::size_t tree_size, H_Alpha h_alpha, std::size_t &max_tree_size) in rebalance_after_insertion() argument
318 if(tree_size > max_tree_size) in rebalance_after_insertion()
319 max_tree_size = tree_size; in rebalance_after_insertion()
[all …]
|
| /dports/devel/boost-docs/boost_1_72_0/boost/intrusive/ |
| H A D | sgtree_algorithms.hpp | 144 tree_size < alpha_by_maxsize(max_tree_size)){ in erase()
146 max_tree_size = tree_size; in erase()
197 ,std::size_t tree_size, H_Alpha h_alpha, std::size_t &max_tree_size) in insert_equal_upper_bound() argument
209 ,std::size_t tree_size, H_Alpha h_alpha, std::size_t &max_tree_size) in insert_equal_lower_bound() argument
221 ,std::size_t tree_size, H_Alpha h_alpha, std::size_t &max_tree_size) in insert_equal() argument
233 ,std::size_t tree_size, H_Alpha h_alpha, std::size_t &max_tree_size) in insert_before() argument
292 ,std::size_t tree_size, H_Alpha h_alpha, std::size_t &max_tree_size) in insert_unique_commit() argument
351 ,std::size_t tree_size, H_Alpha h_alpha, std::size_t &max_tree_size) in insert_commit() argument
362 if(tree_size > max_tree_size) in rebalance_after_insertion()
363 max_tree_size = tree_size; in rebalance_after_insertion()
[all …]
|
| /dports/devel/hyperscan/boost_1_75_0/boost/intrusive/ |
| H A D | sgtree_algorithms.hpp | 144 tree_size < alpha_by_maxsize(max_tree_size)){ in erase()
146 max_tree_size = tree_size; in erase()
197 ,std::size_t tree_size, H_Alpha h_alpha, std::size_t &max_tree_size) in insert_equal_upper_bound() argument
209 ,std::size_t tree_size, H_Alpha h_alpha, std::size_t &max_tree_size) in insert_equal_lower_bound() argument
221 ,std::size_t tree_size, H_Alpha h_alpha, std::size_t &max_tree_size) in insert_equal() argument
233 ,std::size_t tree_size, H_Alpha h_alpha, std::size_t &max_tree_size) in insert_before() argument
292 ,std::size_t tree_size, H_Alpha h_alpha, std::size_t &max_tree_size) in insert_unique_commit() argument
351 ,std::size_t tree_size, H_Alpha h_alpha, std::size_t &max_tree_size) in insert_commit() argument
362 if(tree_size > max_tree_size) in rebalance_after_insertion()
363 max_tree_size = tree_size; in rebalance_after_insertion()
[all …]
|
| /dports/devel/R-cran-BH/BH/inst/include/boost/intrusive/ |
| H A D | sgtree_algorithms.hpp | 144 tree_size < static_cast<std::size_t>(alpha_by_maxsize(max_tree_size))){ in erase()
146 max_tree_size = tree_size; in erase()
197 ,std::size_t tree_size, H_Alpha h_alpha, std::size_t &max_tree_size) in insert_equal_upper_bound() argument
201 rebalance_after_insertion(new_node, depth, tree_size+1, h_alpha, max_tree_size); in insert_equal_upper_bound()
209 ,std::size_t tree_size, H_Alpha h_alpha, std::size_t &max_tree_size) in insert_equal_lower_bound() argument
221 ,std::size_t tree_size, H_Alpha h_alpha, std::size_t &max_tree_size) in insert_equal() argument
233 ,std::size_t tree_size, H_Alpha h_alpha, std::size_t &max_tree_size) in insert_before() argument
292 ,std::size_t tree_size, H_Alpha h_alpha, std::size_t &max_tree_size) in insert_unique_commit() argument
362 if(tree_size > max_tree_size) in rebalance_after_insertion()
363 max_tree_size = tree_size; in rebalance_after_insertion()
[all …]
|
| /dports/science/py-scipy/scipy-1.7.1/scipy/_lib/boost/boost/intrusive/ |
| H A D | sgtree_algorithms.hpp | 144 tree_size < alpha_by_maxsize(max_tree_size)){ in erase()
146 max_tree_size = tree_size; in erase()
197 ,std::size_t tree_size, H_Alpha h_alpha, std::size_t &max_tree_size) in insert_equal_upper_bound() argument
209 ,std::size_t tree_size, H_Alpha h_alpha, std::size_t &max_tree_size) in insert_equal_lower_bound() argument
221 ,std::size_t tree_size, H_Alpha h_alpha, std::size_t &max_tree_size) in insert_equal() argument
233 ,std::size_t tree_size, H_Alpha h_alpha, std::size_t &max_tree_size) in insert_before() argument
292 ,std::size_t tree_size, H_Alpha h_alpha, std::size_t &max_tree_size) in insert_unique_commit() argument
351 ,std::size_t tree_size, H_Alpha h_alpha, std::size_t &max_tree_size) in insert_commit() argument
362 if(tree_size > max_tree_size) in rebalance_after_insertion()
363 max_tree_size = tree_size; in rebalance_after_insertion()
[all …]
|
| /dports/math/deal.ii/dealii-803d21ff957e349b3799cd3ef2c840bc78734305/bundled/boost-1.70.0/include/boost/intrusive/ |
| H A D | sgtree_algorithms.hpp | 144 tree_size < alpha_by_maxsize(max_tree_size)){ in erase()
146 max_tree_size = tree_size; in erase()
197 ,std::size_t tree_size, H_Alpha h_alpha, std::size_t &max_tree_size) in insert_equal_upper_bound() argument
209 ,std::size_t tree_size, H_Alpha h_alpha, std::size_t &max_tree_size) in insert_equal_lower_bound() argument
221 ,std::size_t tree_size, H_Alpha h_alpha, std::size_t &max_tree_size) in insert_equal() argument
233 ,std::size_t tree_size, H_Alpha h_alpha, std::size_t &max_tree_size) in insert_before() argument
292 ,std::size_t tree_size, H_Alpha h_alpha, std::size_t &max_tree_size) in insert_unique_commit() argument
351 ,std::size_t tree_size, H_Alpha h_alpha, std::size_t &max_tree_size) in insert_commit() argument
362 if(tree_size > max_tree_size) in rebalance_after_insertion()
363 max_tree_size = tree_size; in rebalance_after_insertion()
[all …]
|
| /dports/emulators/citra/citra-ac98458e0/externals/boost/boost/intrusive/ |
| H A D | sgtree_algorithms.hpp | 144 tree_size < alpha_by_maxsize(max_tree_size)){ in erase()
146 max_tree_size = tree_size; in erase()
197 ,std::size_t tree_size, H_Alpha h_alpha, std::size_t &max_tree_size) in insert_equal_upper_bound() argument
209 ,std::size_t tree_size, H_Alpha h_alpha, std::size_t &max_tree_size) in insert_equal_lower_bound() argument
221 ,std::size_t tree_size, H_Alpha h_alpha, std::size_t &max_tree_size) in insert_equal() argument
233 ,std::size_t tree_size, H_Alpha h_alpha, std::size_t &max_tree_size) in insert_before() argument
292 ,std::size_t tree_size, H_Alpha h_alpha, std::size_t &max_tree_size) in insert_unique_commit() argument
351 ,std::size_t tree_size, H_Alpha h_alpha, std::size_t &max_tree_size) in insert_commit() argument
362 if(tree_size > max_tree_size) in rebalance_after_insertion()
363 max_tree_size = tree_size; in rebalance_after_insertion()
[all …]
|
| /dports/emulators/citra-qt5/citra-ac98458e0/externals/boost/boost/intrusive/ |
| H A D | sgtree_algorithms.hpp | 144 tree_size < alpha_by_maxsize(max_tree_size)){ in erase()
146 max_tree_size = tree_size; in erase()
197 ,std::size_t tree_size, H_Alpha h_alpha, std::size_t &max_tree_size) in insert_equal_upper_bound() argument
209 ,std::size_t tree_size, H_Alpha h_alpha, std::size_t &max_tree_size) in insert_equal_lower_bound() argument
221 ,std::size_t tree_size, H_Alpha h_alpha, std::size_t &max_tree_size) in insert_equal() argument
233 ,std::size_t tree_size, H_Alpha h_alpha, std::size_t &max_tree_size) in insert_before() argument
292 ,std::size_t tree_size, H_Alpha h_alpha, std::size_t &max_tree_size) in insert_unique_commit() argument
351 ,std::size_t tree_size, H_Alpha h_alpha, std::size_t &max_tree_size) in insert_commit() argument
362 if(tree_size > max_tree_size) in rebalance_after_insertion()
363 max_tree_size = tree_size; in rebalance_after_insertion()
[all …]
|
| /dports/security/keybase/client-v5.7.1/shared/ios/Pods/boost-for-react-native/boost/intrusive/ |
| H A D | sgtree_algorithms.hpp | 144 tree_size < alpha_by_maxsize(max_tree_size)){ in erase()
146 max_tree_size = tree_size; in erase()
197 ,std::size_t tree_size, H_Alpha h_alpha, std::size_t &max_tree_size) in insert_equal_upper_bound() argument
209 ,std::size_t tree_size, H_Alpha h_alpha, std::size_t &max_tree_size) in insert_equal_lower_bound() argument
221 ,std::size_t tree_size, H_Alpha h_alpha, std::size_t &max_tree_size) in insert_equal() argument
233 ,std::size_t tree_size, H_Alpha h_alpha, std::size_t &max_tree_size) in insert_before() argument
292 ,std::size_t tree_size, H_Alpha h_alpha, std::size_t &max_tree_size) in insert_unique_commit() argument
351 ,std::size_t tree_size, H_Alpha h_alpha, std::size_t &max_tree_size) in insert_commit() argument
362 if(tree_size > max_tree_size) in rebalance_after_insertion()
363 max_tree_size = tree_size; in rebalance_after_insertion()
[all …]
|
| /dports/devel/boost-libs/boost_1_72_0/boost/intrusive/ |
| H A D | sgtree_algorithms.hpp | 144 tree_size < alpha_by_maxsize(max_tree_size)){ in erase()
146 max_tree_size = tree_size; in erase()
197 ,std::size_t tree_size, H_Alpha h_alpha, std::size_t &max_tree_size) in insert_equal_upper_bound() argument
209 ,std::size_t tree_size, H_Alpha h_alpha, std::size_t &max_tree_size) in insert_equal_lower_bound() argument
221 ,std::size_t tree_size, H_Alpha h_alpha, std::size_t &max_tree_size) in insert_equal() argument
233 ,std::size_t tree_size, H_Alpha h_alpha, std::size_t &max_tree_size) in insert_before() argument
292 ,std::size_t tree_size, H_Alpha h_alpha, std::size_t &max_tree_size) in insert_unique_commit() argument
351 ,std::size_t tree_size, H_Alpha h_alpha, std::size_t &max_tree_size) in insert_commit() argument
362 if(tree_size > max_tree_size) in rebalance_after_insertion()
363 max_tree_size = tree_size; in rebalance_after_insertion()
[all …]
|
| /dports/devel/boost-python-libs/boost_1_72_0/boost/intrusive/ |
| H A D | sgtree_algorithms.hpp | 144 tree_size < alpha_by_maxsize(max_tree_size)){ in erase()
146 max_tree_size = tree_size; in erase()
197 ,std::size_t tree_size, H_Alpha h_alpha, std::size_t &max_tree_size) in insert_equal_upper_bound() argument
209 ,std::size_t tree_size, H_Alpha h_alpha, std::size_t &max_tree_size) in insert_equal_lower_bound() argument
221 ,std::size_t tree_size, H_Alpha h_alpha, std::size_t &max_tree_size) in insert_equal() argument
233 ,std::size_t tree_size, H_Alpha h_alpha, std::size_t &max_tree_size) in insert_before() argument
292 ,std::size_t tree_size, H_Alpha h_alpha, std::size_t &max_tree_size) in insert_unique_commit() argument
351 ,std::size_t tree_size, H_Alpha h_alpha, std::size_t &max_tree_size) in insert_commit() argument
362 if(tree_size > max_tree_size) in rebalance_after_insertion()
363 max_tree_size = tree_size; in rebalance_after_insertion()
[all …]
|
| /dports/math/stanmath/math-4.2.0/lib/boost_1.75.0/boost/intrusive/ |
| H A D | sgtree_algorithms.hpp | 144 tree_size < alpha_by_maxsize(max_tree_size)){ in erase()
146 max_tree_size = tree_size; in erase()
197 ,std::size_t tree_size, H_Alpha h_alpha, std::size_t &max_tree_size) in insert_equal_upper_bound() argument
209 ,std::size_t tree_size, H_Alpha h_alpha, std::size_t &max_tree_size) in insert_equal_lower_bound() argument
221 ,std::size_t tree_size, H_Alpha h_alpha, std::size_t &max_tree_size) in insert_equal() argument
233 ,std::size_t tree_size, H_Alpha h_alpha, std::size_t &max_tree_size) in insert_before() argument
292 ,std::size_t tree_size, H_Alpha h_alpha, std::size_t &max_tree_size) in insert_unique_commit() argument
351 ,std::size_t tree_size, H_Alpha h_alpha, std::size_t &max_tree_size) in insert_commit() argument
362 if(tree_size > max_tree_size) in rebalance_after_insertion()
363 max_tree_size = tree_size; in rebalance_after_insertion()
[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 | sgtree_algorithms.hpp | 144 tree_size < alpha_by_maxsize(max_tree_size)){ in erase()
146 max_tree_size = tree_size; in erase()
197 ,std::size_t tree_size, H_Alpha h_alpha, std::size_t &max_tree_size) in insert_equal_upper_bound() argument
209 ,std::size_t tree_size, H_Alpha h_alpha, std::size_t &max_tree_size) in insert_equal_lower_bound() argument
221 ,std::size_t tree_size, H_Alpha h_alpha, std::size_t &max_tree_size) in insert_equal() argument
233 ,std::size_t tree_size, H_Alpha h_alpha, std::size_t &max_tree_size) in insert_before() argument
292 ,std::size_t tree_size, H_Alpha h_alpha, std::size_t &max_tree_size) in insert_unique_commit() argument
351 ,std::size_t tree_size, H_Alpha h_alpha, std::size_t &max_tree_size) in insert_commit() argument
362 if(tree_size > max_tree_size) in rebalance_after_insertion()
363 max_tree_size = tree_size; in rebalance_after_insertion()
[all …]
|
| /dports/audio/supercollider/SuperCollider-3.11.0-Source/external_libraries/boost/boost/intrusive/ |
| H A D | sgtree_algorithms.hpp | 144 tree_size < alpha_by_maxsize(max_tree_size)){ in erase()
146 max_tree_size = tree_size; in erase()
197 ,std::size_t tree_size, H_Alpha h_alpha, std::size_t &max_tree_size) in insert_equal_upper_bound() argument
209 ,std::size_t tree_size, H_Alpha h_alpha, std::size_t &max_tree_size) in insert_equal_lower_bound() argument
221 ,std::size_t tree_size, H_Alpha h_alpha, std::size_t &max_tree_size) in insert_equal() argument
233 ,std::size_t tree_size, H_Alpha h_alpha, std::size_t &max_tree_size) in insert_before() argument
292 ,std::size_t tree_size, H_Alpha h_alpha, std::size_t &max_tree_size) in insert_unique_commit() argument
351 ,std::size_t tree_size, H_Alpha h_alpha, std::size_t &max_tree_size) in insert_commit() argument
362 if(tree_size > max_tree_size) in rebalance_after_insertion()
363 max_tree_size = tree_size; in rebalance_after_insertion()
[all …]
|
| /dports/graphics/povray37/povray-3.7.0.10/libraries/boost/boost/intrusive/ |
| H A D | sgtree_algorithms.hpp | 144 tree_size < alpha_by_maxsize(max_tree_size)){ in erase()
146 max_tree_size = tree_size; in erase()
197 ,std::size_t tree_size, H_Alpha h_alpha, std::size_t &max_tree_size) in insert_equal_upper_bound() argument
209 ,std::size_t tree_size, H_Alpha h_alpha, std::size_t &max_tree_size) in insert_equal_lower_bound() argument
221 ,std::size_t tree_size, H_Alpha h_alpha, std::size_t &max_tree_size) in insert_equal() argument
233 ,std::size_t tree_size, H_Alpha h_alpha, std::size_t &max_tree_size) in insert_before() argument
292 ,std::size_t tree_size, H_Alpha h_alpha, std::size_t &max_tree_size) in insert_unique_commit() argument
351 ,std::size_t tree_size, H_Alpha h_alpha, std::size_t &max_tree_size) in insert_commit() argument
362 if(tree_size > max_tree_size) in rebalance_after_insertion()
363 max_tree_size = tree_size; in rebalance_after_insertion()
[all …]
|
| /dports/games/frogatto/frogatto-1.3.1/MacOSJet/boost/include/boost/intrusive/ |
| H A D | sgtree_algorithms.hpp | 312 tree_size < alpha_by_maxsize(max_tree_size)){ in erase()
314 max_tree_size = tree_size; in erase()
440 ,std::size_t tree_size, H_Alpha h_alpha, std::size_t &max_tree_size) in insert_equal_upper_bound() argument
463 ,std::size_t tree_size, H_Alpha h_alpha, std::size_t &max_tree_size) in insert_equal_lower_bound() argument
488 ,std::size_t tree_size, H_Alpha h_alpha, std::size_t &max_tree_size) in insert_equal() argument
560 ,std::size_t tree_size, H_Alpha h_alpha, std::size_t &max_tree_size) in insert_before() argument
583 ,std::size_t tree_size, H_Alpha h_alpha, std::size_t &max_tree_size) in push_back() argument
684 ,std::size_t tree_size, H_Alpha h_alpha, std::size_t &max_tree_size) in insert_unique_commit() argument
738 , std::size_t tree_size, H_Alpha h_alpha, std::size_t &max_tree_size) in rebalance_after_insertion() argument
740 if(tree_size > max_tree_size) in rebalance_after_insertion()
[all …]
|