| /external/sdv/vsomeip/third_party/boost/intrusive/include/boost/intrusive/ |
| D | treap.hpp | 435 node_ptr to_insert(this->get_value_traits().to_node_ptr(value)); in insert_equal() local
436 …_INTRUSIVE_SAFE_HOOK_DEFAULT_ASSERT(!safemode_or_autounlink || node_algorithms::unique(to_insert)); in insert_equal()
440 , to_insert in insert_equal()
464 node_ptr to_insert(this->get_value_traits().to_node_ptr(value)); in insert_equal() local
465 …_INTRUSIVE_SAFE_HOOK_DEFAULT_ASSERT(!safemode_or_autounlink || node_algorithms::unique(to_insert)); in insert_equal()
470 , to_insert in insert_equal()
760 node_ptr to_insert(this->get_value_traits().to_node_ptr(value)); in insert_unique_commit() local
761 …_INTRUSIVE_SAFE_HOOK_DEFAULT_ASSERT(!safemode_or_autounlink || node_algorithms::unique(to_insert)); in insert_unique_commit()
762 node_algorithms::insert_unique_commit(this->tree_type::header_ptr(), to_insert, commit_data); in insert_unique_commit()
764 return iterator(to_insert, this->priv_value_traits_ptr()); in insert_unique_commit()
[all …]
|
| D | sgtree.hpp | 448 node_ptr to_insert(this->get_value_traits().to_node_ptr(value)); in insert_equal() local
449 …_INTRUSIVE_SAFE_HOOK_DEFAULT_ASSERT(!safemode_or_autounlink || node_algorithms::unique(to_insert)); in insert_equal()
452 (this->tree_type::header_ptr(), to_insert, this->key_node_comp(this->key_comp()) in insert_equal()
462 node_ptr to_insert(this->get_value_traits().to_node_ptr(value)); in insert_equal() local
463 …_INTRUSIVE_SAFE_HOOK_DEFAULT_ASSERT(!safemode_or_autounlink || node_algorithms::unique(to_insert)); in insert_equal()
466 …( this->tree_type::header_ptr(), hint.pointed_node(), to_insert, this->key_node_comp(this->key_com… in insert_equal()
544 node_ptr to_insert(this->get_value_traits().to_node_ptr(value)); in insert_unique_commit() local
545 …_INTRUSIVE_SAFE_HOOK_DEFAULT_ASSERT(!safemode_or_autounlink || node_algorithms::unique(to_insert)); in insert_unique_commit()
548 ( this->tree_type::header_ptr(), to_insert, commit_data in insert_unique_commit()
552 return iterator(to_insert, this->priv_value_traits_ptr()); in insert_unique_commit()
[all …]
|
| D | bstree.hpp | 1064 node_ptr to_insert(this->get_value_traits().to_node_ptr(value)); in insert_equal() local
1065 …_INTRUSIVE_SAFE_HOOK_DEFAULT_ASSERT(!safemode_or_autounlink || node_algorithms::unique(to_insert)); in insert_equal()
1067 …(this->header_ptr(), to_insert, this->key_node_comp(this->key_comp())), this->priv_value_traits_pt… in insert_equal()
1088 node_ptr to_insert(this->get_value_traits().to_node_ptr(value)); in insert_equal() local
1089 …_INTRUSIVE_SAFE_HOOK_DEFAULT_ASSERT(!safemode_or_autounlink || node_algorithms::unique(to_insert)); in insert_equal()
1091 …(this->header_ptr(), hint.pointed_node(), to_insert, this->key_node_comp(this->key_comp())), this-… in insert_equal()
1317 node_ptr to_insert(this->get_value_traits().to_node_ptr(value)); in insert_unique_commit() local
1318 …_INTRUSIVE_SAFE_HOOK_DEFAULT_ASSERT(!safemode_or_autounlink || node_algorithms::unique(to_insert)); in insert_unique_commit()
1333 (this->header_ptr(), to_insert, commit_data); in insert_unique_commit()
1335 return iterator(to_insert, this->priv_value_traits_ptr()); in insert_unique_commit()
[all …]
|
| D | list.hpp | 270 node_ptr to_insert = priv_value_traits().to_node_ptr(value); in push_back() local
271 …_INTRUSIVE_SAFE_HOOK_DEFAULT_ASSERT(!safemode_or_autounlink || node_algorithms::inited(to_insert)); in push_back()
272 node_algorithms::link_before(this->get_root_node(), to_insert); in push_back()
288 node_ptr to_insert = priv_value_traits().to_node_ptr(value); in push_front() local
289 …_INTRUSIVE_SAFE_HOOK_DEFAULT_ASSERT(!safemode_or_autounlink || node_algorithms::inited(to_insert)); in push_front()
290 node_algorithms::link_before(node_traits::get_next(this->get_root_node()), to_insert); in push_front()
827 node_ptr to_insert = this->priv_value_traits().to_node_ptr(value); in insert() local
828 …_INTRUSIVE_SAFE_HOOK_DEFAULT_ASSERT(!safemode_or_autounlink || node_algorithms::inited(to_insert)); in insert()
829 node_algorithms::link_before(p.pointed_node(), to_insert); in insert()
831 return iterator(to_insert, this->priv_value_traits_ptr()); in insert()
|
| D | slist.hpp | 433 node_ptr to_insert = priv_value_traits().to_node_ptr(value); in push_front() local
434 …_INTRUSIVE_SAFE_HOOK_DEFAULT_ASSERT(!safemode_or_autounlink || node_algorithms::inited(to_insert)); in push_front()
437 this->set_last_node(to_insert); in push_front()
440 node_algorithms::link_after(this->get_root_node(), to_insert); in push_front()
|
| /external/pytorch/functorch/csrc/dim/ |
| D | arena.h | 70 void insert(Arena& arena, Slice where, Slice to_insert);
78 void extend(Arena& arena, Slice to_insert);
261 inline void Slice<T>::insert(Arena& arena, Slice where, Slice to_insert) {
266 if (where.size() != to_insert.size()) {
267 int new_size = size() - where.size() + to_insert.size();
268 T* tail_dest = where.begin() + to_insert.size();
274 tail_dest = body_dest + to_insert.size();
283 std::copy(to_insert.begin(), to_insert.end(), body_dest);
|
| /external/skia/modules/bentleyottmann/tests/ |
| D | MyersTest.cpp | 15 bool segment_less_than_upper_to_insert(const Segment& segment, const Segment& to_insert);
96 to_insert = {{0, 0}, {0, 3}}; in DEF_TEST() local
101 auto insertionPoint = std::lower_bound(sweepLine.begin(), sweepLine.end(), to_insert, in DEF_TEST()
|
| /external/skia/modules/bentleyottmann/src/ |
| D | Myers.cpp | 158 bool segment_less_than_upper_to_insert(const Segment& segment, const Segment& to_insert) { in segment_less_than_upper_to_insert() argument
159 const int64_t compare = compare_point_to_segment(to_insert.upper(), segment); in segment_less_than_upper_to_insert()
162 return (compare > 0) || ((compare == 0) && slope_s0_less_than_slope_s1(segment, to_insert)); in segment_less_than_upper_to_insert()
|
| /external/jemalloc_new/include/jemalloc/internal/ |
| D | extent_inlines.h | 365 extent_t *to_insert) { in extent_list_replace() argument
366 ql_after_insert(to_remove, to_insert, ql_link); in extent_list_replace()
|
| /external/pigweed/pw_containers/public/pw_containers/ |
| D | vector.h | 477 void ShiftEntriesForInsert(T* first, size_type to_insert);
689 T* first, const size_type to_insert) {
694 T* dest = end() + to_insert;
|
| /external/pytorch/c10/util/ |
| D | flat_hash_map.h | 821 value_type to_insert(std::forward<Key>(key), std::forward<Args>(args)...);
823 swap(to_insert, current_entry->value);
827 current_entry->emplace(distance_from_desired, std::move(to_insert));
832 swap(to_insert, current_entry->value);
837 swap(to_insert, result.current->value);
839 return emplace(std::move(to_insert));
|
| D | order_preserving_flat_hash_map.h | 922 value_type to_insert(std::forward<Key>(key), std::forward<Args>(args)...);
929 swap(to_insert, current_entry->value);
933 current_entry->emplace(distance_from_desired, std::move(to_insert));
942 swap(to_insert, current_entry->value);
953 swap(to_insert, result.current->value);
955 return emplace(std::move(to_insert));
|
| /external/tensorflow/tensorflow/compiler/xla/service/ |
| D | hlo_rematerialization.cc | 285 void InsertBeforeInstructions(Item* to_insert, in InsertBeforeInstructions() argument
287 VLOG(3) << "InsertBeforeInstructions: " << to_insert->instruction->name() in InsertBeforeInstructions()
320 return InsertBefore(to_insert, min_position_item); in InsertBeforeInstructions()
344 void InsertAfterInstructions(Item* to_insert, in InsertAfterInstructions() argument
346 VLOG(3) << "InsertAfterInstructions: " << to_insert->instruction->name() in InsertAfterInstructions()
367 InsertBeforeInstructions(to_insert, {max_position_item->next}); in InsertAfterInstructions()
|
| /external/rust/android-crates-io/crates/hyper/src/client/ |
| D | pool.rs | 217 Reservation::Shared(to_insert, to_return) => { in pooled()
219 inner.put(connecting.key.clone(), to_insert, enabled); in pooled()
|
| /external/python/cpython3/Lib/test/test_ttk/ |
| D | test_widgets.py | 413 def validate(to_insert): argument
414 if not 'a' <= to_insert.lower() <= 'z':
|
| /external/sdv/vsomeip/third_party/boost/intrusive/doc/ |
| D | intrusive.qbk | 2584 node_ptr to_insert(ValueTraits::to_node_ptr(value));
2585 circular_list_algorithms::link_after(to_insert, get_root_node());
|
| /external/rust/android-crates-io/crates/tikv-jemalloc-sys/patches/ |
| D | delete_c_library.patch | 56305 - el_type *to_insert) { \
56306 - ql_elm_new(to_insert, linkage); \
56307 - ql_after_insert(to_remove, to_insert, linkage); \
|