Home
last modified time | relevance | path

Searched refs:insert_or_assign (Results 1 - 12 of 12) sorted by relevance

/third_party/skia/third_party/externals/abseil-cpp/absl/container/internal/
H A Draw_hash_map.h71 // m.insert_or_assign(n, n);
74 std::pair<iterator, bool> insert_or_assign(key_arg<K>&& k, V&& v) { in insert_or_assign() function in absl::container_internal::raw_hash_map
79 std::pair<iterator, bool> insert_or_assign(key_arg<K>&& k, const V& v) { in insert_or_assign() function in absl::container_internal::raw_hash_map
84 std::pair<iterator, bool> insert_or_assign(const key_arg<K>& k, V&& v) { in insert_or_assign() function in absl::container_internal::raw_hash_map
89 std::pair<iterator, bool> insert_or_assign(const key_arg<K>& k, const V& v) { in insert_or_assign() function in absl::container_internal::raw_hash_map
95 iterator insert_or_assign(const_iterator, key_arg<K>&& k, V&& v) { in insert_or_assign() function in absl::container_internal::raw_hash_map
96 return insert_or_assign(std::forward<K>(k), std::forward<V>(v)).first; in insert_or_assign()
100 iterator insert_or_assign(const_iterator, key_arg<K>&& k, const V& v) { in insert_or_assign() function in absl::container_internal::raw_hash_map
101 return insert_or_assign(std::forward<K>(k), v).first; in insert_or_assign()
105 iterator insert_or_assign(const_iterato function in absl::container_internal::raw_hash_map
110 iterator insert_or_assign(const_iterator, const key_arg<K>& k, const V& v) { insert_or_assign() function in absl::container_internal::raw_hash_map
[all...]
H A Dbtree_container.h415 std::pair<iterator, bool> insert_or_assign(const key_arg<K> &k, in insert_or_assign() function in absl::container_internal::btree_map_container
420 std::pair<iterator, bool> insert_or_assign(key_arg<K> &&k, const M &obj) { in insert_or_assign() function in absl::container_internal::btree_map_container
424 std::pair<iterator, bool> insert_or_assign(const key_arg<K> &k, M &&obj) { in insert_or_assign() function in absl::container_internal::btree_map_container
428 std::pair<iterator, bool> insert_or_assign(key_arg<K> &&k, M &&obj) { in insert_or_assign() function in absl::container_internal::btree_map_container
432 iterator insert_or_assign(const_iterator hint, const key_arg<K> &k, in insert_or_assign() function in absl::container_internal::btree_map_container
437 iterator insert_or_assign(const_iterator hint, key_arg<K> &&k, const M &obj) { in insert_or_assign() function in absl::container_internal::btree_map_container
441 iterator insert_or_assign(const_iterator hint, const key_arg<K> &k, M &&obj) { in insert_or_assign() function in absl::container_internal::btree_map_container
445 iterator insert_or_assign(const_iterator hint, key_arg<K> &&k, M &&obj) { in insert_or_assign() function in absl::container_internal::btree_map_container
H A Dunordered_map_modifiers_test.h124 auto p = m.insert_or_assign(k, val); in TYPED_TEST_P()
129 p = m.insert_or_assign(k, val2); in TYPED_TEST_P()
144 auto it = m.insert_or_assign(m.end(), k, val); in TYPED_TEST_P()
149 it = m.insert_or_assign(it, k, val2); in TYPED_TEST_P()
/third_party/gn/src/base/containers/
H A Dflat_map.h113 // pair<iterator, bool> insert_or_assign(K&&, M&&);
114 // iterator insert_or_assign(const_iterator hint, K&&, M&&);
218 std::pair<iterator, bool> insert_or_assign(K&& key, M&& obj);
220 iterator insert_or_assign(const_iterator hint, K&& key, M&& obj);
307 auto flat_map<Key, Mapped, Compare>::insert_or_assign(K&& key, M&& obj)
318 auto flat_map<Key, Mapped, Compare>::insert_or_assign(const_iterator hint,
H A Dflat_tree.h387 // std::map::insert_or_assign(const K&, V&&). It inserts val if an equivalent
392 std::pair<iterator, bool> insert_or_assign(V&& val) { in insert_or_assign() function in base::internal::flat_tree
402 // This method is similar to insert_or_assign, with the following differences:
731 insert_or_assign(*first); in insert()
/third_party/skia/third_party/externals/abseil-cpp/absl/container/
H A Dflat_hash_map_test.cc210 m.insert_or_assign(n, n); in TEST()
211 m.insert_or_assign(m.end(), n, n); in TEST()
H A Dbtree_test.cc2494 auto ret = m.insert_or_assign(4, 4); in TEST()
2497 ret = m.insert_or_assign(3, 100); in TEST()
2501 auto hint_ret = m.insert_or_assign(ret.first, 3, 200); in TEST()
2503 hint_ret = m.insert_or_assign(m.find(1), 0, 1); in TEST()
2506 hint_ret = m.insert_or_assign(m.end(), -1, 1); in TEST()
2517 auto ret = m.insert_or_assign(4, MovableOnlyInstance(4)); in TEST()
2520 ret = m.insert_or_assign(4, MovableOnlyInstance(100)); in TEST()
2524 auto hint_ret = m.insert_or_assign(ret.first, 3, MovableOnlyInstance(200)); in TEST()
2541 m.insert_or_assign(n, n); in TEST()
2542 m.insert_or_assign( in TEST()
[all...]
H A Dbtree_map.h229 // btree_map::insert_or_assign()
237 // pair<iterator, bool> insert_or_assign(const key_type& k, M&& obj):
238 // pair<iterator, bool> insert_or_assign(key_type&& k, M&& obj):
244 // iterator insert_or_assign(const_iterator hint,
246 // iterator insert_or_assign(const_iterator hint, key_type&& k, M&& obj):
251 using Base::insert_or_assign;
H A Dflat_hash_map.h289 // flat_hash_map::insert_or_assign()
298 // pair<iterator, bool> insert_or_assign(const init_type& k, T&& obj):
299 // pair<iterator, bool> insert_or_assign(init_type&& k, T&& obj):
304 // iterator insert_or_assign(const_iterator hint,
306 // iterator insert_or_assign(const_iterator hint, init_type&& k, T&& obj):
311 using Base::insert_or_assign;
H A Dnode_hash_map.h280 // node_hash_map::insert_or_assign()
289 // std::pair<iterator, bool> insert_or_assign(const init_type& k, T&& obj):
290 // std::pair<iterator, bool> insert_or_assign(init_type&& k, T&& obj):
295 // iterator insert_or_assign(const_iterator hint,
297 // iterator insert_or_assign(const_iterator hint, init_type&& k, T&& obj):
302 using Base::insert_or_assign;
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/ADT/
H A DStringMap.h420 std::pair<iterator, bool> insert_or_assign(StringRef Key, V &&Val) { in insert_or_assign() function in llvm::StringMap
/third_party/gn/src/base/
H A Dvalues.cc275 // NOTE: We can't use |insert_or_assign| here, as only |try_emplace| does in SetKey()
289 .insert_or_assign(std::move(key), in SetKey()
738 // NOTE: We can't use |insert_or_assign| here, as only |try_emplace| does

Completed in 16 milliseconds