Searched refs:pop_heap (Results 1 - 9 of 9) sorted by relevance

/external/stlport/test/unit/
H A Dheap_test.cpp41 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/stlport/stlport/stl/
H A D_heap.h35 // 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.c138 void pop_heap(_RandomAccessIterator __first, function
181 pop_heap(_RandomAccessIterator __first, function
H A D_queue.h232 pop_heap(c.begin(), c.end(), comp);
/external/opencv/cv/src/
H A D_cvkdtree.hpp373 pop_heap(nn_pq.begin(), nn_pq.end());
402 pop_heap(tmp_pq.begin(), tmp_pq.end());
/external/webkit/Source/WebCore/platform/
H A DTimer.cpp277 pop_heap(TimerHeapIterator(0), TimerHeapIterator(timerHeap().size()));
/external/openfst/src/include/fst/extensions/far/
H A Dsttable.h296 pop_heap(heap_.begin(), heap_.end(), *compare_);
/external/srec/tools/thirdparty/OpenFst/fst/lib/
H A Dshortest-path.h294 pop_heap(heap.begin(), heap.end(), compare);
/external/openfst/src/include/fst/
H A Dshortest-path.h335 pop_heap(heap.begin(), heap.end(), compare);

Completed in 201 milliseconds