| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/test/ |
| test_heapq.py | 14 func_names = ['heapify', 'heappop', 'heappush', 'heappushpop',
43 item = self.module.heappop(heap)
55 self.assertRaises(TypeError, self.module.heappop, None)
80 self.module.heappop(heap)
88 yield self.module.heappop(heap)
150 heap_sorted = [self.module.heappop(heap) for i in range(size)]
198 return [self.module.heappop(data).x for i in range(len(data))]
332 for f in (self.module.heapify, self.module.heappop):
339 for f in (self.module.heapify, self.module.heappop):
348 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',
43 item = self.module.heappop(heap)
55 self.assertRaises(TypeError, self.module.heappop, None)
80 self.module.heappop(heap)
88 yield self.module.heappop(heap)
150 heap_sorted = [self.module.heappop(heap) for i in range(size)]
198 return [self.module.heappop(data).x for i in range(len(data))]
332 for f in (self.module.heapify, self.module.heappop):
339 for f in (self.module.heapify, self.module.heappop):
348 for f in (self.module.heapify, self.module.heappop)
[all...] |
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/ |
| heapq.py | 14 item = heappop(heap) # pops the smallest item from the heap
26 - Our heappop() method returns the smallest item, not the largest.
129 __all__ = ['heappush', 'heappop', 'heapify', 'heapreplace', 'merge',
145 def heappop(heap): function
159 This is more efficient than heappop() followed by heappush(), and can be
173 """Fast version of a heappush followed by a heappop."""
191 """Maxheap version of a heappush followed by a heappop."""
277 # heappop() a lot, in accord with theory. Here are typical results from 3
292 # heappop() compares): list.sort() is (unsurprisingly!) more efficient
368 _heappop, _heapreplace, _StopIteration = heappop, heapreplace, StopIteratio
[all...] |
| Queue.py | 227 def _get(self, heappop=heapq.heappop):
228 return heappop(self.queue)
|
| sched.py | 106 pop = heapq.heappop
134 return map(heapq.heappop, [events]*len(events))
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/ |
| heapq.py | 14 item = heappop(heap) # pops the smallest item from the heap
26 - Our heappop() method returns the smallest item, not the largest.
129 __all__ = ['heappush', 'heappop', 'heapify', 'heapreplace', 'merge',
145 def heappop(heap): function
159 This is more efficient than heappop() followed by heappush(), and can be
173 """Fast version of a heappush followed by a heappop."""
191 """Maxheap version of a heappush followed by a heappop."""
277 # heappop() a lot, in accord with theory. Here are typical results from 3
292 # heappop() compares): list.sort() is (unsurprisingly!) more efficient
368 _heappop, _heapreplace, _StopIteration = heappop, heapreplace, StopIteratio
[all...] |
| Queue.py | 227 def _get(self, heappop=heapq.heappop):
228 return heappop(self.queue)
|
| sched.py | 106 pop = heapq.heappop
134 return map(heapq.heappop, [events]*len(events))
|
| /external/chromium_org/third_party/WebKit/Source/platform/ |
| Timer.cpp | 264 heapPop();
280 heapPop();
292 inline void TimerBase::heapPop()
|
| Timer.h | 87 void heapPop();
|
