insert() [2/4]

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

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

inline

Definition at line 234 of file flat_set.h.

                                                                  {
        // TODO: use hint for performance if it's valid
        return insert(value).first;
    }

References insert(), and fl::type_rank< T >::value.

Here is the call graph for this function: