Home
last modified time | relevance | path

Searched refs:pop_heap (Results 1 – 11 of 11) sorted by relevance

/ndk/tests/device/test-stlport/unit/
Dheap_test.cpp41 pop_heap(numbers, numbers + 6); in mkheap0()
43 pop_heap(numbers, numbers + 5); in mkheap0()
45 pop_heap(numbers, numbers + 4); in mkheap0()
47 pop_heap(numbers, numbers + 3); in mkheap0()
49 pop_heap(numbers, numbers + 2); in mkheap0()
51 pop_heap(numbers, numbers + 1); in mkheap0()
60 pop_heap(numbers, numbers + 6, greater<int>()); in mkheap1()
62 pop_heap(numbers, numbers + 5, greater<int>()); in mkheap1()
64 pop_heap(numbers, numbers + 4, greater<int>()); in mkheap1()
66 pop_heap(numbers, numbers + 3, greater<int>()); in mkheap1()
[all …]
/ndk/tests/device/test-gnustl-full/unit/
Dheap_test.cpp41 pop_heap(numbers, numbers + 6); in mkheap0()
43 pop_heap(numbers, numbers + 5); in mkheap0()
45 pop_heap(numbers, numbers + 4); in mkheap0()
47 pop_heap(numbers, numbers + 3); in mkheap0()
49 pop_heap(numbers, numbers + 2); in mkheap0()
51 pop_heap(numbers, numbers + 1); in mkheap0()
60 pop_heap(numbers, numbers + 6, greater<int>()); in mkheap1()
62 pop_heap(numbers, numbers + 5, greater<int>()); in mkheap1()
64 pop_heap(numbers, numbers + 4, greater<int>()); in mkheap1()
66 pop_heap(numbers, numbers + 3, greater<int>()); in mkheap1()
[all …]
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.heap.operations/pop.heap/
Dpop_heap_comp.pass.cpp41 std::pop_heap(ia, ia+i, std::greater<int>()); in test()
44 std::pop_heap(ia, ia, std::greater<int>()); in test()
62 std::pop_heap(ia, ia+i, indirect_less()); in main()
Dpop_heap.pass.cpp29 std::pop_heap(ia, ia+i); in test()
32 std::pop_heap(ia, ia); in test()
/ndk/sources/cxx-stl/stlport/stlport/stl/
D_heap.h62 void pop_heap(_RandomAccessIterator __first,
85 pop_heap(_RandomAccessIterator __first,
102 pop_heap(__first, __last--); in sort_heap()
112 pop_heap(__first, __last--, __comp); in sort_heap()
D_heap.c138 void pop_heap(_RandomAccessIterator __first, in pop_heap() function
181 pop_heap(_RandomAccessIterator __first, in pop_heap() function
D_queue.h232 pop_heap(c.begin(), c.end(), comp); in _STLP_RELOPS_OPERATORS()
/ndk/sources/cxx-stl/llvm-libc++/libcxx/include/
Dqueue683 _VSTD::pop_heap(c.begin(), c.end(), comp);
Dalgorithm484 pop_heap(RandomAccessIterator first, RandomAccessIterator last);
488 pop_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp);
4877 // pop_heap
4895 pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp)
4910 pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last)
4912 …_VSTD::pop_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_typ…
/ndk/tests/device/test-libc++-static-full/jni/
DAndroid.mk225 $(call gen-test, algorithms/alg.sorting/alg.heap.operations/pop.heap/pop_heap)
/ndk/tests/device/test-libc++-shared-full/jni/
DAndroid.mk234 $(call gen-test, algorithms/alg.sorting/alg.heap.operations/pop.heap/pop_heap)