OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:QueueNode
(Results
1 - 8
of
8
) sorted by null
/external/protobuf/gtest/samples/
sample3-inl.h
46
//
QueueNode
is a node in a Queue, which consists of an element of
49
class
QueueNode
{
57
QueueNode
* next() { return next_; }
58
const
QueueNode
* next() const { return next_; }
63
QueueNode
(const E& an_element) : element_(an_element), next_(NULL) {}
66
const
QueueNode
& operator = (const
QueueNode
&);
67
QueueNode
(const
QueueNode
&);
70
QueueNode
* next_
[
all
...]
sample3_unittest.cc
105
for ( const
QueueNode
<int> * n1 = q->Head(), * n2 = new_q->Head();
/external/google-breakpad/src/testing/gtest/samples/
sample3-inl.h
46
//
QueueNode
is a node in a Queue, which consists of an element of
49
class
QueueNode
{
57
QueueNode
* next() { return next_; }
58
const
QueueNode
* next() const { return next_; }
63
explicit
QueueNode
(const E& an_element) : element_(an_element), next_(NULL) {}
66
const
QueueNode
& operator = (const
QueueNode
&);
67
QueueNode
(const
QueueNode
&);
70
QueueNode
* next_
[
all
...]
sample3_unittest.cc
105
for ( const
QueueNode
<int> * n1 = q->Head(), * n2 = new_q->Head();
/external/vulkan-validation-layers/tests/gtest-1.7.0/samples/
sample3-inl.h
46
//
QueueNode
is a node in a Queue, which consists of an element of
49
class
QueueNode
{
57
QueueNode
* next() { return next_; }
58
const
QueueNode
* next() const { return next_; }
63
explicit
QueueNode
(const E& an_element) : element_(an_element), next_(NULL) {}
66
const
QueueNode
& operator = (const
QueueNode
&);
67
QueueNode
(const
QueueNode
&);
70
QueueNode
* next_
[
all
...]
sample3_unittest.cc
105
for ( const
QueueNode
<int> * n1 = q->Head(), * n2 = new_q->Head();
/ndk/sources/third_party/googletest/googletest/samples/
sample3-inl.h
46
//
QueueNode
is a node in a Queue, which consists of an element of
49
class
QueueNode
{
57
QueueNode
* next() { return next_; }
58
const
QueueNode
* next() const { return next_; }
63
explicit
QueueNode
(const E& an_element) : element_(an_element), next_(NULL) {}
66
const
QueueNode
& operator = (const
QueueNode
&);
67
QueueNode
(const
QueueNode
&);
70
QueueNode
* next_
[
all
...]
sample3_unittest.cc
105
for ( const
QueueNode
<int> * n1 = q->Head(), * n2 = new_q->Head();
Completed in 327 milliseconds