insert() [2/6]

template<typename Key, typename Value, typename Less = fl::less<Key>>

fl::pair< iterator, bool > fl::flat_map< Key, Value, Less >::insert ( const value_type & value )

inline

Definition at line 245 of file flat_map.h.

                                                                        {
        auto it = lower_bound(value.first);
        if (it != end() && !mLess(value.first, it->first) && !mLess(it->first, value.first)) {
            return fl::pair<iterator, bool>(it, false);  // Already exists
        }
        bool success = mData.insert(it, value);
        if (success) {
            // After insert, find the newly inserted element
            it = find(value.first);
            return fl::pair<iterator, bool>(it, true);
        }
        return fl::pair<iterator, bool>(end(), false);
    }

Referenced by fl::flat_map< int, FxPtr >::emplace(), fl::flat_map< int, FxPtr >::emplace_hint(), fl::flat_map< int, FxPtr >::insert(), fl::flat_map< int, FxPtr >::insert(), fl::flat_map< int, FxPtr >::insert_or_update(), fl::flat_map< int, FxPtr >::update(), and fl::flat_map< int, FxPtr >::update().

Here is the caller graph for this function: