insert() [4/4]

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

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

inline

Definition at line 218 of file flat_set.h.

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

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

Here is the call graph for this function: