mirror of
https://github.com/boostorg/utility.git
synced 2025-11-03 01:41:51 +01:00
75 lines
2.2 KiB
C++
75 lines
2.2 KiB
C++
// Copyright (c) 2003 Jan Langer
|
|
// Use, modification, and distribution is subject to the Boost Software
|
|
// License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy
|
|
// at http://www.boost.org/LICENSE_1_0.txt)
|
|
|
|
// See library home page at http://www.boost.org/libs/utility
|
|
|
|
#include <functional>
|
|
|
|
#include <boost/test/minimal.hpp>
|
|
#include <boost/utility/lexicographic.hpp>
|
|
|
|
int test_main (int, char *[])
|
|
{
|
|
using boost::lexicographic;
|
|
|
|
lexicographic l1; // equivalent
|
|
BOOST_CHECK (!l1);
|
|
|
|
lexicographic l2 (l1); // equivalent
|
|
BOOST_CHECK (!l2);
|
|
BOOST_CHECK (l1 == l2);
|
|
|
|
l2 = l1;
|
|
BOOST_CHECK (!l2);
|
|
BOOST_CHECK (l2 == l1);
|
|
|
|
l2 (3, 6); // less
|
|
BOOST_CHECK (l2);
|
|
BOOST_CHECK (l2.result () == lexicographic::minus);
|
|
BOOST_CHECK (lexicographic::minus == l2.result ());
|
|
BOOST_CHECK (l2.result () != lexicographic::equivalent);
|
|
BOOST_CHECK (lexicographic::equivalent != l2.result ());
|
|
BOOST_CHECK (l1 != l2);
|
|
|
|
lexicographic l3 (3.0, 1.0); // greater
|
|
BOOST_CHECK (!l3);
|
|
BOOST_CHECK (l3 != l1);
|
|
|
|
for (int i = 1; i <= 3; ++i)
|
|
for (int j = 1; j <= 3; ++j)
|
|
for (int k = 1; k <= 3; ++k)
|
|
{
|
|
lexicographic l4;
|
|
l4 (i, 2) (j, 2) (k, 2);
|
|
|
|
if (i < 2)
|
|
BOOST_CHECK (l4);
|
|
else if (i > 2)
|
|
BOOST_CHECK (!l4);
|
|
else if (j < 2)
|
|
BOOST_CHECK (l4);
|
|
else if (j > 2)
|
|
BOOST_CHECK (!l4);
|
|
else if (k < 2)
|
|
BOOST_CHECK (l4);
|
|
else
|
|
BOOST_CHECK (!l4);
|
|
}
|
|
|
|
lexicographic l5;
|
|
l5 (1, 1, std::greater <int> ()) (2, 3);
|
|
BOOST_CHECK (l5);
|
|
|
|
lexicographic l6;
|
|
l6 (1, 1, std::greater <int> ()) (2, 3, std::greater <int> ());
|
|
BOOST_CHECK (!l6);
|
|
|
|
lexicographic l7;
|
|
l7 (1, 1) (2, 3, std::greater <int> ());
|
|
BOOST_CHECK (!l7);
|
|
|
|
return 0;
|
|
}
|