lexicographical_compare() [1/2]

template<typename Iterator1, typename Iterator2>

bool fl::adl_barrier::lexicographical_compare	(	Iterator1	first1,
		Iterator1	last1,
		Iterator2	first2,
		Iterator2	last2 )

Definition at line 149 of file algorithm.h.

                                                                                                                {
    while (first1 != last1 && first2 != last2) {
        if (*first1 < *first2) {
            return true;
        }
        if (*first2 < *first1) {
            return false;
        }
        ++first1;
        ++first2;
    }
    // If we've exhausted first1 but not first2, first1 is less
    // If we've exhausted both, they're equal (return false)
    // If we've exhausted first2 but not first1, first2 is less (return false)
    return (first1 == last1) && (first2 != last2);
}

References fl::FL_NO_EXCEPT.

Referenced by fl::MapRedBlackTree< Key, T, Compare, fl::allocator_slab< char > >< Key, T, Compare >::operator<(), fl::operator<(), fl::operator<(), and fl::set< T, fl::allocator_inlined_slab< T, N > >::operator<().

Here is the caller graph for this function: