afb81b8278
Some checks failed
Docker. / Ubuntu (push) Has been cancelled
User-agent updater. / User-agent (push) Failing after 15s
Lock Threads / lock (push) Failing after 10s
Waiting for answer. / waiting-for-answer (push) Failing after 22s
Needs user action. / needs-user-action (push) Failing after 8s
Can't reproduce. / cant-reproduce (push) Failing after 8s
Close stale issues and PRs / stale (push) Has been cancelled
119 lines
2.3 KiB
C++
119 lines
2.3 KiB
C++
// Range v3 library
|
|
//
|
|
// Copyright Jeff Garland 2017
|
|
//
|
|
// 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)
|
|
//
|
|
// Project home: https://github.com/ericniebler/range-v3
|
|
//
|
|
|
|
///[find]
|
|
// vector: *i: 6
|
|
// didn't find 10
|
|
// *i: 6
|
|
// *i: 2
|
|
// *i after ++ (2 expected): 2
|
|
// array: *i: 6
|
|
// list: *i: 6
|
|
// fwd_list: *i: 4
|
|
// deque: *i: 6
|
|
|
|
#include <array>
|
|
#include <deque>
|
|
#include <forward_list>
|
|
#include <iostream>
|
|
#include <list>
|
|
#include <range/v3/all.hpp>
|
|
#include <vector>
|
|
using std::cout;
|
|
|
|
auto is_six = [](int i) -> bool { return i == 6; };
|
|
|
|
int
|
|
main()
|
|
{
|
|
cout << "vector: ";
|
|
|
|
std::vector<int> v{6, 2, 6, 4, 6, 1};
|
|
{
|
|
auto i = ranges::find(v, 6); // 1 2 3 4 5 6
|
|
cout << "*i: " << *i << '\n';
|
|
}
|
|
{
|
|
auto i = ranges::find(v, 10); // 1 2 3 4 5 6
|
|
if(i == ranges::end(v))
|
|
{
|
|
cout << "didn't find 10\n";
|
|
}
|
|
}
|
|
{
|
|
auto i = ranges::find_if(v, is_six);
|
|
if(i != ranges::end(v))
|
|
{
|
|
cout << "*i: " << *i << '\n';
|
|
}
|
|
}
|
|
{
|
|
auto i = ranges::find_if_not(v, is_six);
|
|
if(i != ranges::end(v))
|
|
{
|
|
cout << "*i: " << *i << '\n';
|
|
}
|
|
}
|
|
{
|
|
auto i = ranges::find(v, 6);
|
|
i++;
|
|
if(i != ranges::end(v))
|
|
{
|
|
cout << "*i after ++ (2 expected): " << *i;
|
|
}
|
|
}
|
|
|
|
cout << "\narray: ";
|
|
|
|
std::array<int, 6> a{6, 2, 3, 4, 5, 1};
|
|
{
|
|
auto i = ranges::find(a, 6);
|
|
if(i != ranges::end(a))
|
|
{
|
|
cout << "*i: " << *i;
|
|
}
|
|
}
|
|
cout << "\nlist: ";
|
|
|
|
std::list<int> li{6, 2, 3, 4, 5, 1};
|
|
{
|
|
auto i = ranges::find(li, 6);
|
|
if(i != ranges::end(li))
|
|
{
|
|
cout << "*i: " << *i;
|
|
}
|
|
}
|
|
|
|
cout << "\nfwd_list: ";
|
|
|
|
std::forward_list<int> fl{6, 2, 3, 4, 5, 1};
|
|
{
|
|
auto i = ranges::find(fl, 4);
|
|
if(i != ranges::end(fl))
|
|
{
|
|
cout << "*i: " << *i;
|
|
}
|
|
}
|
|
cout << "\ndeque: ";
|
|
|
|
std::deque<int> d{6, 2, 3, 4, 5, 1};
|
|
{
|
|
auto i = ranges::find(d, 6);
|
|
if(i != ranges::end(d))
|
|
{
|
|
cout << "*i: " << *i;
|
|
}
|
|
}
|
|
cout << '\n';
|
|
}
|
|
///[find]
|