| /external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Collections/ |
| StackList.cs | 52 public void Push(object item)
|
| /device/google/cuttlefish_common/common/libs/thread_safe_queue/ |
| thread_safe_queue.h | 26 // Simple queue with Push and Pop capabilities.
27 // If the max_elements argument is passed to the constructor, and Push is called
31 // other threads calling Push() or Pop().
53 void Push(T&& t) {
60 void Push(const T& t) {
|
| /external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/Misc/ |
| ListStack`1.cs | 93 public void Push(T item)
|
| /external/chromium-trace/catapult/devil/devil/android/sdk/ |
| gce_adb_wrapper.py | 8 'push' and 'pull'. With gce instances, moving files through adb can be
47 def Push(self, local, remote, **kwargs):
142 self.Push(apk_path, '/data/local/tmp/tmp.apk')
|
| /external/libmojo/mojo/public/cpp/bindings/tests/ |
| message_queue.cc | 25 void MessageQueue::Push(Message* message) {
26 queue_.push(new Message());
|
| /external/libmojo/third_party/catapult/devil/devil/android/sdk/ |
| gce_adb_wrapper.py | 8 'push' and 'pull'. With gce instances, moving files through adb can be
45 def Push(self, local, remote, **kwargs):
140 self.Push(apk_path, '/data/local/tmp/tmp.apk')
|
| /external/v8/tools/ |
| jsmin.py | 76 def Push(self):
110 self.Push()
127 self.Push()
|
| /prebuilts/go/darwin-x86/src/container/heap/ |
| example_intheap_test.go | 20 func (h *IntHeap) Push(x interface{}) {
21 // Push and Pop use pointer receivers because they modify the slice's length,
39 heap.Push(h, 3)
|
| example_pq_test.go | 37 func (pq *PriorityQueue) Push(x interface{}) {
87 heap.Push(&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.
32 Push(x interface{}) // add x as element Len()
49 // Push pushes the element x onto the heap. The complexity is
52 func Push(h Interface, x interface{}) {
53 h.Push(x)
84 // but less expensive than, calling Remove(h, i) followed by a Push of the new value.
|
| heap_test.go | 31 func (h *myHeap) Push(v interface{}) {
59 h.Push(0) // all elements are the same
76 h.Push(i) // all elements are different
95 h.Push(i)
101 Push(h, i)
108 Push(h, 20+i)
120 h.Push(i)
137 h.Push(i)
155 h.Push(i)
180 Push(&h, 0) // all elements are the sam
[all...] |
| /prebuilts/go/linux-x86/src/container/heap/ |
| example_intheap_test.go | 20 func (h *IntHeap) Push(x interface{}) {
21 // Push and Pop use pointer receivers because they modify the slice's length,
39 heap.Push(h, 3)
|
| example_pq_test.go | 37 func (pq *PriorityQueue) Push(x interface{}) {
87 heap.Push(&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.
32 Push(x interface{}) // add x as element Len()
49 // Push pushes the element x onto the heap. The complexity is
52 func Push(h Interface, x interface{}) {
53 h.Push(x)
84 // but less expensive than, calling Remove(h, i) followed by a Push of the new value.
|
| /system/core/adb/ |
| adb_utils.h | 67 void Push(const T& t) {
|
| /external/compiler-rt/lib/sanitizer_common/ |
| sanitizer_lfstack.h | 12 // The memory passed to Push() must not be ever munmap'ed.
36 void Push(T *p) {
|
| /external/llvm/lib/Transforms/ObjCARC/ |
| ObjCARCAPElim.cpp | 94 Instruction *Push = nullptr;
99 Push = Inst;
102 // If this pop matches a push and nothing in between can autorelease,
104 if (Push && cast<CallInst>(Inst)->getArgOperand(0) == Push) {
106 DEBUG(dbgs() << "ObjCARCAPElim::OptimizeBB: Zapping push pop "
109 << " Push: " << *Push << "\n");
111 Push->eraseFromParent();
113 Push = nullptr
[all...] |
| /external/stressapptest/src/ |
| queue.cc | 25 // Push inserts pages, pop returns a random entry.
45 int PageEntryQueue::Push(struct page_entry *pe) {
|
| /external/v8/src/base/ |
| ring-buffer.h | 18 void Push(const T& value) {
|
| /packages/apps/Test/connectivity/sl4n/rapidjson/include/rapidjson/ |
| memorybuffer.h | 42 void Put(Ch c) { *stack_.template Push<Ch>() = c; }
47 Ch* Push(size_t count) { return stack_.template Push<Ch>(count); }
65 std::memset(memoryBuffer.stack_.Push<char>(n), c, n * sizeof(c));
|
| stringbuffer.h | 50 void Put(Ch c) { *stack_.template Push<Ch>() = c; }
55 // Push and pop a null terminator. This is safe.
56 *stack_.template Push<Ch>() = '\0';
60 Ch* Push(size_t count) { return stack_.template Push<Ch>(count); }
64 // Push and pop a null terminator. This is safe.
65 *stack_.template Push<Ch>() = '\0';
88 std::memset(stream.stack_.Push<char>(n), c, n * sizeof(c));
|
| /prebuilts/go/darwin-x86/src/cmd/asm/internal/lex/ |
| stack.go | 19 // Push adds tr to the top (end) of the input stack. (Popping happens automatically.)
20 func (s *Stack) Push(tr TokenReader) {
|
| /prebuilts/go/darwin-x86/src/go/types/ |
| initorder.go | 287 func (a *nodeQueue) Push(x interface{}) {
|
| /prebuilts/go/darwin-x86/test/chan/ |
| sieve2.go | 71 func (h *PeekChHeap) Push(v interface{}) {
137 heap.Push(&h, minchan)
143 heap.Push(&h, minchan)
146 heap.Push(&h, &PeekCh{<-m, m})
|
| /prebuilts/go/linux-x86/src/cmd/asm/internal/lex/ |
| stack.go | 19 // Push adds tr to the top (end) of the input stack. (Popping happens automatically.)
20 func (s *Stack) Push(tr TokenReader) {
|
