| /external/libcxx/test/std/algorithms/alg.sorting/alg.heap.operations/make.heap/ |
| D | make_heap_comp.pass.cpp | 42 std::make_heap(ia, ia+N, std::greater<int>()); in test()
51 std::make_heap(ia, ia+N, std::ref(pred)); in test()
61 std::make_heap(ia, ia+N, std::ref(pred)); in test()
70 std::make_heap(ia, ia+N, std::ref(pred)); in test()
96 std::make_heap(ia, ia+N, indirect_less()); in main()
|
| D | make_heap.pass.cpp | 29 std::make_heap(ia, ia+N); in test()
|
| /external/libcxx/test/std/algorithms/alg.sorting/alg.heap.operations/sort.heap/ |
| D | sort_heap_comp.pass.cpp | 40 std::make_heap(ia, ia+N, std::greater<int>()); in test()
62 std::make_heap(ia, ia+N, indirect_less()); in main()
|
| D | sort_heap.pass.cpp | 29 std::make_heap(ia, ia+N); in test()
|
| /external/libcxx/test/std/algorithms/alg.sorting/alg.heap.operations/pop.heap/ |
| D | pop_heap_comp.pass.cpp | 41 std::make_heap(ia, ia+N, std::greater<int>()); in test()
62 std::make_heap(ia, ia+N, indirect_less()); in main()
|
| D | pop_heap.pass.cpp | 29 std::make_heap(ia, ia+N); in test()
|
| /external/libcxx/include/ |
| D | queue | 525 _VSTD::make_heap(c.begin(), c.end(), comp);
537 _VSTD::make_heap(c.begin(), c.end(), comp);
550 _VSTD::make_heap(c.begin(), c.end(), comp);
563 _VSTD::make_heap(c.begin(), c.end(), comp);
578 _VSTD::make_heap(c.begin(), c.end(), comp);
616 _VSTD::make_heap(c.begin(), c.end(), comp);
629 _VSTD::make_heap(c.begin(), c.end(), comp);
645 _VSTD::make_heap(c.begin(), c.end(), comp);
658 _VSTD::make_heap(c.begin(), c.end(), comp);
|
| D | algorithm | 502 make_heap(RandomAccessIterator first, RandomAccessIterator last);
506 make_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp);
5022 // make_heap
5043 make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp)
5058 make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last)
5060 …_VSTD::make_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_ty…
|
| /external/libcxx/fuzzing/ |
| D | RoutineNames.txt | 11 make_heap
|
| D | fuzzing.cpp | 491 int make_heap (const uint8_t *data, size_t size) in make_heap() function
494 std::make_heap(working.begin(), working.end()); in make_heap()
508 std::make_heap(working.begin(), iter); in push_heap()
526 std::make_heap(working.begin(), working.end()); in pop_heap()
|
| D | fuzzing.h | 35 int make_heap (const uint8_t *data, size_t size);
|
| D | fuzz_test.cpp | 119 {"make_heap", fuzzing::make_heap},
|
| /external/llvm/include/llvm/ADT/ |
| D | PriorityQueue.h | 72 std::make_heap(this->c.begin(), this->c.end(), this->comp); in reheapify()
|
| /external/swiftshader/third_party/LLVM/include/llvm/ADT/ |
| D | PriorityQueue.h | 72 std::make_heap(this->c.begin(), this->c.end(), this->comp); in reheapify()
|
| /external/webrtc/webrtc/base/ |
| D | messagequeue.h | 235 void reheap() { make_heap(c.begin(), c.end(), comp); } in reheap()
|
| /external/libchrome/base/trace_event/ |
| D | heap_profiler_heap_dump_writer.cc | 142 std::make_heap(buckets.begin(), buckets.end()); in BreakDownBy()
|
| /external/tensorflow/tensorflow/core/lib/gtl/ |
| D | top_n.h | 230 std::make_heap(elements_.begin(), elements_.end(), cmp_); in PushInternal()
|
| /external/tensorflow/tensorflow/contrib/lite/kernels/ |
| D | topk_v2.cc | 98 std::make_heap(container_.begin(), container_.end(), comparator); in push()
|
| /external/tensorflow/tensorflow/core/grappler/costs/ |
| D | virtual_scheduler.cc | 118 std::make_heap(nodes_.begin(), nodes_.end()); in FirstReadyManager()
|
| /external/llvm/lib/CodeGen/ |
| D | MachineScheduler.cpp | 3324 std::make_heap(ReadyQ.begin(), ReadyQ.end(), Cmp); in registerRoots()
3348 std::make_heap(ReadyQ.begin(), ReadyQ.end(), Cmp); in scheduleTree()
|