/ndk/tests/device/test-stlport/unit/ |
D | heap_test.cpp | 39 make_heap(numbers, numbers + 6); in mkheap0() 57 make_heap(numbers, numbers + 6, greater<int>()); in mkheap1() 78 make_heap(v.begin(), v.end()); in pheap1() 97 make_heap(v.begin(), v.end(), greater<int>()); in pheap2()
|
/ndk/tests/device/test-gnustl-full/unit/ |
D | heap_test.cpp | 39 make_heap(numbers, numbers + 6); in mkheap0() 57 make_heap(numbers, numbers + 6, greater<int>()); in mkheap1() 78 make_heap(v.begin(), v.end()); in pheap1() 97 make_heap(v.begin(), v.end(), greater<int>()); in pheap2()
|
/ndk/sources/cxx-stl/stlport/stlport/stl/ |
D | _queue.h | 174 { make_heap(c.begin(), c.end(), comp); } in _STLP_RELOPS_OPERATORS() 185 : c(__first, __last) { make_heap(c.begin(), c.end(), comp); } in _STLP_RELOPS_OPERATORS() 191 { make_heap(c.begin(), c.end(), comp); } in _STLP_RELOPS_OPERATORS() 199 make_heap(c.begin(), c.end(), comp); in _STLP_RELOPS_OPERATORS() 204 : c(__first, __last) { make_heap(c.begin(), c.end(), comp); } in _STLP_RELOPS_OPERATORS() 209 { make_heap(c.begin(), c.end(), comp); } in _STLP_RELOPS_OPERATORS() 216 make_heap(c.begin(), c.end(), comp); in _STLP_RELOPS_OPERATORS()
|
D | _heap.h | 90 make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last); 94 make_heap(_RandomAccessIterator __first,
|
D | _heap.c | 206 make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) in make_heap() function 233 make_heap(_RandomAccessIterator __first, in make_heap() function
|
D | _algo.c | 1222 make_heap(__first, __middle, __comp); in __partial_sort() 1268 make_heap(__result_first, __result_real_last, __comp); in __partial_sort_copy()
|
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.heap.operations/make.heap/ |
D | make_heap_comp.pass.cpp | 38 std::make_heap(ia, ia+N, std::greater<int>()); in test() 59 std::make_heap(ia, ia+N, indirect_less()); in main()
|
D | make_heap.pass.cpp | 26 std::make_heap(ia, ia+N); in test()
|
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.heap.operations/sort.heap/ |
D | sort_heap_comp.pass.cpp | 38 std::make_heap(ia, ia+N, std::greater<int>()); in test() 60 std::make_heap(ia, ia+N, indirect_less()); in main()
|
D | sort_heap.pass.cpp | 26 std::make_heap(ia, ia+N); in test()
|
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.heap.operations/pop.heap/ |
D | pop_heap_comp.pass.cpp | 38 std::make_heap(ia, ia+N, std::greater<int>()); in test() 59 std::make_heap(ia, ia+N, indirect_less()); in main()
|
D | pop_heap.pass.cpp | 26 std::make_heap(ia, ia+N); in test()
|
/ndk/sources/cxx-stl/llvm-libc++/libcxx/include/ |
D | queue | 505 _VSTD::make_heap(c.begin(), c.end(), comp); 517 _VSTD::make_heap(c.begin(), c.end(), comp); 530 _VSTD::make_heap(c.begin(), c.end(), comp); 543 _VSTD::make_heap(c.begin(), c.end(), comp); 558 _VSTD::make_heap(c.begin(), c.end(), comp); 596 _VSTD::make_heap(c.begin(), c.end(), comp); 609 _VSTD::make_heap(c.begin(), c.end(), comp); 625 _VSTD::make_heap(c.begin(), c.end(), comp); 638 _VSTD::make_heap(c.begin(), c.end(), comp);
|
D | algorithm | 492 make_heap(RandomAccessIterator first, RandomAccessIterator last); 496 make_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 4915 // make_heap 4935 make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 4950 make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 4952 …_VSTD::make_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_ty…
|
/ndk/tests/device/test-libc++-static-full/jni/ |
D | Android.mk | 222 $(call gen-test, algorithms/alg.sorting/alg.heap.operations/make.heap/make_heap)
|
/ndk/tests/device/test-libc++-shared-full/jni/ |
D | Android.mk | 231 $(call gen-test, algorithms/alg.sorting/alg.heap.operations/make.heap/make_heap)
|