OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:Dequeue
(Results
1 - 25
of
35
) sorted by null
1
2
/external/google-breakpad/src/testing/gtest/samples/
sample3_unittest.cc
128
// Tests
Dequeue
().
129
TEST_F(QueueTest,
Dequeue
) {
130
int * n = q0_.
Dequeue
();
133
n = q1_.
Dequeue
();
139
n = q2_.
Dequeue
();
sample5_unittest.cc
177
// Tests
Dequeue
().
178
TEST_F(QueueTest,
Dequeue
) {
179
int* n = q0_.
Dequeue
();
182
n = q1_.
Dequeue
();
188
n = q2_.
Dequeue
();
sample3-inl.h
131
E*
Dequeue
() {
/external/protobuf/gtest/samples/
sample3_unittest.cc
128
// Tests
Dequeue
().
129
TEST_F(QueueTest,
Dequeue
) {
130
int * n = q0_.
Dequeue
();
133
n = q1_.
Dequeue
();
139
n = q2_.
Dequeue
();
sample5_unittest.cc
177
// Tests
Dequeue
().
178
TEST_F(QueueTest,
Dequeue
) {
179
int* n = q0_.
Dequeue
();
182
n = q1_.
Dequeue
();
188
n = q2_.
Dequeue
();
sample3-inl.h
132
E*
Dequeue
() {
/ndk/sources/third_party/googletest/googletest/samples/
sample3_unittest.cc
128
// Tests
Dequeue
().
129
TEST_F(QueueTest,
Dequeue
) {
130
int * n = q0_.
Dequeue
();
133
n = q1_.
Dequeue
();
139
n = q2_.
Dequeue
();
sample5_unittest.cc
177
// Tests
Dequeue
().
178
TEST_F(QueueTest,
Dequeue
) {
179
int* n = q0_.
Dequeue
();
182
n = q1_.
Dequeue
();
188
n = q2_.
Dequeue
();
sample3-inl.h
131
E*
Dequeue
() {
/external/v8/src/
unbound-queue.h
27
INLINE(bool
Dequeue
(Record* rec));
unbound-queue-inl.h
46
bool UnboundQueue<Record>::
Dequeue
(Record* rec) {
optimizing-compiler-thread.cc
152
while (output_queue_.
Dequeue
(&job)) {
223
while (output_queue_.
Dequeue
(&job)) {
/external/v8/test/cctest/
test-unbound-queue.cc
45
cq.
Dequeue
(&rec);
64
cq.
Dequeue
(&rec);
73
cq.
Dequeue
(&rec);
/external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Tree/
TreeIterator.cs
101
Current = nodes.
Dequeue
();
127
Current = nodes.
Dequeue
();
134
Current = nodes.
Dequeue
();
/external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/Tree/
TreeIterator.cs
114
Current = nodes.
Dequeue
();
150
Current = nodes.
Dequeue
();
159
Current = nodes.
Dequeue
();
/bionic/tools/relocation_packer/src/
sleb128.h
60
int_t
Dequeue
();
sleb128.cc
96
uint_t Sleb128Decoder<uint_t>::
Dequeue
() {
122
values->push_back(
Dequeue
());
/external/openfst/src/include/fst/
queue.h
50
// void
Dequeue
();
84
void
Dequeue
() { Dequeue_(); }
119
void
Dequeue
() { front_ = kNoStateId; }
131
virtual void Dequeue_() {
Dequeue
(); }
155
void
Dequeue
() { pop_back(); }
166
virtual void Dequeue_() {
Dequeue
(); }
188
void
Dequeue
() { pop_front(); }
199
virtual void Dequeue_() {
Dequeue
(); }
232
void
Dequeue
() {
265
virtual void Dequeue_() {
Dequeue
(); }
[
all
...]
/external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Misc/
LookaheadStream.cs
90
public override T
Dequeue
() {
104
_previousElement =
Dequeue
();
FastQueue.cs
38
/** A queue that can
dequeue
and get(i) in O(1) and grow arbitrarily large.
39
* A linked list is fast at
dequeue
but slow at get(i). An array is
42
* List grows until you
dequeue
last element at end of buffer. Then
90
public virtual T
Dequeue
() {
/external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/Misc/
LookaheadStream.cs
105
public override T
Dequeue
()
122
_previousElement =
Dequeue
();
FastQueue.cs
39
/** A queue that can
dequeue
and get(i) in O(1) and grow arbitrarily large.
40
* A linked list is fast at
dequeue
but slow at get(i). An array is
43
* List grows until you
dequeue
last element at end of buffer. Then
97
public virtual T
Dequeue
()
/external/clang/lib/StaticAnalyzer/Checkers/
VirtualCallChecker.cpp
82
WorkListUnit
Dequeue
() {
89
WorkListUnit WLUnit =
Dequeue
();
/external/skia/include/views/
SkEvent.h
251
can be told to later call
Dequeue
().
280
static SkEvent*
Dequeue
();
/external/skia/src/views/
SkEvent.cpp
355
SkEvent* SkEvent::
Dequeue
() {
419
SkEvent* evt = SkEvent::
Dequeue
();
449
SkDebugf("
dequeue
-delay %s (%d)", evt->getType(), gDelayDepth);
Completed in 535 milliseconds
1
2