| /external/libcxx/test/std/algorithms/alg.nonmodifying/alg.is_permutation/ |
| D | is_permutation.pass.cpp | 30 return !std::is_permutation(std::begin(ia), std::end(ia), std::begin(ib)) in test_constexpr()
31 && !std::is_permutation(std::begin(ia), std::end(ia), std::begin(ib), std::end(ib)) in test_constexpr()
32 && std::is_permutation(std::begin(ib), std::end(ib), std::begin(ic)) in test_constexpr()
33 && std::is_permutation(std::begin(ib), std::end(ib), std::begin(ic), std::end(ic)) in test_constexpr()
34 && !std::is_permutation(std::begin(ic), std::end(ic), std::begin(id), std::end(id)) in test_constexpr()
45 assert(std::is_permutation(forward_iterator<const int*>(ia), in main()
49 assert(std::is_permutation(forward_iterator<const int*>(ia), in main()
54 assert(std::is_permutation(forward_iterator<const int*>(ia), in main()
58 assert(std::is_permutation(forward_iterator<const int*>(ia), in main()
62 assert(std::is_permutation(forward_iterator<const int*>(ia), in main()
[all …]
|
| D | is_permutation_pred.pass.cpp | 38 return !std::is_permutation(std::begin(ia), std::end(ia), std::begin(ib) , c) in test_constexpr()
39 && !std::is_permutation(std::begin(ia), std::end(ia), std::begin(ib), std::end(ib), c) in test_constexpr()
40 && std::is_permutation(std::begin(ib), std::end(ib), std::begin(ic) , c) in test_constexpr()
41 && std::is_permutation(std::begin(ib), std::end(ib), std::begin(ic), std::end(ic), c) in test_constexpr()
42 && !std::is_permutation(std::begin(ic), std::end(ic), std::begin(id), std::end(id), c) in test_constexpr()
65 assert(std::is_permutation(forward_iterator<const int*>(ia), in main()
69 assert(std::is_permutation(forward_iterator<const int*>(ia), in main()
74 assert(std::is_permutation(forward_iterator<const int*>(ia), in main()
79 assert(std::is_permutation(forward_iterator<const int*>(ia), in main()
90 assert(std::is_permutation(forward_iterator<const int*>(ia), in main()
[all …]
|
| /external/libcxx/test/std/algorithms/alg.modifying.operations/alg.random.shuffle/ |
| D | random_shuffle.pass.cpp | 31 assert(std::is_permutation(ia, ia+sa, ia1)); in main()
34 assert(std::is_permutation(ia, ia+sa, ia2)); in main()
|
| D | random_shuffle_urng.pass.cpp | 31 assert(std::is_permutation(ia, ia+sa, ia1)); in main()
34 assert(std::is_permutation(ia, ia+sa, ia2)); in main()
|
| D | random_shuffle_rand.pass.cpp | 41 assert(std::is_permutation(ia, ia+sa, ia1)); in main()
|
| /external/libcxx/fuzzing/ |
| D | fuzzing.cpp | 114 bool is_permutation(SVIter first1, SVIter last1, SVIter first2) in is_permutation() function
142 bool is_permutation(Iter1 first1, Iter1 last1, Iter2 first2) in is_permutation() function
170 if (!fuzzing::is_permutation(data, data + size, working.cbegin())) return 99; in sort()
192 if (!fuzzing::is_permutation(input.cbegin(), input.cend(), working.cbegin())) return 99; in stable_sort()
204 if (!fuzzing::is_permutation(data, data + size, working.cbegin())) return 99; in partition()
260 if (!fuzzing::is_permutation(input.cbegin(), input.cend(), working.cbegin())) return 99; in stable_partition()
286 if (!fuzzing::is_permutation(data + 1, data + size, working.cbegin())) return 99; in nth_element()
311 if (!fuzzing::is_permutation(data + 1, data + size, working.cbegin())) return 99; in partial_sort()
510 if (!fuzzing::is_permutation(data, data + size, working.cbegin())) return 99; in make_heap()
531 if (!fuzzing::is_permutation(data, data + size, working.cbegin())) return 99; in push_heap()
|
| /external/angle/third_party/spirv-tools/src/source/opt/ |
| D | decoration_manager.h | 166 if (!std::is_permutation(lhs.direct_decorations.begin(),
171 if (!std::is_permutation(lhs.indirect_decorations.begin(),
176 if (!std::is_permutation(lhs.decorate_insts.begin(),
|
| /external/swiftshader/third_party/SPIRV-Tools/source/opt/ |
| D | decoration_manager.h | 166 if (!std::is_permutation(lhs.direct_decorations.begin(),
171 if (!std::is_permutation(lhs.indirect_decorations.begin(),
176 if (!std::is_permutation(lhs.decorate_insts.begin(),
|
| /external/deqp-deps/SPIRV-Tools/source/opt/ |
| D | decoration_manager.h | 166 if (!std::is_permutation(lhs.direct_decorations.begin(),
171 if (!std::is_permutation(lhs.indirect_decorations.begin(),
176 if (!std::is_permutation(lhs.decorate_insts.begin(),
|
| /external/libcxx/test/std/containers/sequences/list/list.ops/ |
| D | sort_comp.pass.cpp | 65 assert((std::is_permutation(c1.begin(), c1.end(), a1))); in main()
|
| /external/libcxx/test/std/containers/unord/unord.set/ |
| D | erase_if.pass.cpp | 41 assert((std::is_permutation(s.begin(), s.end(), e.begin(), e.end()))); in test0()
|
| /external/libcxx/test/std/containers/unord/unord.map/ |
| D | erase_if.pass.cpp | 40 assert((std::is_permutation(s.begin(), s.end(), e.begin(), e.end()))); in test0()
|
| /external/libcxx/test/std/containers/unord/unord.multiset/ |
| D | erase_if.pass.cpp | 41 assert((std::is_permutation(s.begin(), s.end(), e.begin(), e.end()))); in test0()
|
| /external/libcxx/test/std/containers/unord/unord.multimap/ |
| D | erase_if.pass.cpp | 40 assert((std::is_permutation(s.begin(), s.end(), e.begin(), e.end()))); in test0()
|
| /external/libcxx/test/std/algorithms/alg.modifying.operations/alg.random.sample/ |
| D | sample.pass.cpp | 136 assert(std::is_permutation(oa, end.base(), oa1)); in test_small_population()
|
| /external/catch2/include/internal/ |
| D | catch_matchers_vector.h | 139 return std::is_permutation(m_target.begin(), m_target.end(), vec.begin()); in match()
|
| /external/libcxx/test/std/containers/unord/unord.set/unord.set.cnstr/ |
| D | assign_copy.pass.cpp | 94 assert(std::is_permutation(c.begin(), c.end(), a)); in main()
|
| /external/libcxx/test/std/containers/unord/unord.multiset/unord.multiset.cnstr/ |
| D | assign_copy.pass.cpp | 103 assert(std::is_permutation(c.begin(), c.end(), a)); in main()
|
| /external/libcxx/test/std/containers/unord/unord.map/unord.map.cnstr/ |
| D | assign_copy.pass.cpp | 95 assert(std::is_permutation(c.begin(), c.end(), a)); in main()
|
| /external/libcxx/test/std/containers/unord/unord.multimap/unord.multimap.cnstr/ |
| D | assign_copy.pass.cpp | 109 assert(std::is_permutation(c.begin(), c.end(), a)); in main()
|
| /external/tensorflow/tensorflow/core/framework/ |
| D | op_gen_lib.cc | 418 if (!std::is_permutation(new_api_def.arg_order().begin(), in MergeApiDefs()
|
| /external/libcxx/include/ |
| D | algorithm | 132 is_permutation(ForwardIterator1 first1, ForwardIterator1 last1,
137 is_permutation(ForwardIterator1 first1, ForwardIterator1 last1,
142 is_permutation(ForwardIterator1 first1, ForwardIterator1 last1,
147 is_permutation(ForwardIterator1 first1, ForwardIterator1 last1,
1288 // is_permutation
1292 is_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1,
1340 is_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1,
1345 return _VSTD::is_permutation(__first1, __last1, __first2, __equal_to<__v1, __v2>());
1411 return _VSTD::is_permutation<_RandomAccessIterator1, _RandomAccessIterator2,
1419 is_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1,
[all …]
|
| /external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/Support/ |
| D | GenericDomTreeConstruction.h | 706 !std::is_permutation(DT.Roots.begin(), DT.Roots.end(), Roots.begin())) { in UpdateRootsAfterUpdate()
1334 !std::is_permutation(DT.Roots.begin(), DT.Roots.end(), in verifyRoots()
|
| D | GenericDomTree.h | 324 if (!std::is_permutation(Roots.begin(), Roots.end(), Other.Roots.begin()))
|
| /external/libcxx/include/ext/ |
| D | hash_set | 645 !_VSTD::is_permutation(__xeq.first, __xeq.second, __yeq.first))
|