insert() [1/4]

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

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

inline

Definition at line 204 of file flat_set.h.

                                                           {
        auto it = lower_bound(value);
        if (it != end() && !mLess(value, *it) && !mLess(*it, value)) {
            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);
            return fl::pair<iterator, bool>(it, true);
        }
        return fl::pair<iterator, bool>(end(), false);
    }

References end(), find(), lower_bound(), mData, mLess, and fl::type_rank< T >::value.

Referenced by emplace(), emplace_hint(), insert(), and insert().

Here is the call graph for this function:

Here is the caller graph for this function: