FastLED 3.9.15
Loading...
Searching...
No Matches

◆ insert() [4/4]

template<typename Key, typename Value, typename Equal = fl::SmallMapEqualTo<Key>>
fl::pair< iterator, bool > fl::unordered_map_small< Key, Value, Equal >::insert ( value_type && kv)
inline

Definition at line 300 of file unordered_map_small.h.

300 {
301 size_type idx = find_index(kv.first);
302 if (idx != npos()) {
303 return fl::pair<iterator, bool>(iterator(this, idx), false);
304 }
306 return fl::pair<iterator, bool>(iterator(this, idx), true);
307 }
size_type do_insert(const value_type &kv) FL_NOEXCEPT
static size_type npos() FL_NOEXCEPT
size_type find_index(const Key &key) const FL_NOEXCEPT

References do_insert(), find_index(), FL_NOEXCEPT, fl::fl::move(), and npos().

+ Here is the call graph for this function: