mirror of
https://github.com/boostorg/algorithm.git
synced 2025-10-30 23:31:48 +01:00
103 lines
4.2 KiB
C++
103 lines
4.2 KiB
C++
/*
|
|
Copyright (c) Marshall Clow 2008-2012.
|
|
|
|
Distributed under 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)
|
|
|
|
For more information, see http://www.boost.org
|
|
*/
|
|
|
|
#include <boost/config.hpp>
|
|
#include <boost/algorithm/cxx11/one_of.hpp>
|
|
|
|
#define BOOST_TEST_MAIN
|
|
#include <boost/test/unit_test.hpp>
|
|
|
|
#include <functional>
|
|
#include <vector>
|
|
#include <list>
|
|
|
|
template<typename T>
|
|
struct is_ : public std::unary_function<T, bool> {
|
|
is_ ( T v ) : val_ ( v ) {}
|
|
~is_ () {}
|
|
bool operator () ( T comp ) const { return val_ == comp; }
|
|
private:
|
|
is_ (); // need a value
|
|
|
|
T val_;
|
|
};
|
|
|
|
namespace ba = boost::algorithm;
|
|
|
|
void test_one ()
|
|
{
|
|
// Note: The literal values here are tested against directly, careful if you change them:
|
|
int some_numbers[] = { 1, 1, 2, 3, 5 };
|
|
std::vector<int> vi(some_numbers, some_numbers + 5);
|
|
std::list<int> li(vi.begin(), vi.end ());
|
|
|
|
int some_letters[] = { 'a', 'q', 'n', 'y', 'n' };
|
|
std::vector<char> vc(some_letters, some_letters + 5);
|
|
|
|
BOOST_CHECK (!ba::one_of_equal ( vi, 1 ));
|
|
BOOST_CHECK (!ba::one_of ( vi, is_<int> ( 1 )));
|
|
BOOST_CHECK (!ba::one_of_equal ( vi.begin(), vi.end(), 1 ));
|
|
BOOST_CHECK (!ba::one_of ( vi.begin(), vi.end(), is_<int> ( 1 )));
|
|
|
|
BOOST_CHECK (!ba::one_of_equal ( vi, 0 ));
|
|
BOOST_CHECK (!ba::one_of ( vi, is_<int> ( 0 )));
|
|
BOOST_CHECK (!ba::one_of_equal ( vi.begin(), vi.end(), 0 ));
|
|
BOOST_CHECK (!ba::one_of ( vi.begin(), vi.end(), is_<int> ( 0 )));
|
|
|
|
BOOST_CHECK ( ba::one_of_equal ( vi, 2 ));
|
|
BOOST_CHECK ( ba::one_of ( vi, is_<int> ( 2 )));
|
|
BOOST_CHECK ( ba::one_of_equal ( vi.begin(), vi.end(), 2 ));
|
|
BOOST_CHECK ( ba::one_of ( vi.begin(), vi.end(), is_<int> ( 2 )));
|
|
|
|
// Check for a match at the end
|
|
BOOST_CHECK ( ba::one_of_equal ( vi, 5 ));
|
|
BOOST_CHECK ( ba::one_of ( vi, is_<int> ( 5 )));
|
|
BOOST_CHECK ( ba::one_of_equal ( vi.begin(), vi.end(), 5 ));
|
|
BOOST_CHECK ( ba::one_of ( vi.begin(), vi.end(), is_<int> ( 5 )));
|
|
|
|
BOOST_CHECK ( ba::one_of_equal ( vi.begin() + 1, vi.end(), 1 ));
|
|
BOOST_CHECK ( ba::one_of ( vi.begin() + 1, vi.end(), is_<int> ( 1 )));
|
|
|
|
BOOST_CHECK ( ba::one_of_equal ( vc.begin() + 1, vc.begin() + 2, 'q' ));
|
|
BOOST_CHECK ( ba::one_of ( vc.begin() + 1, vc.begin() + 2, is_<char> ( 'q' )));
|
|
|
|
BOOST_CHECK (!ba::one_of_equal ( vc, '!' ));
|
|
BOOST_CHECK (!ba::one_of ( vc, is_<char> ( '!' )));
|
|
|
|
BOOST_CHECK (!ba::one_of_equal ( vc, 'n' ));
|
|
BOOST_CHECK (!ba::one_of ( vc, is_<char> ( 'n' )));
|
|
|
|
// Empty range check
|
|
BOOST_CHECK (!ba::one_of_equal ( vi.begin(), vi.begin(), 1 ));
|
|
BOOST_CHECK (!ba::one_of_equal ( vc.begin(), vc.begin(), 'a' ));
|
|
BOOST_CHECK (!ba::one_of ( vi.begin(), vi.begin(), is_<int> ( 1 )));
|
|
BOOST_CHECK (!ba::one_of ( vc.begin(), vc.begin(), is_<char> ( 'a' )));
|
|
|
|
BOOST_CHECK (!ba::one_of_equal ( li, 1 ));
|
|
BOOST_CHECK (!ba::one_of ( li, is_<int> ( 1 )));
|
|
BOOST_CHECK (!ba::one_of_equal ( li.begin(), li.end(), 1 ));
|
|
BOOST_CHECK (!ba::one_of ( li.begin(), li.end(), is_<int> ( 1 )));
|
|
|
|
std::list<int>::iterator l_iter = li.begin ();
|
|
l_iter++; l_iter++; l_iter++;
|
|
BOOST_CHECK (!ba::one_of_equal ( li.begin(), l_iter, 1 ));
|
|
BOOST_CHECK (!ba::one_of ( li.begin(), l_iter, is_<int> ( 1 )));
|
|
BOOST_CHECK ( ba::one_of_equal ( li.begin(), l_iter, 2 ));
|
|
BOOST_CHECK ( ba::one_of ( li.begin(), l_iter, is_<int> ( 2 )));
|
|
BOOST_CHECK (!ba::one_of_equal ( li.begin(), l_iter, 3 ));
|
|
BOOST_CHECK (!ba::one_of ( li.begin(), l_iter, is_<int> ( 3 )));
|
|
|
|
}
|
|
|
|
|
|
BOOST_AUTO_TEST_CASE( test_main )
|
|
{
|
|
test_one ();
|
|
}
|