OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:rankable
(Results
1 - 12
of
12
) sorted by null
/hardware/qcom/gps/msm8909/utils/
LocHeap.h
35
// abstract class to be implemented by client to provide a
rankable
class
45
virtual int ranks(LocRankable&
rankable
) = 0;
48
inline bool outRanks(LocRankable&
rankable
) { return ranks(
rankable
) > 0; }
56
// implemented in
Rankable
. The reason that there is no sort between children is to
86
// by
rankable
obj.
88
LocRankable* remove(LocRankable&
rankable
);
LocHeap.cpp
256
LocRankable* LocHeap::remove(LocRankable&
rankable
) {
260
LocHeapNode* heapNode = LocHeapNode::remove(mTree,
rankable
);
299
inline virtual int ranks(LocRankable&
rankable
) {
300
LocHeapDebugData* testData = dynamic_cast<LocHeapDebugData*>(&
rankable
);
326
LocRankable*
rankable
= heap.pop();
local
327
if (
rankable
) {
328
delete
rankable
;
LocTimer.cpp
189
virtual int ranks(LocRankable&
rankable
);
505
int LocTimerDelegate::ranks(LocRankable&
rankable
) {
507
LocTimerDelegate* timer = (LocTimerDelegate*)(&
rankable
);
666
inline virtual int ranks(LocRankable&
rankable
) {
667
LocTimerTest* timer = dynamic_cast<LocTimerTest*>(&
rankable
);
/hardware/qcom/gps/msm8909w_3100/utils/
LocHeap.h
35
// abstract class to be implemented by client to provide a
rankable
class
45
virtual int ranks(LocRankable&
rankable
) = 0;
48
inline bool outRanks(LocRankable&
rankable
) { return ranks(
rankable
) > 0; }
56
// implemented in
Rankable
. The reason that there is no sort between children is to
86
// by
rankable
obj.
88
LocRankable* remove(LocRankable&
rankable
);
LocHeap.cpp
256
LocRankable* LocHeap::remove(LocRankable&
rankable
) {
260
LocHeapNode* heapNode = LocHeapNode::remove(mTree,
rankable
);
299
inline virtual int ranks(LocRankable&
rankable
) {
300
LocHeapDebugData* testData = dynamic_cast<LocHeapDebugData*>(&
rankable
);
326
LocRankable*
rankable
= heap.pop();
local
327
if (
rankable
) {
328
delete
rankable
;
LocTimer.cpp
189
virtual int ranks(LocRankable&
rankable
);
507
int LocTimerDelegate::ranks(LocRankable&
rankable
) {
509
LocTimerDelegate* timer = (LocTimerDelegate*)(&
rankable
);
678
inline virtual int ranks(LocRankable&
rankable
) {
679
LocTimerTest* timer = dynamic_cast<LocTimerTest*>(&
rankable
);
/hardware/qcom/gps/msm8996/utils/
LocHeap.h
35
// abstract class to be implemented by client to provide a
rankable
class
45
virtual int ranks(LocRankable&
rankable
) = 0;
48
inline bool outRanks(LocRankable&
rankable
) { return ranks(
rankable
) > 0; }
56
// implemented in
Rankable
. The reason that there is no sort between children is to
86
// by
rankable
obj.
88
LocRankable* remove(LocRankable&
rankable
);
LocHeap.cpp
256
LocRankable* LocHeap::remove(LocRankable&
rankable
) {
260
LocHeapNode* heapNode = LocHeapNode::remove(mTree,
rankable
);
299
inline virtual int ranks(LocRankable&
rankable
) {
300
LocHeapDebugData* testData = dynamic_cast<LocHeapDebugData*>(&
rankable
);
326
LocRankable*
rankable
= heap.pop();
local
327
if (
rankable
) {
328
delete
rankable
;
LocTimer.cpp
190
virtual int ranks(LocRankable&
rankable
);
504
int LocTimerDelegate::ranks(LocRankable&
rankable
) {
506
LocTimerDelegate* timer = (LocTimerDelegate*)(&
rankable
);
665
inline virtual int ranks(LocRankable&
rankable
) {
666
LocTimerTest* timer = dynamic_cast<LocTimerTest*>(&
rankable
);
/hardware/qcom/gps/msm8998/utils/
LocHeap.h
35
// abstract class to be implemented by client to provide a
rankable
class
45
virtual int ranks(LocRankable&
rankable
) = 0;
48
inline bool outRanks(LocRankable&
rankable
) { return ranks(
rankable
) > 0; }
56
// implemented in
Rankable
. The reason that there is no sort between children is to
86
// by
rankable
obj.
88
LocRankable* remove(LocRankable&
rankable
);
LocHeap.cpp
256
LocRankable* LocHeap::remove(LocRankable&
rankable
) {
260
LocHeapNode* heapNode = LocHeapNode::remove(mTree,
rankable
);
299
inline virtual int ranks(LocRankable&
rankable
) {
300
LocHeapDebugData* testData = dynamic_cast<LocHeapDebugData*>(&
rankable
);
326
LocRankable*
rankable
= heap.pop();
local
327
if (
rankable
) {
328
delete
rankable
;
LocTimer.cpp
190
virtual int ranks(LocRankable&
rankable
);
506
int LocTimerDelegate::ranks(LocRankable&
rankable
) {
508
LocTimerDelegate* timer = (LocTimerDelegate*)(&
rankable
);
677
inline virtual int ranks(LocRankable&
rankable
) {
678
LocTimerTest* timer = dynamic_cast<LocTimerTest*>(&
rankable
);
Completed in 6833 milliseconds