insert() [2/2]

template<typename Key, typename Hash = Hash<Key>, typename KeyEqual = EqualTo<Key>>

bool fl::unordered_set< Key, Hash, KeyEqual >::insert ( Key && key )

inline

Definition at line 93 of file unordered_set.h.

                           {
        return data.insert(fl::move(key), true).second;
    }

References data, and fl::fl::move().

Here is the call graph for this function: