| /aosp_15_r20/external/sdv/vsomeip/third_party/boost/intrusive/include/boost/intrusive/ |
| D | treap.hpp | 517 …std::pair<iterator, bool> ret = this->insert_unique_check(key_of_value()(value), priority_of_value… in insert_unique()
541 …std::pair<iterator, bool> ret = this->insert_unique_check(hint, key_of_value()(value), priority_of… in insert_unique()
601 std::pair<iterator, bool> insert_unique_check in insert_unique_check() function in boost::intrusive::treap_impl
603 …{ return this->insert_unique_check(key, this->key_comp(), prio, this->priv_pcomp(), commit_data);… in insert_unique_check()
633 std::pair<iterator, bool> insert_unique_check in insert_unique_check() function in boost::intrusive::treap_impl
635 …{ return this->insert_unique_check(hint, key, this->key_comp(), prio, this->priv_pcomp(), commit_… in insert_unique_check()
675 insert_unique_check in BOOST_INTRUSIVE_DOC1ST()
680 (node_algorithms::insert_unique_check in BOOST_INTRUSIVE_DOC1ST()
724 std::pair<iterator, bool> insert_unique_check in insert_unique_check() function in boost::intrusive::treap_impl
733 (node_algorithms::insert_unique_check in insert_unique_check()
|
| D | sgtree.hpp | 486 std::pair<iterator, bool> ret = this->insert_unique_check in insert_unique()
497 std::pair<iterator, bool> ret = this->insert_unique_check in insert_unique()
510 insert_unique_check in BOOST_INTRUSIVE_DOC1ST()
514 node_algorithms::insert_unique_check in BOOST_INTRUSIVE_DOC1ST()
521 std::pair<iterator, bool> insert_unique_check in insert_unique_check() function in boost::intrusive::sgtree_impl
526 node_algorithms::insert_unique_check in insert_unique_check()
532 std::pair<iterator, bool> insert_unique_check in insert_unique_check() function in boost::intrusive::sgtree_impl
534 { return this->insert_unique_check(key, this->key_comp(), commit_data); } in insert_unique_check()
537 std::pair<iterator, bool> insert_unique_check in insert_unique_check() function in boost::intrusive::sgtree_impl
539 { return this->insert_unique_check(hint, key, this->key_comp(), commit_data); } in insert_unique_check()
|
| D | bstree.hpp | 482 BOOST_INTRUSIVE_FORCEINLINE std::pair<iterator, bool> insert_unique_check in insert_unique_check() function
484 { return this->insert_unique_check(key, this->key_comp(), commit_data); } in insert_unique_check()
486 BOOST_INTRUSIVE_FORCEINLINE std::pair<iterator, bool> insert_unique_check in insert_unique_check() function
488 { return this->insert_unique_check(hint, key, this->key_comp(), commit_data); } in insert_unique_check()
495 insert_unique_check in BOOST_INTRUSIVE_DOC1ST()
499 (node_algorithms::insert_unique_check in BOOST_INTRUSIVE_DOC1ST()
505 std::pair<iterator, bool> insert_unique_check in insert_unique_check() function
509 (node_algorithms::insert_unique_check in insert_unique_check()
1134 (node_algorithms::insert_unique_check in insert_unique()
1160 (node_algorithms::insert_unique_check in insert_unique()
[all …]
|
| D | sgtree_algorithms.hpp | 263 static std::pair<node_ptr, bool> insert_unique_check in insert_unique_check() function in boost::intrusive::sgtree_algorithms
269 bstree_algo::insert_unique_check(header, key, comp, commit_data, &depth); in insert_unique_check()
276 static std::pair<node_ptr, bool> insert_unique_check in insert_unique_check() function in boost::intrusive::sgtree_algorithms
282 bstree_algo::insert_unique_check in insert_unique_check()
303 bool const transferable = insert_unique_check(header1, z, comp, commit_data).second; in transfer_unique()
|
| D | treap_algorithms.hpp | 483 static std::pair<node_ptr, bool> insert_unique_check in insert_unique_check() function in boost::intrusive::treap_algorithms
490 bstree_algo::insert_unique_check(header, key, comp, commit_data); in insert_unique_check()
536 static std::pair<node_ptr, bool> insert_unique_check in insert_unique_check() function in boost::intrusive::treap_algorithms
543 bstree_algo::insert_unique_check(header, hint, key, comp, commit_data); in insert_unique_check()
579 bool const transferable = insert_unique_check(header1, z, comp, z, pcomp, commit_data).second; in transfer_unique()
|
| D | splaytree_algorithms.hpp | 260 … bool const transferable = bstree_algo::insert_unique_check(header1, z, comp, commit_data).second; in transfer_unique()
488 static std::pair<node_ptr, bool> insert_unique_check in insert_unique_check() function in boost::intrusive::splaytree_algorithms
493 return bstree_algo::insert_unique_check(header, key, comp, commit_data); in insert_unique_check()
499 static std::pair<node_ptr, bool> insert_unique_check in insert_unique_check() function in boost::intrusive::splaytree_algorithms
504 return bstree_algo::insert_unique_check(header, hint, key, comp, commit_data); in insert_unique_check()
|
| D | rbtree.hpp | 266 std::pair<iterator, bool> insert_unique_check
271 std::pair<iterator, bool> insert_unique_check
276 std::pair<iterator, bool> insert_unique_check
280 std::pair<iterator, bool> insert_unique_check
|
| D | avltree.hpp | 263 std::pair<iterator, bool> insert_unique_check
268 std::pair<iterator, bool> insert_unique_check
273 std::pair<iterator, bool> insert_unique_check
277 std::pair<iterator, bool> insert_unique_check
|
| D | splaytree.hpp | 257 std::pair<iterator, bool> insert_unique_check
261 std::pair<iterator, bool> insert_unique_check
266 std::pair<iterator, bool> insert_unique_check
271 std::pair<iterator, bool> insert_unique_check
|
| D | bs_set.hpp | 217 { return tree_type::insert_unique_check(key, commit_data); } in insert_check()
223 { return tree_type::insert_unique_check(hint, key, commit_data); } in insert_check()
229 { return tree_type::insert_unique_check(key, comp, commit_data); } in insert_check()
236 { return tree_type::insert_unique_check(hint, key, comp, commit_data); } in insert_check()
|
| D | set.hpp | 220 { return tree_type::insert_unique_check(key, commit_data); } in insert_check()
226 { return tree_type::insert_unique_check(hint, key, commit_data); } in insert_check()
232 { return tree_type::insert_unique_check(key, comp, commit_data); } in insert_check()
239 { return tree_type::insert_unique_check(hint, key, comp, commit_data); } in insert_check()
|
| D | avl_set.hpp | 220 { return tree_type::insert_unique_check(key, commit_data); } in insert_check()
226 { return tree_type::insert_unique_check(hint, key, commit_data); } in insert_check()
232 { return tree_type::insert_unique_check(key, comp, commit_data); } in insert_check()
239 { return tree_type::insert_unique_check(hint, key, comp, commit_data); } in insert_check()
|
| D | splay_set.hpp | 218 { return tree_type::insert_unique_check(key, commit_data); } in insert_check()
224 { return tree_type::insert_unique_check(hint, key, commit_data); } in insert_check()
230 { return tree_type::insert_unique_check(key, comp, commit_data); } in insert_check()
237 { return tree_type::insert_unique_check(hint, key, comp, commit_data); } in insert_check()
|
| D | treap_set.hpp | 249 { return tree_type::insert_unique_check(key, prio, commit_data); } in insert_check()
254 { return tree_type::insert_unique_check(hint, key, prio, commit_data); } in insert_check()
261 { return tree_type::insert_unique_check(key, comp, prio, pcomp, commit_data); } in insert_check()
270 { return tree_type::insert_unique_check(hint, key, comp, prio, pcomp, commit_data); } in insert_check()
|
| D | sg_set.hpp | 218 { return tree_type::insert_unique_check(key, commit_data); } in insert_check()
224 { return tree_type::insert_unique_check(hint, key, commit_data); } in insert_check()
230 { return tree_type::insert_unique_check(key, comp, commit_data); } in insert_check()
237 { return tree_type::insert_unique_check(hint, key, comp, commit_data); } in insert_check()
|
| D | rbtree_algorithms.hpp | 418 static std::pair<node_ptr, bool> insert_unique_check
424 static std::pair<node_ptr, bool> insert_unique_check
|
| D | bstree_algorithms.hpp | 995 static std::pair<node_ptr, bool> insert_unique_check in insert_unique_check() function in boost::intrusive::bstree_algorithms
1073 static std::pair<node_ptr, bool> insert_unique_check in insert_unique_check() function in boost::intrusive::bstree_algorithms
1095 return insert_unique_check(header, key, comp, commit_data, pdepth); in insert_unique_check()
1481 bool const transferable = insert_unique_check(header1, z, comp, commit_data).second; in transfer_unique()
|
| D | avltree_algorithms.hpp | 403 static std::pair<node_ptr, bool> insert_unique_check
409 static std::pair<node_ptr, bool> insert_unique_check
|
| D | unordered_set.hpp | 213 { return table_type::insert_unique_check(key, commit_data); } in insert_check()
219 { return table_type::insert_unique_check(key, hasher, key_value_equal, commit_data); } in insert_check()
|
| D | hashtable.hpp | 2141 std::pair<iterator, bool> ret = this->insert_unique_check(key_of_value()(value), commit_data); in insert_unique()
2203 std::pair<iterator, bool> insert_unique_check in insert_unique_check() function in boost::intrusive::hashtable_impl
2244 BOOST_INTRUSIVE_FORCEINLINE std::pair<iterator, bool> insert_unique_check in insert_unique_check() function in boost::intrusive::hashtable_impl
2246 … { return this->insert_unique_check(key, this->priv_hasher(), this->priv_equal(), commit_data); } in insert_unique_check()
|
| /aosp_15_r20/external/sdv/vsomeip/third_party/boost/container/include/boost/container/detail/ |
| D | tree.hpp | 980 std::pair<iterator,bool> insert_unique_check in insert_unique_check() function in boost::container::dtl::tree
984 this->icont().insert_unique_check(key, KeyNodeCompare(key_comp()), data); in insert_unique_check()
988 std::pair<iterator,bool> insert_unique_check in insert_unique_check() function in boost::container::dtl::tree
993 this->icont().insert_unique_check(hint.get(), key, KeyNodeCompare(key_comp()), data); in insert_unique_check()
1013 this->insert_unique_check(key_of_value_t()(v), data); in insert_unique_convertible()
1026 this->insert_unique_check(hint, key_of_value_t()(v), data); in insert_unique_hint_convertible()
1069 this->insert_unique_check(key_of_value_t()(v), data); in emplace_unique_node()
1086 this->insert_unique_check(hint, key_of_value_t()(v), data); in emplace_hint_unique_node()
1135 …hint == const_iterator() ? this->icont().insert_unique_check( k, KeyNodeCompare(key_com… in try_emplace()
1136 … : this->icont().insert_unique_check(hint.get(), k, KeyNodeCompare(key_comp()), data); in try_emplace()
[all …]
|
| /aosp_15_r20/external/sdv/vsomeip/third_party/boost/intrusive/doc/ |
| D | intrusive.qbk | 2043 containers have insertion functions (`insert_check`, `insert_unique_check`,...) to check efficientl…
|