/dports/java/openjdk11/jdk11u-jdk-11.0.13-8-1/src/hotspot/share/utilities/ |
H A D | concurrentHashTable.hpp | 311 bool internal_insert(Thread* thread, LOOKUP_FUNC& lookup_f, VALUE_FUNC& value_f, 400 return !internal_insert(thread, lookup_f, val_f, callback_f, grow_hint); in get_insert_lazy() 441 return internal_insert(thread, lookup_f, vp, noOp, grow_hint); in insert()
|
/dports/java/openjdk11-jre/jdk11u-jdk-11.0.13-8-1/src/hotspot/share/utilities/ |
H A D | concurrentHashTable.hpp | 311 bool internal_insert(Thread* thread, LOOKUP_FUNC& lookup_f, VALUE_FUNC& value_f, 400 return !internal_insert(thread, lookup_f, val_f, callback_f, grow_hint); in get_insert_lazy() 441 return internal_insert(thread, lookup_f, vp, noOp, grow_hint); in insert()
|
/dports/java/openjdk13/jdk13u-jdk-13.0.10-1-1/src/hotspot/share/utilities/ |
H A D | concurrentHashTable.hpp | 318 bool internal_insert(Thread* thread, LOOKUP_FUNC& lookup_f, const VALUE& value, 414 return internal_insert(thread, lookup_f, value, grow_hint, clean_hint); in insert()
|
/dports/java/openjdk16/jdk16u-jdk-16.0.2-7-1/src/hotspot/share/utilities/ |
H A D | concurrentHashTable.hpp | 312 bool internal_insert(Thread* thread, LOOKUP_FUNC& lookup_f, const VALUE& value, 408 return internal_insert(thread, lookup_f, value, grow_hint, clean_hint); in insert()
|
H A D | concurrentHashTable.inline.hpp | 871 internal_insert(Thread* thread, LOOKUP_FUNC& lookup_f, const VALUE& value, in internal_insert() function in ConcurrentHashTable
|
/dports/java/openjdk15/jdk15u-jdk-15.0.6-1-1/src/hotspot/share/utilities/ |
H A D | concurrentHashTable.hpp | 319 bool internal_insert(Thread* thread, LOOKUP_FUNC& lookup_f, const VALUE& value, 415 return internal_insert(thread, lookup_f, value, grow_hint, clean_hint); in insert()
|
H A D | concurrentHashTable.inline.hpp | 871 internal_insert(Thread* thread, LOOKUP_FUNC& lookup_f, const VALUE& value, in internal_insert() function in ConcurrentHashTable
|
/dports/java/openjdk14/jdk14u-jdk-14.0.2-12-1/src/hotspot/share/utilities/ |
H A D | concurrentHashTable.hpp | 319 bool internal_insert(Thread* thread, LOOKUP_FUNC& lookup_f, const VALUE& value, 415 return internal_insert(thread, lookup_f, value, grow_hint, clean_hint); in insert()
|
/dports/misc/xdelta3/xdelta-3.1.0/xdelta3/cpp-btree/ |
H A D | btree.h | 1306 iterator internal_insert(iterator iter, const value_type &v); 1760 return std::make_pair(internal_insert(iter, *value), true); 1772 return internal_insert(position, v); 1779 return internal_insert(next, v); 1807 return internal_insert(iter, *value); 1819 return internal_insert(position, v); 1826 return internal_insert(next, v); 1855 internal_insert(end(), *iter); 2199 btree<P>::internal_insert(iterator iter, const value_type &v) {
|
/dports/sysutils/fwup/fwup-1.9.0/src/3rdparty/xdelta3/cpp-btree/ |
H A D | btree.h | 1306 iterator internal_insert(iterator iter, const value_type &v); 1760 return std::make_pair(internal_insert(iter, *value), true); 1772 return internal_insert(position, v); 1779 return internal_insert(next, v); 1807 return internal_insert(iter, *value); 1819 return internal_insert(position, v); 1826 return internal_insert(next, v); 1855 internal_insert(end(), *iter); 2199 btree<P>::internal_insert(iterator iter, const value_type &v) {
|
/dports/java/openjdk12/openjdk-jdk12u-jdk-12.0.2-10-4/src/hotspot/share/utilities/ |
H A D | concurrentHashTable.hpp | 321 bool internal_insert(Thread* thread, LOOKUP_FUNC& lookup_f, const VALUE& value, 450 return internal_insert(thread, lookup_f, value, grow_hint, clean_hint); in insert()
|
/dports/databases/mariadb105-client/mariadb-10.5.15/storage/columnstore/columnstore/utils/joiner/ |
H A D | btree.h | 1239 return std::make_pair(internal_insert(iter, *value), true); 1266 return internal_insert(position, v); 1277 return internal_insert(next, v); 1319 return internal_insert(iter, *value); 1345 return internal_insert(position, v); 1356 return internal_insert(next, v); 1393 internal_insert(end(), *iter); 2132 iterator internal_insert(iterator iter, const value_type& v)
|
/dports/databases/mariadb105-server/mariadb-10.5.15/storage/columnstore/columnstore/utils/joiner/ |
H A D | btree.h | 1239 return std::make_pair(internal_insert(iter, *value), true); 1266 return internal_insert(position, v); 1277 return internal_insert(next, v); 1319 return internal_insert(iter, *value); 1345 return internal_insert(position, v); 1356 return internal_insert(next, v); 1393 internal_insert(end(), *iter); 2132 iterator internal_insert(iterator iter, const value_type& v)
|
/dports/math/stanmath/math-4.2.0/lib/tbb_2020.3/include/tbb/internal/ |
H A D | _concurrent_skip_list_impl.h | 354 return internal_insert(value); in insert() 358 return internal_insert(std::move(value)); in insert() 399 return internal_insert(std::forward<Args>(args)...); in emplace() 773 std::pair<iterator, bool> internal_insert(Args&&... args) { in internal_insert() function
|
H A D | _concurrent_unordered_impl.h | 1069 return internal_insert</*AllowCreate=*/tbb::internal::true_type, in insert() 1080 return internal_insert</*AllowCreate=*/tbb::internal::true_type, in insert() 1095 internal_insert</*AllowCreate=*/tbb::internal::false_type, in insert() 1115 return internal_insert</*AllowCreate=*/tbb::internal::false_type, in emplace() 1404 …std::pair<iterator, bool> internal_insert(__TBB_FORWARDING_REF(ValueType) value, nodeptr_t pnode =… in __TBB_FORWARDING_REF()
|
/dports/devel/tbb/oneTBB-2020.3/include/tbb/internal/ |
H A D | _concurrent_skip_list_impl.h | 354 return internal_insert(value); in insert() 358 return internal_insert(std::move(value)); in insert() 399 return internal_insert(std::forward<Args>(args)...); in emplace() 773 std::pair<iterator, bool> internal_insert(Args&&... args) { in internal_insert() function
|
H A D | _concurrent_unordered_impl.h | 1069 return internal_insert</*AllowCreate=*/tbb::internal::true_type, in insert() 1080 return internal_insert</*AllowCreate=*/tbb::internal::true_type, in insert() 1095 internal_insert</*AllowCreate=*/tbb::internal::false_type, in insert() 1115 return internal_insert</*AllowCreate=*/tbb::internal::false_type, in emplace() 1404 …std::pair<iterator, bool> internal_insert(__TBB_FORWARDING_REF(ValueType) value, nodeptr_t pnode =… in __TBB_FORWARDING_REF()
|
/dports/devel/taskflow/taskflow-3.2.0/3rd-party/tbb/include/tbb/internal/ |
H A D | _concurrent_skip_list_impl.h | 354 return internal_insert(value); in insert() 358 return internal_insert(std::move(value)); in insert() 399 return internal_insert(std::forward<Args>(args)...); in emplace() 773 std::pair<iterator, bool> internal_insert(Args&&... args) { in internal_insert() function
|
H A D | _concurrent_unordered_impl.h | 1069 return internal_insert</*AllowCreate=*/tbb::internal::true_type, in insert() 1080 return internal_insert</*AllowCreate=*/tbb::internal::true_type, in insert() 1095 internal_insert</*AllowCreate=*/tbb::internal::false_type, in insert() 1115 return internal_insert</*AllowCreate=*/tbb::internal::false_type, in emplace() 1404 …std::pair<iterator, bool> internal_insert(__TBB_FORWARDING_REF(ValueType) value, nodeptr_t pnode =… in __TBB_FORWARDING_REF()
|
/dports/math/deal.ii/dealii-803d21ff957e349b3799cd3ef2c840bc78734305/bundled/tbb-2018_U2/include/tbb/internal/ |
H A D | _concurrent_unordered_impl.h | 959 return internal_insert</*AllowCreate=*/tbb::internal::true_type>(value); in insert() 969 return internal_insert</*AllowCreate=*/tbb::internal::true_type>(std::move(value)); in insert() 985 return internal_insert</*AllowCreate=*/tbb::internal::false_type>(pnode->my_element, pnode); in emplace() 1262 …std::pair<iterator, bool> internal_insert(__TBB_FORWARDING_REF(ValueType) value, nodeptr_t pnode =… in __TBB_FORWARDING_REF()
|
/dports/devel/onetbb/oneTBB-2021.4.0/include/oneapi/tbb/detail/ |
H A D | _concurrent_skip_list.h | 387 return internal_insert(value); in insert() 391 return internal_insert(std::move(value)); in insert() 435 return internal_insert(std::forward<Args>(args)...); in emplace() 932 std::pair<iterator, bool> internal_insert( Args&&... args ) { in internal_insert() function
|
H A D | _concurrent_unordered_base.h | 449 auto insert_result = internal_insert(insert_node->value(), init_node); in insert() 477 auto insert_result = internal_insert(insert_node->value(), init_node); in emplace() 948 auto insert_result = internal_insert(value, create_value_node); in internal_insert_value() 975 …internal_insert_return_type internal_insert( ValueType&& value, CreateInsertNode create_insert_nod… in internal_insert() function
|
/dports/textproc/go-yq/yq-4.7.0/vendor/github.com/timtadh/data-structures/tree/bptree/ |
H A D | bptree_node.go | 204 return self.internal_insert(key, value) 216 func (self *BpNode) internal_insert(key types.Hashable, value interface{}) (a, b *BpNode, err error… func
|
H A D | bptree_test.go | 542 p, q, err := a.internal_insert(types.Int(2), nil) 573 p, q, err := a.internal_insert(types.Int(2), nil)
|
/dports/devel/concurrentqueue/concurrentqueue-1.0.3-15-g0753496/benchmarks/tbb/internal/ |
H A D | _concurrent_unordered_impl.h | 980 return internal_insert(value); in insert() 1252 std::pair<iterator, bool> internal_insert(const value_type& value) in internal_insert() function
|