Searched refs:is_partitioned_until (Results 1 – 5 of 5) sorted by relevance
| /third_party/boost/libs/algorithm/doc/ |
| D | is_partitioned_until.qbk | 1 [/ File is_partitioned_until.qbk]
3 [section:is_partitioned_until is_partitioned_until ]
12 The header file 'is_partitioned_until.hpp' contains two variants of a single algorithm, `is_partiti…
14 The routine `is_partitioned_until` takes a sequence and a predicate. It returns the last iterator '…
16 `is_partitioned_until` come in two forms; the first one takes two iterators to define the range. Th…
21 The function `is_partitioned_until` returns the last iterator 'it' in the sequence [begin, end) for…
25 InputIterator is_partitioned_until ( InputIterator first, InputIterator last, Predicate p );
27 …typename boost::range_iterator<const Range>::type is_partitioned_until ( const Range &r, Predicate…
37 is_partitioned_until ( c, isOdd ) --> iterator to '1'
38 is_partitioned_until ( c, lessThan10 ) --> end
[all …]
|
| D | algorithm.qbk | 199 [include is_partitioned_until.qbk]
|
| /third_party/boost/libs/algorithm/test/ |
| D | is_partitioned_until_test.cpp | 45 BOOST_CHECK ( ba::is_partitioned_until ( v, less_than<int>(3)) == v.end()); // no elements in test_sequence1()
46 …BOOST_CHECK ( ba::is_partitioned_until ( v, less_than<int>(6)) == v.end()); // only the first… in test_sequence1()
47 …BOOST_CHECK ( ba::is_partitioned_until ( v, less_than<int>(10)) == v.end()); // in the middle some… in test_sequence1()
48 …BOOST_CHECK ( ba::is_partitioned_until ( v, less_than<int>(99)) == v.end()); // all elements satis… in test_sequence1()
53 …BOOST_CHECK ( ba::is_partitioned_until ( l.begin (), l.end (), less_than<int>(3)) == l.end()); … in test_sequence1()
54 …BOOST_CHECK ( ba::is_partitioned_until ( l.begin (), l.end (), less_than<int>(6)) == l.end()); … in test_sequence1()
55 …BOOST_CHECK ( ba::is_partitioned_until ( l.begin (), l.end (), less_than<int>(10)) == l.end()); /… in test_sequence1()
56 …BOOST_CHECK ( ba::is_partitioned_until ( l.begin (), l.end (), less_than<int>(99)) == l.end()); … in test_sequence1()
|
| /third_party/boost/boost/algorithm/ |
| D | is_partitioned_until.hpp | 33 InputIterator is_partitioned_until ( InputIterator first, InputIterator last, UnaryPredicate p ) in is_partitioned_until() function
57 typename boost::range_iterator<const Range>::type is_partitioned_until ( const Range &r, UnaryPredi… in is_partitioned_until() function
59 return boost::algorithm::is_partitioned_until (boost::begin(r), boost::end(r), p); in is_partitioned_until()
|
| /third_party/boost/libs/algorithm/example/ |
| D | is_partitioned_until_example.cpp | 39 auto it1 = ba::is_partitioned_until(good.begin(), good.end(), isOdd); in main()
50 auto it2 = ba::is_partitioned_until(good.begin(), good.end(), isOddComp()); in main()
60 auto it3 = ba::is_partitioned_until(bad, isOdd); in main()
|