Searched defs:Enqueue (Results 1 - 12 of 12) sorted by relevance

/external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Misc/
H A DFastQueue.cs104 public virtual void Enqueue(T o) { method in class:Antlr.Runtime.Misc.FastQueue
/external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/Misc/
H A DFastQueue.cs113 public virtual void Enqueue( T o ) method in class:Antlr.Runtime.Misc.FastQueue
/external/v8/src/
H A Dunbound-queue-inl.h56 void UnboundQueue<Record>::Enqueue(const Record& rec) { function in class:v8::internal::UnboundQueue
H A Dcpu-profiler.cc36 void ProfilerEventsProcessor::Enqueue(const CodeEventsContainer& event) { function in class:v8::internal::ProfilerEventsProcessor
38 events_buffer_.Enqueue(event);
53 ticks_from_vm_buffer_.Enqueue(record);
193 processor_->Enqueue(evt_rec);
207 processor_->Enqueue(evt_rec);
221 processor_->Enqueue(evt_rec);
247 processor_->Enqueue(evt_rec);
273 processor_->Enqueue(evt_rec);
290 processor_->Enqueue(evt_rec);
299 processor_->Enqueue(evt_re
[all...]
/external/google-breakpad/src/testing/gtest/samples/
H A Dsample3-inl.h116 void Enqueue(const E& element) { function in class:Queue
156 new_queue->Enqueue(function(node->element()));
/external/protobuf/gtest/samples/
H A Dsample3-inl.h117 void Enqueue(const E& element) { function in class:Queue
157 new_queue->Enqueue(function(node->element()));
/external/clang/lib/StaticAnalyzer/Checkers/
H A DVirtualCallChecker.cpp70 void Enqueue(WorkListUnit WLUnit) { function in class:__anon1392::WalkAST
135 Enqueue(CE);
167 Enqueue(CE);
/external/compiler-rt/lib/sanitizer_common/
H A Dsanitizer_quarantine.h61 c->Enqueue(cb, ptr, size);
131 void Enqueue(Callback cb, void *ptr, uptr size) { function in class:__sanitizer::QuarantineCache
/external/skia/src/views/
H A DSkEvent.cpp308 bool wasEmpty = SkEvent::Enqueue(this);
335 bool SkEvent::Enqueue(SkEvent* evt) { function in class:SkEvent
457 if (SkEvent::Enqueue(evt))
/external/openfst/src/include/fst/
H A Dqueue.h48 // void Enqueue(StateId s);
83 void Enqueue(StateId s) { Enqueue_(s); } function in class:fst::QueueBase
118 void Enqueue(StateId s) { front_ = s; } function in class:fst::TrivialQueue
130 virtual void Enqueue_(StateId s) { Enqueue(s); }
154 void Enqueue(StateId s) { push_front(s); } function in class:fst::FifoQueue
165 virtual void Enqueue_(StateId s) { Enqueue(s); }
187 void Enqueue(StateId s) { push_front(s); } function in class:fst::LifoQueue
198 virtual void Enqueue_(StateId s) { Enqueue(s); }
222 void Enqueue(StateId s) { function in class:fst::ShortestFirstQueue
243 Enqueue(
342 void Enqueue(StateId s) { function in class:fst::TopOrderQueue
394 void Enqueue(StateId s) { function in class:fst::StateOrderQueue
464 void Enqueue(StateId s) { function in class:fst::SccQueue
636 void Enqueue(StateId s) { queue_->Enqueue(s); } function in class:fst::AutoQueue
821 void Enqueue(StateId s) { function in class:fst::PruneQueue
907 void Enqueue(StateId s) { function in class:fst::FilterQueue
[all...]
/external/v8/src/compiler/
H A Dsimplified-lowering.cc80 Enqueue(jsgraph_->graph()->end());
114 // Enqueue {node} if the {use} contains new information for that node.
116 void Enqueue(Node* node, MachineTypeUnion use = 0) { function in class:v8::internal::compiler::RepresentationSelector
148 void Enqueue(Node* node, MachineType use) { function in class:v8::internal::compiler::RepresentationSelector
149 Enqueue(node, static_cast<MachineTypeUnion>(use));
171 Enqueue(input, use);
197 Enqueue(node->InputAt(i)); // Effect inputs: just visit
201 Enqueue(node->InputAt(i)); // Control inputs: just visit
220 Enqueue(*i); // Effect inputs: just visit
224 Enqueue(*
[all...]
/external/openfst/src/include/fst/extensions/pdt/
H A Dshortest-path.h463 void Enqueue(SearchState d);
534 Enqueue(q);
667 Enqueue(d);
672 void PdtShortestPath<Arc, Queue>::Enqueue(SearchState s) { function in class:fst::PdtShortestPath
674 state_queue_->Enqueue(s.state);

Completed in 2588 milliseconds