find() [2/2]

template<typename T, typename LessThan = fl::less<T>>

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

inline

Definition at line 1064 of file vector.h.

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

References end(), FL_NOEXCEPT, lower_bound(), mLess, pos, and fl::type_rank< T >::value.

Referenced by erase(), find(), and has().

Here is the call graph for this function:

Here is the caller graph for this function: