Home
last modified time | relevance | path

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

/external/libcxx/test/std/algorithms/alg.sorting/alg.heap.operations/pop.heap/
Dpop_heap_comp.pass.cpp44 std::pop_heap(ia, ia+i, std::greater<int>()); in test()
47 std::pop_heap(ia, ia, std::greater<int>()); in test()
65 std::pop_heap(ia, ia+i, indirect_less()); in main()
Dpop_heap.pass.cpp32 std::pop_heap(ia, ia+i); in test()
35 std::pop_heap(ia, ia); in test()
/external/libcxx/fuzzing/
DRoutineNames.txt13 pop_heap
Dfuzzing.h37 int pop_heap (const uint8_t *data, size_t size);
Dfuzz_test.cpp121 {"pop_heap", fuzzing::pop_heap},
Dfuzzing.cpp535 int pop_heap (const uint8_t *data, size_t size) in pop_heap() function
544 std::pop_heap(working.begin(), iter); in pop_heap()
/external/tensorflow/tensorflow/core/lib/gtl/
Dpriority_queue_util.h46 std::pop_heap(c.begin(), c.end(), comp); in ConsumeTop()
Dtop_n.h232 std::pop_heap(elements_.begin(), elements_.end(), cmp_); in PushInternal()
241 std::pop_heap(elements_.begin(), elements_.end(), cmp_); in PushInternal()
/external/tensorflow/tensorflow/lite/experimental/kernels/
Dtop_n.h234 std::pop_heap(elements_.begin(), elements_.end(), cmp_); in PushInternal()
243 std::pop_heap(elements_.begin(), elements_.end(), cmp_); in PushInternal()
/external/libchrome/mojo/core/ports/
Dmessage_queue.cc51 std::pop_heap(heap_.begin(), heap_.end()); in GetNextMessage()
/external/tensorflow/tensorflow/lite/kernels/
Dtopk_v2.cc100 std::pop_heap(container_.begin(), container_.end(), comparator); in push()
105 std::pop_heap(container_.begin(), container_.end(), comparator); in push()
/external/libcxx/benchmarks/
Dalgorithms.bench.cpp241 std::pop_heap(B, I); in run()
/external/brotli/research/
Ddurchschlag.cc144 std::pop_heap(candidates->begin(), candidates->end(), greaterScore()); in buildCandidatesList()
609 std::pop_heap(candidates.begin(), candidates.end(), lessScore()); in durchschlagGenerateCollaborative()
/external/tensorflow/tensorflow/core/grappler/costs/
Dvirtual_scheduler.cc127 std::pop_heap(nodes_.begin(), nodes_.end(), greater_); in RemoveCurrNode()
/external/libcxx/include/
Dqueue766 _VSTD::pop_heap(c.begin(), c.end(), comp);
Dalgorithm494 pop_heap(RandomAccessIterator first, RandomAccessIterator last);
498 pop_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp);
4818 // pop_heap
4891 pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp)
4906 pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last)
4908 …_VSTD::pop_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_typ…
/external/swiftshader/third_party/llvm-7.0/llvm/lib/Target/Hexagon/
DHexagonISelDAGToDAG.cpp1685 std::pop_heap(Q.begin(), Q.end(), WeightedLeaf::Compare); in pop()
/external/llvm/lib/CodeGen/
DMachineScheduler.cpp3333 std::pop_heap(ReadyQ.begin(), ReadyQ.end(), Cmp); in pickNode()
/external/swiftshader/third_party/llvm-7.0/llvm/lib/CodeGen/
DMachineScheduler.cpp3412 std::pop_heap(ReadyQ.begin(), ReadyQ.end(), Cmp); in pickNode()