Home
last modified time | relevance | path

Searched refs:is_sorted (Results 1 – 25 of 88) sorted by relevance

1234

/third_party/boost/libs/compute/test/
Dtest_sort_by_key.cpp41 BOOST_CHECK(compute::is_sorted(keys.begin(), keys.end()) == true); in BOOST_AUTO_TEST_CASE()
42 BOOST_CHECK(compute::is_sorted(values.begin(), values.end()) == true); in BOOST_AUTO_TEST_CASE()
55 BOOST_CHECK(compute::is_sorted(keys.begin(), keys.end(), queue) == true); in BOOST_AUTO_TEST_CASE()
56 BOOST_CHECK(compute::is_sorted(values.begin(), values.end(), queue) == true); in BOOST_AUTO_TEST_CASE()
70 BOOST_CHECK(compute::is_sorted(keys.begin(), keys.end(), queue) == false); in BOOST_AUTO_TEST_CASE()
71 BOOST_CHECK(compute::is_sorted(values.begin(), values.end(), queue) == false); in BOOST_AUTO_TEST_CASE()
75 BOOST_CHECK(compute::is_sorted(keys.begin(), keys.end(), queue) == true); in BOOST_AUTO_TEST_CASE()
76 BOOST_CHECK(compute::is_sorted(values.begin(), values.end(), queue) == true); in BOOST_AUTO_TEST_CASE()
106 BOOST_CHECK(compute::is_sorted(keys.begin(), keys.end(), queue) == false); in BOOST_AUTO_TEST_CASE()
107 BOOST_CHECK(compute::is_sorted(values.begin(), values.end(), queue) == false); in BOOST_AUTO_TEST_CASE()
[all …]
Dtest_radix_sort.cpp44 BOOST_CHECK(boost::compute::is_sorted(vector.begin(), vector.end(), queue) == false); in BOOST_AUTO_TEST_CASE()
47 BOOST_CHECK(boost::compute::is_sorted(vector.begin(), vector.end(), queue) == true); in BOOST_AUTO_TEST_CASE()
62 BOOST_CHECK(boost::compute::is_sorted(vector.begin(), vector.end(), queue) == false); in BOOST_AUTO_TEST_CASE()
65 BOOST_CHECK(boost::compute::is_sorted(vector.begin(), vector.end(), queue) == true); in BOOST_AUTO_TEST_CASE()
80 BOOST_CHECK(boost::compute::is_sorted(vector.begin(), vector.end(), queue) == false); in BOOST_AUTO_TEST_CASE()
83 BOOST_CHECK(boost::compute::is_sorted(vector.begin(), vector.end(), queue) == true); in BOOST_AUTO_TEST_CASE()
98 BOOST_CHECK(boost::compute::is_sorted(vector.begin(), vector.end(), queue) == false); in BOOST_AUTO_TEST_CASE()
101 BOOST_CHECK(boost::compute::is_sorted(vector.begin(), vector.end(), queue) == true); in BOOST_AUTO_TEST_CASE()
114 BOOST_CHECK(boost::compute::is_sorted(vector.begin(), vector.end(), queue) == false); in BOOST_AUTO_TEST_CASE()
117 BOOST_CHECK(boost::compute::is_sorted(vector.begin(), vector.end(), queue) == true); in BOOST_AUTO_TEST_CASE()
[all …]
Dtest_is_sorted.cpp28 BOOST_CHECK(compute::is_sorted(vec.begin(), vec.end(), queue)); in BOOST_AUTO_TEST_CASE()
31 BOOST_CHECK(compute::is_sorted(vec.begin(), vec.end(), queue)); in BOOST_AUTO_TEST_CASE()
34 BOOST_CHECK(compute::is_sorted(vec.begin(), vec.end(), queue)); in BOOST_AUTO_TEST_CASE()
37 BOOST_CHECK(compute::is_sorted(vec.begin(), vec.end(), queue) == false); in BOOST_AUTO_TEST_CASE()
40 BOOST_CHECK(compute::is_sorted(vec.begin(), vec.end(), queue) == false); in BOOST_AUTO_TEST_CASE()
43 BOOST_CHECK(compute::is_sorted(vec.begin(), vec.end(), queue)); in BOOST_AUTO_TEST_CASE()
50 BOOST_CHECK(compute::is_sorted(vec.begin(), vec.end(), queue)); in BOOST_AUTO_TEST_CASE()
58 BOOST_CHECK(compute::is_sorted(vec.begin(), vec.end(), queue)); in BOOST_AUTO_TEST_CASE()
62 BOOST_CHECK(compute::is_sorted(vec.begin(), vec.end(), queue) == false); in BOOST_AUTO_TEST_CASE()
63 BOOST_CHECK(compute::is_sorted(vec.begin(), vec.end(), compute::greater<int>(), queue)); in BOOST_AUTO_TEST_CASE()
[all …]
Dtest_insertion_sort.cpp31 BOOST_CHECK(boost::compute::is_sorted(vector.begin(), vector.end(), queue) == false); in BOOST_AUTO_TEST_CASE()
34 BOOST_CHECK(boost::compute::is_sorted(vector.begin(), vector.end(), queue) == true); in BOOST_AUTO_TEST_CASE()
45 BOOST_CHECK(boost::compute::is_sorted(vector.begin(), vector.end(), queue) == false); in BOOST_AUTO_TEST_CASE()
48 BOOST_CHECK(boost::compute::is_sorted(vector.begin(), vector.end(), queue) == true); in BOOST_AUTO_TEST_CASE()
59 BOOST_CHECK(boost::compute::is_sorted(vector.begin(), vector.end(), queue) == false); in BOOST_AUTO_TEST_CASE()
62 BOOST_CHECK(boost::compute::is_sorted(vector.begin(), vector.end(), queue) == true); in BOOST_AUTO_TEST_CASE()
73 BOOST_CHECK(boost::compute::is_sorted(vector.begin(), vector.end(), queue) == false); in BOOST_AUTO_TEST_CASE()
76 BOOST_CHECK(boost::compute::is_sorted(vector.begin(), vector.end(), queue) == true); in BOOST_AUTO_TEST_CASE()
85 BOOST_CHECK(boost::compute::is_sorted(vector.begin(), vector.end(), queue) == false); in BOOST_AUTO_TEST_CASE()
88 BOOST_CHECK(boost::compute::is_sorted(vector.begin(), vector.end(), queue) == true); in BOOST_AUTO_TEST_CASE()
[all …]
Dtest_sort.cpp42 BOOST_CHECK(boost::compute::is_sorted(vec.begin(), vec.end(), queue) == true); in BOOST_AUTO_TEST_CASE()
47 BOOST_CHECK(boost::compute::is_sorted(vec.begin(), vec.end(), queue) == true); in BOOST_AUTO_TEST_CASE()
58 BOOST_CHECK(boost::compute::is_sorted(vec.begin(), vec.end(), queue) == false); in BOOST_AUTO_TEST_CASE()
64 BOOST_CHECK(boost::compute::is_sorted(vec.begin(), vec.end(), queue) == true); in BOOST_AUTO_TEST_CASE()
68 BOOST_CHECK(boost::compute::is_sorted(vec.begin(), vec.end(), queue) == true); in BOOST_AUTO_TEST_CASE()
86 BOOST_CHECK(boost::compute::is_sorted(vector.begin(), vector.end(), queue) == false); in BOOST_AUTO_TEST_CASE()
89 BOOST_CHECK(boost::compute::is_sorted(vector.begin(), vector.end(), queue) == true); in BOOST_AUTO_TEST_CASE()
100 BOOST_CHECK(boost::compute::is_sorted(vector.begin(), vector.end(), queue) == false); in BOOST_AUTO_TEST_CASE()
103 BOOST_CHECK(boost::compute::is_sorted(vector.begin(), vector.end(), queue) == true); in BOOST_AUTO_TEST_CASE()
114 BOOST_CHECK(boost::compute::is_sorted(vector.begin(), vector.end(), queue) == false); in BOOST_AUTO_TEST_CASE()
[all …]
Dtest_stable_sort_by_key.cpp32 BOOST_CHECK(compute::is_sorted(keys.begin(), keys.end(), queue)); in BOOST_AUTO_TEST_CASE()
33 BOOST_CHECK(compute::is_sorted(values.begin(), values.end(), queue)); in BOOST_AUTO_TEST_CASE()
39 BOOST_CHECK(compute::is_sorted(keys.begin(), keys.end())); in BOOST_AUTO_TEST_CASE()
40 BOOST_CHECK(compute::is_sorted(values.begin(), values.end())); in BOOST_AUTO_TEST_CASE()
51 BOOST_CHECK(compute::is_sorted(keys.begin(), keys.end(), queue)); in BOOST_AUTO_TEST_CASE()
52 BOOST_CHECK(compute::is_sorted(values.begin(), values.end(), queue)); in BOOST_AUTO_TEST_CASE()
56 BOOST_CHECK(compute::is_sorted(keys.begin(), keys.end(), queue)); in BOOST_AUTO_TEST_CASE()
57 BOOST_CHECK(compute::is_sorted(values.begin(), values.end(), queue)); in BOOST_AUTO_TEST_CASE()
68 BOOST_CHECK(!compute::is_sorted(keys.begin(), keys.end(), queue)); in BOOST_AUTO_TEST_CASE()
70 BOOST_CHECK(compute::is_sorted(keys.begin(), keys.end(), queue)); in BOOST_AUTO_TEST_CASE()
[all …]
Dtest_merge_sort_gpu.cpp44 BOOST_CHECK(boost::compute::is_sorted(vector.begin(), vector.end(), queue) == false); in BOOST_AUTO_TEST_CASE()
51 boost::compute::is_sorted(vector.begin(), vector.end(), less, queue) in BOOST_AUTO_TEST_CASE()
60 boost::compute::is_sorted(vector.begin(), vector.end(), greater, queue) in BOOST_AUTO_TEST_CASE()
83 BOOST_CHECK(!boost::compute::is_sorted(vector.begin(), vector.end(), queue)); in BOOST_AUTO_TEST_CASE()
90 boost::compute::is_sorted(vector.begin(), vector.end(), less, queue) in BOOST_AUTO_TEST_CASE()
98 boost::compute::is_sorted(vector.begin(), vector.end(), greater, queue) in BOOST_AUTO_TEST_CASE()
120 BOOST_CHECK(!boost::compute::is_sorted(vector.begin(), vector.end(), queue)); in BOOST_AUTO_TEST_CASE()
127 boost::compute::is_sorted(vector.begin(), vector.end(), less, queue) in BOOST_AUTO_TEST_CASE()
135 boost::compute::is_sorted(vector.begin(), vector.end(), greater, queue) in BOOST_AUTO_TEST_CASE()
158 BOOST_CHECK(!boost::compute::is_sorted(vector.begin(), vector.end(), queue)); in BOOST_AUTO_TEST_CASE()
[all …]
Dtest_radix_sort_by_key.cpp46 BOOST_CHECK(!compute::is_sorted(keys.begin(), keys.end(), queue)); in BOOST_AUTO_TEST_CASE()
48 BOOST_CHECK(compute::is_sorted(keys.begin(), keys.end(), queue)); in BOOST_AUTO_TEST_CASE()
76 !compute::is_sorted( in BOOST_AUTO_TEST_CASE()
84 compute::is_sorted( in BOOST_AUTO_TEST_CASE()
114 BOOST_CHECK(!compute::is_sorted(keys.begin(), keys.end(), queue)); in BOOST_AUTO_TEST_CASE()
116 BOOST_CHECK(compute::is_sorted(keys.begin(), keys.end(), queue)); in BOOST_AUTO_TEST_CASE()
144 !compute::is_sorted( in BOOST_AUTO_TEST_CASE()
152 compute::is_sorted( in BOOST_AUTO_TEST_CASE()
183 BOOST_CHECK(!compute::is_sorted(keys.begin(), keys.end(), queue)); in BOOST_AUTO_TEST_CASE()
185 BOOST_CHECK(compute::is_sorted(keys.begin(), keys.end(), queue)); in BOOST_AUTO_TEST_CASE()
[all …]
Dtest_stable_sort.cpp30 BOOST_CHECK(compute::is_sorted(vector.begin(), vector.end(), queue) == false); in BOOST_AUTO_TEST_CASE()
33 BOOST_CHECK(compute::is_sorted(vector.begin(), vector.end(), queue) == true); in BOOST_AUTO_TEST_CASE()
59 BOOST_CHECK(compute::is_sorted(vec.begin(), vec.end(), compare_first, queue) == false); in BOOST_AUTO_TEST_CASE()
65 BOOST_CHECK(compute::is_sorted(vec.begin(), vec.end(), compare_first, queue) == true); in BOOST_AUTO_TEST_CASE()
/third_party/boost/libs/range/test/algorithm_ext_test/
Dis_sorted.cpp30 BOOST_CHECK( boost::is_sorted(ascending) ); in test_is_sorted_impl()
31 BOOST_CHECK( boost::is_sorted(ascending, std::less<std::size_t>()) ); in test_is_sorted_impl()
32 BOOST_CHECK( boost::is_sorted(ascending, std::greater<std::size_t>()) ); in test_is_sorted_impl()
40 BOOST_CHECK( boost::is_sorted(ascending) ); in test_is_sorted_impl()
41 BOOST_CHECK( !boost::is_sorted(descending) ); in test_is_sorted_impl()
42 BOOST_CHECK( !boost::is_sorted(ascending, std::greater<std::size_t>()) ); in test_is_sorted_impl()
43 BOOST_CHECK( boost::is_sorted(descending, std::greater<std::size_t>()) ); in test_is_sorted_impl()
/third_party/boost/libs/algorithm/doc/
Dordered-hpp.qbk2 [section:is_sorted is_sorted ]
15 The header file `<boost/algorithm/cxx11/is_sorted.hpp>` contains functions for determining if a seq…
17 [heading is_sorted]
18 The function `is_sorted(sequence)` determines whether or not a sequence is completely sorted accord…
23 bool is_sorted ( ForwardIterator first, ForwardIterator last, Pred p );
26 bool is_sorted ( ForwardIterator first, ForwardIterator last );
30 bool is_sorted ( const Range &r, Pred p );
33 bool is_sorted ( const Range &r );
37 Iterator requirements: The `is_sorted` functions will work forward iterators or better.
41 If `distance(first, last) < 2`, then `is_sorted ( first, last )` returns `last`. Otherwise, it retu…
[all …]
/third_party/boost/boost/algorithm/cxx11/
Dis_sorted.hpp73 BOOST_CXX14_CONSTEXPR bool is_sorted ( ForwardIterator first, ForwardIterator last, Pred p ) in is_sorted() function
85 BOOST_CXX14_CONSTEXPR bool is_sorted ( ForwardIterator first, ForwardIterator last ) in is_sorted() function
131 is_sorted ( const R &range, Pred p ) in is_sorted() function
133 return boost::algorithm::is_sorted ( boost::begin ( range ), boost::end ( range ), p ); in is_sorted()
143 BOOST_CXX14_CONSTEXPR bool is_sorted ( const R &range ) in is_sorted() function
145 return boost::algorithm::is_sorted ( boost::begin ( range ), boost::end ( range )); in is_sorted()
166 return boost::algorithm::is_sorted (first, last, std::less<value_type>()); in is_increasing()
199 return boost::algorithm::is_sorted (first, last, std::greater<value_type>()); in is_decreasing()
231 return boost::algorithm::is_sorted (first, last, std::less_equal<value_type>()); in is_strictly_increasing()
262 return boost::algorithm::is_sorted (first, last, std::greater_equal<value_type>()); in is_strictly_decreasing()
/third_party/boost/boost/range/algorithm_ext/
Dis_sorted.hpp32 inline bool is_sorted(const SinglePassRange& rng) in is_sorted() function
37 return ::boost::detail::is_sorted(boost::begin(rng), boost::end(rng)); in is_sorted()
42 inline bool is_sorted(const SinglePassRange& rng, BinaryPredicate pred) in is_sorted() function
48 return ::boost::detail::is_sorted(boost::begin(rng), boost::end(rng), pred); in is_sorted()
53 using range::is_sorted;
/third_party/boost/libs/range/doc/reference/algorithm_ext/
Dis_sorted.qbk6 [section:is_sorted is_sorted]
12 bool is_sorted(const SinglePassRange& rng);
15 bool is_sorted(const SinglePassRange& rng, BinaryPredicate pred);
20 `is_sorted` determines if a range is sorted.
28 Defined in the header file `boost/range/algorithm_ext/is_sorted.hpp`
/third_party/boost/boost/accumulators/statistics/
Dtail.hpp163 : is_sorted(false) in tail_impl()
171 : is_sorted(that.is_sorted) in tail_impl()
207 if(!this->is_sorted) in result()
214 this->is_sorted = true; in result()
243 this->is_sorted = false; in assign()
276 ar & is_sorted; in serialize() local
282 mutable bool is_sorted; member
/third_party/boost/libs/algorithm/test/
Dordered_test.cpp44 BOOST_CHECK ( ba::is_sorted (b_e(strictlyIncreasingValues))); in test_ordered()
45 BOOST_CHECK ( !ba::is_sorted (b_e(randomValues))); in test_ordered()
46 BOOST_CHECK ( ba::is_sorted (b_e(strictlyIncreasingValues), std::less<int>())); in test_ordered()
47 BOOST_CHECK ( !ba::is_sorted (b_e(strictlyIncreasingValues), std::greater<int>())); in test_ordered()
50 BOOST_CHECK ( ba::is_sorted (a_range(strictlyIncreasingValues))); in test_ordered()
51 BOOST_CHECK ( !ba::is_sorted (a_range(randomValues))); in test_ordered()
52 BOOST_CHECK ( ba::is_sorted (a_range(strictlyIncreasingValues), std::less<int>())); in test_ordered()
53 BOOST_CHECK ( !ba::is_sorted (a_range(strictlyIncreasingValues), std::greater<int>())); in test_ordered()
81 … ba::is_sorted ( boost::begin(strictlyIncreasingValues), boost::end(strictlyIncreasingValues) ) in test_ordered()
82 && !ba::is_sorted (a_range(randomValues)) in test_ordered()
/third_party/boost/libs/compute/include/boost/compute/algorithm/
Dis_sorted.hpp40 inline bool is_sorted(InputIterator first, in is_sorted() function
56 inline bool is_sorted(InputIterator first, in is_sorted() function
63 return ::boost::compute::is_sorted( in is_sorted()
/third_party/boost/boost/compute/algorithm/
Dis_sorted.hpp40 inline bool is_sorted(InputIterator first, in is_sorted() function
56 inline bool is_sorted(InputIterator first, in is_sorted() function
63 return ::boost::compute::is_sorted( in is_sorted()
/third_party/boost/boost/move/algo/detail/
Dadaptive_sort_merge.hpp94 bool is_sorted(::order_perf_type *first, ::order_perf_type *last, ::order_type_less) in is_sorted() function
347 BOOST_MOVE_ADAPTIVE_SORT_INVARIANT(boost::movelib::is_sorted(f, f+l_block, comp)); in merge_blocks_bufferless()
348 …BOOST_MOVE_ADAPTIVE_SORT_INVARIANT(boost::movelib::is_sorted(first_min, first_min + l_block, comp)… in merge_blocks_bufferless()
352 …BOOST_MOVE_ADAPTIVE_SORT_INVARIANT(boost::movelib::is_sorted(first+l_irreg1+n_bef_irreg2*l_block, … in merge_blocks_bufferless()
364 BOOST_MOVE_ADAPTIVE_SORT_INVARIANT(boost::movelib::is_sorted(first, first1, comp)); in merge_blocks_bufferless()
368 BOOST_MOVE_ADAPTIVE_SORT_INVARIANT(boost::movelib::is_sorted(first, last_irr2, comp)); in merge_blocks_bufferless()
627 …BOOST_MOVE_ADAPTIVE_SORT_INVARIANT(boost::movelib::is_sorted(first, last, boost::movelib::unantist… in stable_merge()
948 BOOST_MOVE_ADAPTIVE_SORT_INVARIANT(boost::movelib::is_sorted(first_reg, last_reg, comp)); in op_merge_blocks_with_irreg()
949 …BOOST_MOVE_ADAPTIVE_SORT_INVARIANT(!next_key_idx || boost::movelib::is_sorted(first_min, last_min,… in op_merge_blocks_with_irreg()
955 BOOST_MOVE_ADAPTIVE_SORT_INVARIANT(boost::movelib::is_sorted(orig_dest, dest, comp)); in op_merge_blocks_with_irreg()
[all …]
/third_party/boost/libs/multi_index/test/
Dtest_list_ops.cpp51 bool is_sorted( in is_sorted() function
127 BOOST_TEST(is_sorted(si,std::less<int>())); in test_list_ops_unique_seq()
128 BOOST_TEST(is_sorted(si2,std::less<int>())); in test_list_ops_unique_seq()
131 BOOST_TEST(is_sorted(si,std::less<int>())); in test_list_ops_unique_seq()
147 BOOST_TEST(is_sorted(si,std::greater<int>())); in test_list_ops_unique_seq()
/third_party/boost/boost/detail/
Dis_sorted.hpp42 inline bool is_sorted (Iterator first, Iterator last, Comp c) { in is_sorted() function
47 inline bool is_sorted (Iterator first, Iterator last) { in is_sorted() function
/third_party/boost/libs/sort/test/
Dtest_pdqsort.cpp125 std::is_sorted(u32l.begin(), u32l.end(), u32less), in execute_test()
130 std::is_sorted(u32g.begin(), u32g.end(), u32greater), in execute_test()
135 std::is_sorted(sl.begin(), sl.end(), sless), in execute_test()
140 std::is_sorted(sg.begin(), sg.end(), sgreater), in execute_test()
/third_party/glib/tests/
Dthreadpool-test.c208 gboolean is_sorted; in test_thread_sort_entry_func() local
213 is_sorted = GPOINTER_TO_INT (user_data); in test_thread_sort_entry_func()
216 is_sorted ? "[ sorted]" : "[unsorted]", in test_thread_sort_entry_func()
219 if (is_sorted) { in test_thread_sort_entry_func()
/third_party/boost/libs/compute/perf/
Dperf_sort_by_key.cpp68 if(!boost::compute::is_sorted(device_keys.begin(), device_keys.end(), queue)){ in main()
73 if(!boost::compute::is_sorted(device_values.begin(), device_values.end(), queue)){ in main()
/third_party/boost/libs/sort/example/
Dparallelint.cpp26 bool is_sorted(const std::vector<DATA_TYPE> &array) { in is_sorted() function
46 if (!is_sorted(array)) { in sort_loop()

1234