Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Add sentinel cases to find_not_test.cpp. #97

Open
wants to merge 1 commit into
base: develop
Choose a base branch
from
Open

Add sentinel cases to find_not_test.cpp. #97

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
77 changes: 77 additions & 0 deletions test/find_not_test.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -62,6 +62,15 @@ BOOST_CXX14_CONSTEXPR bool check_constexpr()
return res;
}

template<typename Iter>
struct sentinel
{
friend bool operator==(Iter it, sentinel last) { return it == last.last_; }
friend bool operator!=(Iter it, sentinel last) { return it != last.last_; }

Iter last_;
};

void test_sequence()
{
{
Expand Down Expand Up @@ -91,6 +100,39 @@ void test_sequence()
BOOST_CHECK_EQUAL(dist(ba::find_not(v1, v1.back())), v1.size());
BOOST_CHECK_EQUAL(dist(ba::find_not(v1, v1.front())), v1.size());
}
// Using sentinel.
{
std::vector<int> v1;
const dist_t<std::vector<int> > dist(v1);
sentinel<std::vector<int>::iterator> v1_end;

for (int i = 5; i < 15; ++i)
v1.push_back(i);
v1_end = sentinel<std::vector<int>::iterator>{v1.end()};

BOOST_CHECK_EQUAL(dist(ba::find_not(v1.begin(), v1_end, 0)), 0);
BOOST_CHECK_EQUAL(
dist(ba::find_not(v1.begin(), v1_end, v1.back())), 0);
BOOST_CHECK_EQUAL(
dist(ba::find_not(v1.begin(), v1_end, v1.front())), 1);

BOOST_CHECK_EQUAL(dist(ba::find_not(v1, 0)), 0);
BOOST_CHECK_EQUAL(dist(ba::find_not(v1, v1.back())), 0);
BOOST_CHECK_EQUAL(dist(ba::find_not(v1, v1.front())), 1);

v1 = std::vector<int>(10, 2);
v1_end = sentinel<std::vector<int>::iterator>{v1.end()};

BOOST_CHECK_EQUAL(dist(ba::find_not(v1.begin(), v1_end, 0)), 0);
BOOST_CHECK_EQUAL(
dist(ba::find_not(v1.begin(), v1_end, v1.back())), v1.size());
BOOST_CHECK_EQUAL(
dist(ba::find_not(v1.begin(), v1_end, v1.front())), v1.size());

BOOST_CHECK_EQUAL(dist(ba::find_not(v1, 0)), 0);
BOOST_CHECK_EQUAL(dist(ba::find_not(v1, v1.back())), v1.size());
BOOST_CHECK_EQUAL(dist(ba::find_not(v1, v1.front())), v1.size());
}

// With bidirectional iterators.
{
Expand Down Expand Up @@ -122,6 +164,41 @@ void test_sequence()
BOOST_CHECK_EQUAL(dist(ba::find_not(l1, l1.back())), l1.size());
BOOST_CHECK_EQUAL(dist(ba::find_not(l1, l1.front())), l1.size());
}
// With bidirectional iterator/sentinel.
{
std::list<int> l1;
const dist_t<std::list<int> > dist(l1);
sentinel<std::list<int>::iterator> l1_end;

for (int i = 5; i < 15; ++i)
l1.push_back(i);
l1_end = sentinel<std::list<int>::iterator>{l1.end()};

BOOST_CHECK_EQUAL(dist(ba::find_not(l1.begin(), l1.end(), 0)), 0);
BOOST_CHECK_EQUAL(
dist(ba::find_not(l1.begin(), l1.end(), l1.back())), 0);
BOOST_CHECK_EQUAL(
dist(ba::find_not(l1.begin(), l1.end(), l1.front())), 1);

BOOST_CHECK_EQUAL(dist(ba::find_not(l1, 0)), 0);
BOOST_CHECK_EQUAL(dist(ba::find_not(l1, l1.back())), 0);
BOOST_CHECK_EQUAL(dist(ba::find_not(l1, l1.front())), 1);

l1.clear();
for (int i = 0; i < 10; ++i)
l1.push_back(2);
l1_end = sentinel<std::list<int>::iterator>{l1.end()};

BOOST_CHECK_EQUAL(dist(ba::find_not(l1.begin(), l1.end(), 0)), 0);
BOOST_CHECK_EQUAL(
dist(ba::find_not(l1.begin(), l1.end(), l1.back())), l1.size());
BOOST_CHECK_EQUAL(
dist(ba::find_not(l1.begin(), l1.end(), l1.front())), l1.size());

BOOST_CHECK_EQUAL(dist(ba::find_not(l1, 0)), 0);
BOOST_CHECK_EQUAL(dist(ba::find_not(l1, l1.back())), l1.size());
BOOST_CHECK_EQUAL(dist(ba::find_not(l1, l1.front())), l1.size());
}

BOOST_CXX14_CONSTEXPR bool ce_result = check_constexpr();
BOOST_CHECK(ce_result);
Expand Down