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/
Draw_hash_map.h74 std::pair<iterator, bool> insert_or_assign(key_arg<K>&& k, V&& v) { in insert_or_assign() function
79 std::pair<iterator, bool> insert_or_assign(key_arg<K>&& k, const V& v) { in insert_or_assign() function
84 std::pair<iterator, bool> insert_or_assign(const key_arg<K>& k, V&& v) { in insert_or_assign() function
89 std::pair<iterator, bool> insert_or_assign(const key_arg<K>& k, const V& v) { in insert_or_assign() function
95 iterator insert_or_assign(const_iterator, key_arg<K>&& k, V&& v) { in insert_or_assign() function
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
101 return insert_or_assign(std::forward<K>(k), v).first; in insert_or_assign()
105 iterator insert_or_assign(const_iterator, const key_arg<K>& k, V&& v) { in insert_or_assign() function
106 return insert_or_assign(k, std::forward<V>(v)).first; in insert_or_assign()
[all …]
Dbtree_container.h415 std::pair<iterator, bool> insert_or_assign(const key_arg<K> &k, in insert_or_assign() function
420 std::pair<iterator, bool> insert_or_assign(key_arg<K> &&k, const M &obj) { in insert_or_assign() function
424 std::pair<iterator, bool> insert_or_assign(const key_arg<K> &k, M &&obj) { in insert_or_assign() function
428 std::pair<iterator, bool> insert_or_assign(key_arg<K> &&k, M &&obj) { in insert_or_assign() function
432 iterator insert_or_assign(const_iterator hint, const key_arg<K> &k, in insert_or_assign() function
437 iterator insert_or_assign(const_iterator hint, key_arg<K> &&k, const M &obj) { in insert_or_assign() function
441 iterator insert_or_assign(const_iterator hint, const key_arg<K> &k, M &&obj) { in insert_or_assign() function
445 iterator insert_or_assign(const_iterator hint, key_arg<K> &&k, M &&obj) { in insert_or_assign() function
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/
Dflat_map.h218 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,
Dflat_tree.h392 std::pair<iterator, bool> insert_or_assign(V&& val) {
731 insert_or_assign(*first);
/third_party/skia/third_party/externals/abseil-cpp/absl/container/
Dflat_hash_map_test.cc210 m.insert_or_assign(n, n); in TEST()
211 m.insert_or_assign(m.end(), n, n); in TEST()
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(m.end(), n, n); in TEST()
[all …]
Dnode_hash_map.h302 using Base::insert_or_assign;
Dflat_hash_map.h311 using Base::insert_or_assign;
Dbtree_map.h251 using Base::insert_or_assign;
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/ADT/
DStringMap.h420 std::pair<iterator, bool> insert_or_assign(StringRef Key, V &&Val) { in insert_or_assign() function
/third_party/gn/src/base/
Dvalues.cc289 .insert_or_assign(std::move(key), in SetKey()