OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:LocRankable
(Results
1 - 12
of
12
) sorted by null
/hardware/qcom/gps/msm8909/utils/
LocHeap.h
36
class
LocRankable
{
38
virtual inline ~
LocRankable
() {}
45
virtual int ranks(
LocRankable
& rankable) = 0;
48
inline bool outRanks(
LocRankable
& rankable) { return ranks(rankable) > 0; }
71
void push(
LocRankable
& node);
77
LocRankable
* peek();
82
LocRankable
* pop();
88
LocRankable
* remove(
LocRankable
& rankable);
LocHeap.cpp
38
LocRankable
* mData;
40
inline LocHeapNode(
LocRankable
& data) :
48
LocRankable
* detachData();
59
static LocHeapNode* remove(LocHeapNode*& top,
LocRankable
& data);
63
inline bool outRanks(
LocRankable
& data) { return mData->outRanks(data); }
89
LocRankable
* tmpData = node.mData;
95
LocRankable
* LocHeapNode::detachData() {
96
LocRankable
* data = mData;
170
LocHeapNode* LocHeapNode::remove(LocHeapNode*& top,
LocRankable
& data) {
173
if (&data == (
LocRankable
*)(top->mData))
[
all
...]
LocTimer.cpp
55
LocTimerDelegate - an internal timer entity, which also is a
LocRankable
obj.
62
is also a
LocRankable
obj, and LocTimerContainer also is a
66
LocHeap) for LocTimerDelegate (implements
LocRankable
) objs.
172
// This class implements
LocRankable
::ranks() so that when an obj is added into
174
class LocTimerDelegate : public
LocRankable
{
181
// not a complete obj, just ctor for
LocRankable
comparisons
188
//
LocRankable
virtual method
189
virtual int ranks(
LocRankable
& rankable);
320
mTimerContainer->push((
LocRankable
&)(*mTimer));
340
if (priorTop == ((LocHeap*)mTimerContainer)->remove((
LocRankable
&)*mTimer))
[
all
...]
/hardware/qcom/gps/msm8909w_3100/utils/
LocHeap.h
36
class
LocRankable
{
38
virtual inline ~
LocRankable
() {}
45
virtual int ranks(
LocRankable
& rankable) = 0;
48
inline bool outRanks(
LocRankable
& rankable) { return ranks(rankable) > 0; }
71
void push(
LocRankable
& node);
77
LocRankable
* peek();
82
LocRankable
* pop();
88
LocRankable
* remove(
LocRankable
& rankable);
LocHeap.cpp
38
LocRankable
* mData;
40
inline LocHeapNode(
LocRankable
& data) :
48
LocRankable
* detachData();
59
static LocHeapNode* remove(LocHeapNode*& top,
LocRankable
& data);
63
inline bool outRanks(
LocRankable
& data) { return mData->outRanks(data); }
89
LocRankable
* tmpData = node.mData;
95
LocRankable
* LocHeapNode::detachData() {
96
LocRankable
* data = mData;
170
LocHeapNode* LocHeapNode::remove(LocHeapNode*& top,
LocRankable
& data) {
173
if (&data == (
LocRankable
*)(top->mData))
[
all
...]
LocTimer.cpp
55
LocTimerDelegate - an internal timer entity, which also is a
LocRankable
obj.
62
is also a
LocRankable
obj, and LocTimerContainer also is a
66
LocHeap) for LocTimerDelegate (implements
LocRankable
) objs.
172
// This class implements
LocRankable
::ranks() so that when an obj is added into
174
class LocTimerDelegate : public
LocRankable
{
181
// not a complete obj, just ctor for
LocRankable
comparisons
188
//
LocRankable
virtual method
189
virtual int ranks(
LocRankable
& rankable);
320
mTimerContainer->push((
LocRankable
&)(*mTimer));
340
if (priorTop == ((LocHeap*)mTimerContainer)->remove((
LocRankable
&)*mTimer))
[
all
...]
/hardware/qcom/gps/msm8996/utils/
LocHeap.h
36
class
LocRankable
{
38
virtual inline ~
LocRankable
() {}
45
virtual int ranks(
LocRankable
& rankable) = 0;
48
inline bool outRanks(
LocRankable
& rankable) { return ranks(rankable) > 0; }
71
void push(
LocRankable
& node);
77
LocRankable
* peek();
82
LocRankable
* pop();
88
LocRankable
* remove(
LocRankable
& rankable);
LocHeap.cpp
38
LocRankable
* mData;
40
inline LocHeapNode(
LocRankable
& data) :
48
LocRankable
* detachData();
59
static LocHeapNode* remove(LocHeapNode*& top,
LocRankable
& data);
63
inline bool outRanks(
LocRankable
& data) { return mData->outRanks(data); }
89
LocRankable
* tmpData = node.mData;
95
LocRankable
* LocHeapNode::detachData() {
96
LocRankable
* data = mData;
170
LocHeapNode* LocHeapNode::remove(LocHeapNode*& top,
LocRankable
& data) {
173
if (&data == (
LocRankable
*)(top->mData))
[
all
...]
LocTimer.cpp
56
LocTimerDelegate - an internal timer entity, which also is a
LocRankable
obj.
63
is also a
LocRankable
obj, and LocTimerContainer also is a
67
LocHeap) for LocTimerDelegate (implements
LocRankable
) objs.
173
// This class implements
LocRankable
::ranks() so that when an obj is added into
175
class LocTimerDelegate : public
LocRankable
{
182
// not a complete obj, just ctor for
LocRankable
comparisons
189
//
LocRankable
virtual method
190
virtual int ranks(
LocRankable
& rankable);
320
mTimerContainer->push((
LocRankable
&)(*mTimer));
340
if (priorTop == ((LocHeap*)mTimerContainer)->remove((
LocRankable
&)*mTimer))
[
all
...]
/hardware/qcom/gps/msm8998/utils/
LocHeap.h
36
class
LocRankable
{
38
virtual inline ~
LocRankable
() {}
45
virtual int ranks(
LocRankable
& rankable) = 0;
48
inline bool outRanks(
LocRankable
& rankable) { return ranks(rankable) > 0; }
71
void push(
LocRankable
& node);
77
LocRankable
* peek();
82
LocRankable
* pop();
88
LocRankable
* remove(
LocRankable
& rankable);
LocHeap.cpp
38
LocRankable
* mData;
40
inline LocHeapNode(
LocRankable
& data) :
48
LocRankable
* detachData();
59
static LocHeapNode* remove(LocHeapNode*& top,
LocRankable
& data);
63
inline bool outRanks(
LocRankable
& data) { return mData->outRanks(data); }
89
LocRankable
* tmpData = node.mData;
95
LocRankable
* LocHeapNode::detachData() {
96
LocRankable
* data = mData;
170
LocHeapNode* LocHeapNode::remove(LocHeapNode*& top,
LocRankable
& data) {
173
if (&data == (
LocRankable
*)(top->mData))
[
all
...]
LocTimer.cpp
56
LocTimerDelegate - an internal timer entity, which also is a
LocRankable
obj.
63
is also a
LocRankable
obj, and LocTimerContainer also is a
67
LocHeap) for LocTimerDelegate (implements
LocRankable
) objs.
173
// This class implements
LocRankable
::ranks() so that when an obj is added into
175
class LocTimerDelegate : public
LocRankable
{
182
// not a complete obj, just ctor for
LocRankable
comparisons
189
//
LocRankable
virtual method
190
virtual int ranks(
LocRankable
& rankable);
320
mTimerContainer->push((
LocRankable
&)(*mTimer));
340
if (priorTop == ((LocHeap*)mTimerContainer)->remove((
LocRankable
&)*mTimer))
[
all
...]
Completed in 766 milliseconds