find() [1/2]

template<typename T, typename LessThan>

iterator fl::SortedHeapVector< T, LessThan >::find ( const T & value )

inline

Definition at line 592 of file vector.h.

                                  {
        iterator pos = lower_bound(value);
        if (pos != end() && !mLess(value, *pos) && !mLess(*pos, value)) {
            return pos;
        }
        return end();
    }

Referenced by fl::iterator< Pair, PairLess >::erase(), fl::iterator< Pair, PairLess >::find(), and fl::iterator< Pair, PairLess >::has().

Here is the caller graph for this function: