/external/stlport/test/unit/ |
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>());
|
/frameworks/base/media/libdrm/mobile2/src/util/ustl-1.0/ |
uheap.h | 39 /// \brief make_heap turns the range [first, last) into a heap 46 void make_heap (RandomAccessIterator first, RandomAccessIterator last, Compare comp) function in namespace:ustl 93 make_heap (first, last, comp); 114 HEAP_FN_WITH_LESS (void, make_heap) 139 : m_v (f, l), m_c (c) { make_heap (m_v.begin(), m_v.end(), m_c); } 143 inline void push (reference v) { m_v.push_back (v); make_heap (m_v.begin(), m_v.end(), m_c); }
|
/external/stlport/stlport/stl/ |
_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);
|
_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,
|
_heap.c | 206 make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) function 233 make_heap(_RandomAccessIterator __first, function
|
_algo.c | [all...] |