Searched refs:insert_or_assign (Results 1 – 12 of 12) sorted by relevance
74 r = m.insert_or_assign(i, std::move(mv)); in main()83 r = m.insert_or_assign(-1, std::move(mv1)); in main()91 r = m.insert_or_assign(3, std::move(mv2)); in main()99 r = m.insert_or_assign(117, std::move(mv3)); in main()117 r = m.insert_or_assign(std::move(mvkey1), std::move(mv1)); in main()145 r = m.insert_or_assign(it, 2, std::move(mv1)); in main()152 r = m.insert_or_assign(it, 3, std::move(mv2)); in main()169 r = m.insert_or_assign(it, std::move(mvkey1), std::move(mv1)); in main()178 r = m.insert_or_assign(it, std::move(mvkey2), std::move(mv2)); in main()
80 r = m.insert_or_assign(i, std::move(mv)); in main()89 r = m.insert_or_assign(-1, std::move(mv1)); in main()97 r = m.insert_or_assign(3, std::move(mv2)); in main()105 r = m.insert_or_assign(117, std::move(mv3)); in main()123 r = m.insert_or_assign(std::move(mvkey1), std::move(mv1)); in main()151 r = m.insert_or_assign(it, 2, std::move(mv1)); in main()158 r = m.insert_or_assign(it, 3, std::move(mv2)); in main()175 r = m.insert_or_assign(it, std::move(mvkey1), std::move(mv1)); in main()184 r = m.insert_or_assign(it, std::move(mvkey2), std::move(mv2)); in main()
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,
392 std::pair<iterator, bool> insert_or_assign(V&& val) {731 insert_or_assign(*first);
72 table_.insert_or_assign(string(keys[i]), values[i]); in Initialize()87 table_.insert_or_assign(keys[i], values[i]); in Initialize()
41 name: "insert_or_assign"
314 all_node_names.insert_or_assign(graph_def.node(i).name(), i); in FindSinkNode()315 node_input_map.insert_or_assign(graph_def.node(i).name(), 0); in FindSinkNode()
142 pair<iterator, bool> insert_or_assign(const key_type& k, M&& obj); // C++17144 pair<iterator, bool> insert_or_assign(key_type&& k, M&& obj); // C++17146 iterator insert_or_assign(const_iterator hint, const key_type& k, M&& obj); // C++17148 iterator insert_or_assign(const_iterator hint, key_type&& k, M&& obj); // C++171147 pair<iterator, bool> insert_or_assign(const key_type& __k, _Vp&& __v)1159 pair<iterator, bool> insert_or_assign(key_type&& __k, _Vp&& __v)1171 iterator insert_or_assign(const_iterator, const key_type& __k, _Vp&& __v)1174 return insert_or_assign(__k, _VSTD::forward<_Vp>(__v)).first;1179 iterator insert_or_assign(const_iterator, key_type&& __k, _Vp&& __v)1182 return insert_or_assign(_VSTD::move(__k), _VSTD::forward<_Vp>(__v)).first;
156 pair<iterator, bool> insert_or_assign(const key_type& k, M&& obj); // C++17158 pair<iterator, bool> insert_or_assign(key_type&& k, M&& obj); // C++17160 iterator insert_or_assign(const_iterator hint, const key_type& k, M&& obj); // C++17162 iterator insert_or_assign(const_iterator hint, key_type&& k, M&& obj); // C++171243 pair<iterator, bool> insert_or_assign(const key_type& __k, _Vp&& __v)1256 pair<iterator, bool> insert_or_assign(key_type&& __k, _Vp&& __v)1269 iterator insert_or_assign(const_iterator __h, const key_type& __k, _Vp&& __v)1282 iterator insert_or_assign(const_iterator __h, key_type&& __k, _Vp&& __v)
1910 def insert_or_assign(self, keys, values, name=None): member in DenseHashTable1954 return self.insert_or_assign(keys, values, name)
310 .insert_or_assign(std::move(key), in SetKey()