| /external/chromium_org/v8/test/mjsunit/regress/ |
| regress-2186.js | 30 function heapify(i) { function
33 heapify(1);
36 var ANOTHER_ONE = heapify(ONE);
|
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/test/ |
| test_heapq.py | 14 func_names = ['heapify', 'heappop', 'heappush', 'heappushpop',
69 self.module.heapify(heap)
72 self.assertRaises(TypeError, self.module.heapify, None)
96 # heapify'ing all of data (linear time), then doing 10 heappops
100 self.module.heapify(heap)
113 self.module.heapify(heap)
143 if trial & 1: # Half of the time, use heapify
145 self.module.heapify(heap)
197 self.module.heapify(data)
332 for f in (self.module.heapify, self.module.heappop)
[all...] |
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/test/ |
| test_heapq.py | 14 func_names = ['heapify', 'heappop', 'heappush', 'heappushpop',
69 self.module.heapify(heap)
72 self.assertRaises(TypeError, self.module.heapify, None)
96 # heapify'ing all of data (linear time), then doing 10 heappops
100 self.module.heapify(heap)
113 self.module.heapify(heap)
143 if trial & 1: # Half of the time, use heapify
145 self.module.heapify(heap)
197 self.module.heapify(data)
332 for f in (self.module.heapify, self.module.heappop)
[all...] |
| /external/openfst/src/include/fst/ |
| heap.h | 89 Heapify(i);
100 Heapify(0);
161 // Heapify subtree rooted at index i.
162 void Heapify(int i) {
177 Heapify(largest);
|
| /external/srec/tools/thirdparty/OpenFst/fst/lib/ |
| heap.h | 83 Heapify(i);
93 Heapify(0);
148 // heapify subtree rooted at index i.
149 void Heapify(int i) {
164 Heapify(largest);
|
| /external/chromium_org/third_party/WebKit/Source/wtf/ |
| NonCopyingSort.h | 53 inline void heapify(RandomAccessIterator array, ptrdiff_t count, Predicate compareLess) function in namespace:WTF
67 heapify(start, count, compareLess);
|
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/ |
| heapq.py | 16 heapify(x) # transforms list into a heap, in-place, in linear time
129 __all__ = ['heappush', 'heappop', 'heapify', 'heapreplace', 'merge',
179 def heapify(x): function
214 heapify(result)
276 # comparisons made by heapify() a little, and those made by exhaustive
280 # Compares needed by heapify Compares needed by 1000 heappops
287 # 2198, 2148, and 2219 compares: heapify() is more efficient, when
291 # 8627, and 8632 (this should be compared to the sum of heapify() and
378 heapify(h)
|
| sched.py | 74 heapq.heapify(self._queue)
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/ |
| heapq.py | 16 heapify(x) # transforms list into a heap, in-place, in linear time
129 __all__ = ['heappush', 'heappop', 'heapify', 'heapreplace', 'merge',
179 def heapify(x): function
214 heapify(result)
276 # comparisons made by heapify() a little, and those made by exhaustive
280 # Compares needed by heapify Compares needed by 1000 heappops
287 # 2198, 2148, and 2219 compares: heapify() is more efficient, when
291 # 8627, and 8632 (this should be compared to the sum of heapify() and
378 heapify(h)
|
| sched.py | 74 heapq.heapify(self._queue)
|
| /libcore/luni/src/main/java/java/util/concurrent/ |
| PriorityBlockingQueue.java | 209 boolean heapify = true; // true if not known to be in heap order
214 heapify = false;
222 heapify = false;
236 if (heapify)
237 heapify(); method
398 private void heapify() { method in class:PriorityBlockingQueue
|
| /frameworks/base/services/input/ |
| InputReader.cpp | [all...] |
