| /external/stlport/test/unit/ |
| H A D | heap_test.cpp | 41 pop_heap(numbers, numbers + 6);
43 pop_heap(numbers, numbers + 5);
45 pop_heap(numbers, numbers + 4);
47 pop_heap(numbers, numbers + 3);
49 pop_heap(numbers, numbers + 2);
51 pop_heap(numbers, numbers + 1);
60 pop_heap(numbers, numbers + 6, greater<int>());
62 pop_heap(numbers, numbers + 5, greater<int>());
64 pop_heap(numbers, numbers + 4, greater<int>());
66 pop_heap(number
[all...] |
| /external/libcxx/test/algorithms/alg.sorting/alg.heap.operations/pop.heap/ |
| H A D | pop_heap.pass.cpp | 15 // pop_heap(Iter first, Iter last);
29 std::pop_heap(ia, ia+i);
32 std::pop_heap(ia, ia);
|
| H A D | Android.mk | 19 test_name := algorithms/alg.sorting/alg.heap.operations/pop.heap/pop_heap
20 test_src := pop_heap.pass.cpp
|
| H A D | pop_heap_comp.pass.cpp | 15 // pop_heap(Iter first, Iter last, Compare comp);
41 std::pop_heap(ia, ia+i, std::greater<int>());
44 std::pop_heap(ia, ia, std::greater<int>());
62 std::pop_heap(ia, ia+i, indirect_less());
|
| /external/stlport/stlport/stl/ |
| H A D | _heap.h | 35 // Heap-manipulation functions: push_heap, pop_heap, make_heap, sort_heap.
62 void pop_heap(_RandomAccessIterator __first,
85 pop_heap(_RandomAccessIterator __first,
102 pop_heap(__first, __last--);
112 pop_heap(__first, __last--, __comp);
|
| H A D | _heap.c | 138 void pop_heap(_RandomAccessIterator __first, function
181 pop_heap(_RandomAccessIterator __first, function
|
| H A D | _queue.h | 232 pop_heap(c.begin(), c.end(), comp);
|
| /external/chromium_org/cc/base/ |
| H A D | scoped_ptr_vector.h | 178 inline void pop_heap(Compare comp) {
179 std::pop_heap(data_.begin(), data_.end(), comp);
|
| /external/chromium_org/chrome/browser/extensions/updater/ |
| H A D | request_queue_impl.h | 99 // pop_heap swaps the first and last elements of pending_requests_, and after
101 // now last/formerly first element) forms a proper heap. After pop_heap
105 // pop_heap is called (but before pop_back is called).
106 std::pop_heap(pending_requests_.begin(), pending_requests_.end(),
|
| /external/chromium_org/cc/resources/ |
| H A D | task_graph_runner.cc | 387 std::pop_heap(ready_to_run_namespaces_.begin(),
395 std::pop_heap(task_namespace->ready_to_run_tasks.begin(),
|
| H A D | eviction_tile_priority_queue.cc | 119 paired_queues_.pop_heap(EvictionOrderComparator(tree_priority_));
|
| H A D | raster_tile_priority_queue.cc | 132 paired_queues_.pop_heap(RasterOrderComparator(tree_priority_));
|
| /external/opencv/cv/src/ |
| H A D | _cvkdtree.hpp | 373 pop_heap(nn_pq.begin(), nn_pq.end());
402 pop_heap(tmp_pq.begin(), tmp_pq.end());
|
| /external/chromium_org/native_client_sdk/src/libraries/nacl_io/ |
| H A D | kernel_object.cc | 225 std::pop_heap(free_fds_.begin(), free_fds_.end(), std::greater<int>());
|
| /external/chromium_org/third_party/WebKit/Source/platform/ |
| H A D | Timer.cpp | 307 pop_heap(TimerHeapIterator(heapData), TimerHeapIterator(heapData + heap.size()), TimerHeapLessThanFunction());
|
| /external/chromium_org/third_party/brotli/src/brotli/enc/ |
| H A D | cluster.h | 167 pop_heap(pairs.begin(), pairs.end(), HistogramPairComparator());
|
| /external/openfst/src/include/fst/extensions/far/ |
| H A D | sttable.h | 297 pop_heap(heap_.begin(), heap_.end(), *compare_);
|
| /external/srec/tools/thirdparty/OpenFst/fst/lib/ |
| H A D | shortest-path.h | 294 pop_heap(heap.begin(), heap.end(), compare);
|
| /external/openfst/src/include/fst/ |
| H A D | shortest-path.h | 335 pop_heap(heap.begin(), heap.end(), compare);
|
| /external/llvm/lib/CodeGen/ |
| H A D | MachineScheduler.cpp | 3071 std::pop_heap(ReadyQ.begin(), ReadyQ.end(), Cmp);
|