//===----------------------------------------------------------------------===// // // The LLVM Compiler Infrastructure // // This file is distributed under the University of Illinois Open Source // License. See LICENSE.TXT for details. // //===----------------------------------------------------------------------===// // // template // requires HasLess // && HasLess // bool // lexicographical_compare(Iter1 first1, Iter1 last1, Iter2 first2, Iter2 last2); #include #include #include "../../iterators.h" template void test() { int ia[] = {1, 2, 3, 4}; const unsigned sa = sizeof(ia)/sizeof(ia[0]); int ib[] = {1, 2, 3}; assert(!std::lexicographical_compare(ia, ia+sa, ib, ib+2)); assert(std::lexicographical_compare(ib, ib+2, ia, ia+sa)); assert(!std::lexicographical_compare(ia, ia+sa, ib, ib+3)); assert(std::lexicographical_compare(ib, ib+3, ia, ia+sa)); assert(std::lexicographical_compare(ia, ia+sa, ib+1, ib+3)); assert(!std::lexicographical_compare(ib+1, ib+3, ia, ia+sa)); } int main() { test, input_iterator >(); test, forward_iterator >(); test, bidirectional_iterator >(); test, random_access_iterator >(); test, const int*>(); test, input_iterator >(); test, forward_iterator >(); test, bidirectional_iterator >(); test, random_access_iterator >(); test, const int*>(); test, input_iterator >(); test, forward_iterator >(); test, bidirectional_iterator >(); test, random_access_iterator >(); test, const int*>(); test, input_iterator >(); test, forward_iterator >(); test, bidirectional_iterator >(); test, random_access_iterator >(); test, const int*>(); test >(); test >(); test >(); test >(); test(); }