find() [1/2]

template<typename Key, size_t N>

iterator fl::FixedSet< Key, N >::find ( const Key & key )

inline

Definition at line 30 of file set.h.

                                  {
        for (auto it = begin(); it != end(); ++it) {
            if (*it == key) {
                return it;
            }
        }
        return end();
    }

References begin(), and end().

Referenced by erase(), has(), insert(), next(), and prev().

Here is the call graph for this function:

Here is the caller graph for this function: