2003-04-17 06:07:41 +00:00
|
|
|
// (C) 2003, Jan Langer (jan@langernetz.de).
|
|
|
|
//
|
|
|
|
// This material is provided "as is", with absolutely no warranty expressed
|
|
|
|
// or implied. Any use is at your own risk.
|
|
|
|
//
|
|
|
|
// Permission to use or copy this software for any purpose is hereby granted
|
|
|
|
// without fee, provided the above notices are retained on all copies.
|
|
|
|
// Permission to modify the code and to distribute modified code is granted,
|
|
|
|
// provided the above notices are retained, and a notice that the code was
|
|
|
|
// modified is included with the above copyright notice.
|
|
|
|
|
|
|
|
#include <functional>
|
|
|
|
|
2003-08-22 15:20:35 +00:00
|
|
|
#include <boost/test/minimal.hpp>
|
2003-04-17 06:07:41 +00:00
|
|
|
#include <boost/utility/lexicographic.hpp>
|
|
|
|
|
2003-08-22 15:20:35 +00:00
|
|
|
int test_main (int, char *[])
|
2003-04-17 06:07:41 +00:00
|
|
|
{
|
|
|
|
using boost::lexicographic;
|
|
|
|
|
|
|
|
lexicographic l1; // equivalent
|
2003-08-22 15:20:35 +00:00
|
|
|
BOOST_CHECK (!l1);
|
2003-04-17 06:07:41 +00:00
|
|
|
|
|
|
|
lexicographic l2 (l1); // equivalent
|
2003-08-22 15:20:35 +00:00
|
|
|
BOOST_CHECK (!l2);
|
|
|
|
BOOST_CHECK (l1 == l2);
|
2003-04-17 06:07:41 +00:00
|
|
|
|
|
|
|
l2 = l1;
|
2003-08-22 15:20:35 +00:00
|
|
|
BOOST_CHECK (!l2);
|
|
|
|
BOOST_CHECK (l2 == l1);
|
2003-04-17 06:07:41 +00:00
|
|
|
|
|
|
|
l2 (3, 6); // less
|
2003-08-22 15:20:35 +00:00
|
|
|
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);
|
2003-04-17 06:07:41 +00:00
|
|
|
|
|
|
|
lexicographic l3 (3.0, 1.0); // greater
|
2003-08-22 15:20:35 +00:00
|
|
|
BOOST_CHECK (!l3);
|
|
|
|
BOOST_CHECK (l3 != l1);
|
2003-04-17 06:07:41 +00:00
|
|
|
|
|
|
|
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)
|
2003-08-22 15:20:35 +00:00
|
|
|
BOOST_CHECK (l4);
|
2003-04-17 06:07:41 +00:00
|
|
|
else if (i > 2)
|
2003-08-22 15:20:35 +00:00
|
|
|
BOOST_CHECK (!l4);
|
2003-04-17 06:07:41 +00:00
|
|
|
else if (j < 2)
|
2003-08-22 15:20:35 +00:00
|
|
|
BOOST_CHECK (l4);
|
2003-04-17 06:07:41 +00:00
|
|
|
else if (j > 2)
|
2003-08-22 15:20:35 +00:00
|
|
|
BOOST_CHECK (!l4);
|
2003-04-17 06:07:41 +00:00
|
|
|
else if (k < 2)
|
2003-08-22 15:20:35 +00:00
|
|
|
BOOST_CHECK (l4);
|
2003-04-17 06:07:41 +00:00
|
|
|
else
|
2003-08-22 15:20:35 +00:00
|
|
|
BOOST_CHECK (!l4);
|
2003-04-17 06:07:41 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
lexicographic l5;
|
|
|
|
l5 (1, 1, std::greater <int> ()) (2, 3);
|
2003-08-22 15:20:35 +00:00
|
|
|
BOOST_CHECK (l5);
|
2003-04-17 06:07:41 +00:00
|
|
|
|
|
|
|
lexicographic l6;
|
|
|
|
l6 (1, 1, std::greater <int> ()) (2, 3, std::greater <int> ());
|
2003-08-22 15:20:35 +00:00
|
|
|
BOOST_CHECK (!l6);
|
2003-04-17 06:07:41 +00:00
|
|
|
|
|
|
|
lexicographic l7;
|
|
|
|
l7 (1, 1) (2, 3, std::greater <int> ());
|
2003-08-22 15:20:35 +00:00
|
|
|
BOOST_CHECK (!l7);
|
|
|
|
|
|
|
|
return 0;
|
2003-04-17 06:07:41 +00:00
|
|
|
}
|