lower_bound() [1/2]

template<typename T, typename LessThan>

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

inline

Definition at line 571 of file vector.h.

                                         {
        iterator first = mArray.begin();
        iterator last = mArray.end();
        
        while (first != last) {
            iterator mid = first + (last - first) / 2;
            
            if (mLess(*mid, value)) {
                first = mid + 1;
            } else {
                last = mid;
            }
        }
        return first;
    }

Referenced by fl::iterator< Pair, PairLess >::find(), fl::iterator< Pair, PairLess >::insert(), and fl::iterator< Pair, PairLess >::lower_bound().

Here is the caller graph for this function: