| /external/libcxx/test/algorithms/alg.sorting/alg.heap.operations/make.heap/ |
| H A D | Android.mk | 19 test_name := algorithms/alg.sorting/alg.heap.operations/make.heap/make_heap
20 test_src := make_heap.pass.cpp
|
| H A D | make_heap.pass.cpp | 15 // make_heap(Iter first, Iter last);
26 std::make_heap(ia, ia+N);
|
| H A D | make_heap_comp.pass.cpp | 15 // make_heap(Iter first, Iter last, Compare comp);
38 std::make_heap(ia, ia+N, std::greater<int>());
59 std::make_heap(ia, ia+N, indirect_less());
|
| /external/libcxx/test/algorithms/alg.sorting/alg.heap.operations/pop.heap/ |
| H A D | pop_heap.pass.cpp | 26 std::make_heap(ia, ia+N);
|
| H A D | pop_heap_comp.pass.cpp | 38 std::make_heap(ia, ia+N, std::greater<int>());
59 std::make_heap(ia, ia+N, indirect_less());
|
| /external/libcxx/test/algorithms/alg.sorting/alg.heap.operations/sort.heap/ |
| H A D | sort_heap.pass.cpp | 26 std::make_heap(ia, ia+N);
|
| H A D | sort_heap_comp.pass.cpp | 38 std::make_heap(ia, ia+N, std::greater<int>());
60 std::make_heap(ia, ia+N, indirect_less());
|
| /external/stlport/test/unit/ |
| H A D | heap_test.cpp | 39 make_heap(numbers, numbers + 6);
57 make_heap(numbers, numbers + 6, greater<int>());
78 make_heap(v.begin(), v.end());
97 make_heap(v.begin(), v.end(), greater<int>());
|
| /external/chromium_org/components/copresence/handlers/audio/ |
| H A D | audio_directive_list.cc | 38 std::make_heap(active_directives_.begin(),
55 std::make_heap(active_directives_.begin(),
|
| /external/stlport/stlport/stl/ |
| H A D | _queue.h | 174 { make_heap(c.begin(), c.end(), comp); }
185 : c(__first, __last) { make_heap(c.begin(), c.end(), comp); }
191 { make_heap(c.begin(), c.end(), comp); }
199 make_heap(c.begin(), c.end(), comp);
204 : c(__first, __last) { make_heap(c.begin(), c.end(), comp); }
209 { make_heap(c.begin(), c.end(), comp); }
216 make_heap(c.begin(), c.end(), comp);
|
| H A D | _heap.h | 35 // Heap-manipulation functions: push_heap, pop_heap, make_heap, sort_heap.
90 make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last);
94 make_heap(_RandomAccessIterator __first,
|
| H A D | _heap.c | 206 make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) function
233 make_heap(_RandomAccessIterator __first, function
|
| H A D | _algo.c | 1222 make_heap(__first, __middle, __comp);
1268 make_heap(__result_first, __result_real_last, __comp);
|
| /external/llvm/include/llvm/ADT/ |
| H A D | PriorityQueue.h | 72 std::make_heap(this->c.begin(), this->c.end(), this->comp);
|
| /external/chromium_org/cc/base/ |
| H A D | scoped_ptr_vector.h | 168 inline void make_heap(Compare comp) {
169 std::make_heap(data_.begin(), data_.end(), comp);
|
| /external/chromium_org/cc/resources/ |
| H A D | task_graph_runner.cc | 236 std::make_heap(task_namespace.ready_to_run_tasks.begin(),
276 std::make_heap(ready_to_run_namespaces_.begin(),
467 std::make_heap(ready_to_run_namespaces_.begin(),
|
| H A D | eviction_tile_priority_queue.cc | 100 paired_queues_.make_heap(EvictionOrderComparator(tree_priority_));
|
| H A D | raster_tile_priority_queue.cc | 113 paired_queues_.make_heap(RasterOrderComparator(tree_priority_));
|
| /external/chromium_org/third_party/webrtc/base/ |
| H A D | messagequeue.h | 230 void reheap() { make_heap(c.begin(), c.end(), comp); }
|
| /external/openfst/src/include/fst/extensions/far/ |
| H A D | sttable.h | 289 make_heap(heap_.begin(), heap_.end(), *compare_);
|
| /external/llvm/lib/CodeGen/ |
| H A D | MachineScheduler.cpp | 3062 std::make_heap(ReadyQ.begin(), ReadyQ.end(), Cmp);
3086 std::make_heap(ReadyQ.begin(), ReadyQ.end(), Cmp);
|