HomeSort by relevance Sort by last modified time
    Searched defs:Pop (Results 1 - 25 of 116) sorted by null

1 2 3 4 5

  /external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Collections/
StackList.cs 61 public object Pop()
  /device/google/cuttlefish_common/common/libs/thread_safe_queue/
thread_safe_queue.h 26 // Simple queue with Push and Pop capabilities.
31 // other threads calling Push() or Pop().
43 T Pop() {
  /external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/Misc/
ListStack`1.cs 71 public T Pop()
  /external/libmojo/mojo/public/cpp/bindings/tests/
message_queue.cc 18 Pop();
30 void MessageQueue::Pop(Message* message) {
33 Pop();
36 void MessageQueue::Pop() {
39 queue_.pop();
  /external/v8/tools/
jsmin.py 80 def Pop(self):
113 self.Pop()
  /external/webrtc/webrtc/modules/video_coding/
timestamp_map.cc 38 VCMFrameInformation* VCMTimestampMap::Pop(uint32_t timestamp) {
  /prebuilts/go/darwin-x86/src/container/heap/
example_intheap_test.go 21 // Push and Pop use pointer receivers because they modify the slice's length,
26 func (h *IntHeap) Pop() interface{} {
42 fmt.Printf("%d ", heap.Pop(h))
example_pq_test.go 27 // We want Pop to give us the highest, not lowest, priority so we use greater than here.
44 func (pq *PriorityQueue) Pop() interface{} {
92 item := heap.Pop(&pq).(*Item)
heap.go 13 // ordering for the Less method, so Push adds items while Pop removes the
27 // Note that Push and Pop in this interface are for package heap's
29 // use heap.Push and heap.Pop.
33 Pop() interface{} // remove and return element Len() - 1.
57 // Pop removes the minimum element (according to Less) from the heap
61 func Pop(h Interface) interface{} {
65 return h.Pop()
79 return h.Pop()
heap_test.go 26 func (h *myHeap) Pop() (v interface{}) {
65 x := Pop(h).(int)
68 t.Errorf("%d.th pop got %d; want %d", i, x, 0)
82 x := Pop(h).(int)
85 t.Errorf("%d.th pop got %d; want %d", i, x, i)
106 x := Pop(h).(int)
112 t.Errorf("%d.th pop got %d; want %d", i, x, i)
183 Pop(&h)
  /prebuilts/go/linux-x86/src/container/heap/
example_intheap_test.go 21 // Push and Pop use pointer receivers because they modify the slice's length,
26 func (h *IntHeap) Pop() interface{} {
42 fmt.Printf("%d ", heap.Pop(h))
example_pq_test.go 27 // We want Pop to give us the highest, not lowest, priority so we use greater than here.
44 func (pq *PriorityQueue) Pop() interface{} {
92 item := heap.Pop(&pq).(*Item)
heap.go 13 // ordering for the Less method, so Push adds items while Pop removes the
27 // Note that Push and Pop in this interface are for package heap's
29 // use heap.Push and heap.Pop.
33 Pop() interface{} // remove and return element Len() - 1.
57 // Pop removes the minimum element (according to Less) from the heap
61 func Pop(h Interface) interface{} {
65 return h.Pop()
79 return h.Pop()
heap_test.go 26 func (h *myHeap) Pop() (v interface{}) {
65 x := Pop(h).(int)
68 t.Errorf("%d.th pop got %d; want %d", i, x, 0)
82 x := Pop(h).(int)
85 t.Errorf("%d.th pop got %d; want %d", i, x, i)
106 x := Pop(h).(int)
112 t.Errorf("%d.th pop got %d; want %d", i, x, i)
183 Pop(&h)
  /external/compiler-rt/lib/sanitizer_common/
sanitizer_lfstack.h 48 T *Pop() {
  /external/libchrome/base/task_scheduler/
sequence.cc 51 bool Sequence::Pop() {
55 queue_.pop();
  /packages/apps/Test/connectivity/sl4n/rapidjson/include/rapidjson/
memorybuffer.h 48 void Pop(size_t count) { stack_.template Pop<Ch>(count); }
stringbuffer.h 55 // Push and pop a null terminator. This is safe.
58 stack_.template Pop<Ch>(1);
61 void Pop(size_t count) { stack_.template Pop<Ch>(count); }
64 // Push and pop a null terminator. This is safe.
66 stack_.template Pop<Ch>(1);
  /prebuilts/go/darwin-x86/src/go/types/
initorder.go 63 n := heap.Pop(&pq).(*graphNode)
291 func (a *nodeQueue) Pop() interface{} {
  /prebuilts/go/darwin-x86/test/chan/
sieve2.go 66 func (h *PeekChHeap) Pop() (v interface{}) {
134 minchan := heap.Pop(&h).(*PeekCh)
140 minchan := heap.Pop(&h).(*PeekCh)
  /prebuilts/go/linux-x86/src/go/types/
initorder.go 63 n := heap.Pop(&pq).(*graphNode)
291 func (a *nodeQueue) Pop() interface{} {
  /prebuilts/go/linux-x86/test/chan/
sieve2.go 66 func (h *PeekChHeap) Pop() (v interface{}) {
134 minchan := heap.Pop(&h).(*PeekCh)
140 minchan := heap.Pop(&h).(*PeekCh)
  /prebuilts/go/darwin-x86/src/cmd/compile/internal/ssa/
schedule.go 29 // Push and Pop use pointer receivers because they modify the slice's length,
34 func (h *ValHeap) Pop() interface{} {
218 v := heap.Pop(priq).(*Value)
  /prebuilts/go/linux-x86/src/cmd/compile/internal/ssa/
schedule.go 29 // Push and Pop use pointer receivers because they modify the slice's length,
34 func (h *ValHeap) Pop() interface{} {
218 v := heap.Pop(priq).(*Value)
  /art/compiler/debug/dwarf/
writer.h 156 void Pop() {

Completed in 547 milliseconds

1 2 3 4 5