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.

                                                                {
        size_type idx = find_index(kv.first);
        if (idx != npos()) {
            return fl::pair<iterator, bool>(iterator(this, idx), false);
        }
        idx = do_insert(fl::move(kv));
        return fl::pair<iterator, bool>(iterator(this, idx), true);
    }

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

Here is the call graph for this function: