has()

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

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

inline

Definition at line 150 of file unordered_set.h.

{ return data.contains(key); }

References data.

Referenced by contains(), count(), and operator==().

Here is the caller graph for this function: