| /external/apache-commons-math/src/main/java/org/apache/commons/math/stat/ranking/ |
| NaturalRanking.java | 188 * @return array of ranks
193 IntDoublePair[] ranks = new IntDoublePair[data.length]; local
195 ranks[i] = new IntDoublePair(data[i], i);
202 recodeNaNs(ranks, Double.POSITIVE_INFINITY);
205 recodeNaNs(ranks, Double.NEGATIVE_INFINITY);
208 ranks = removeNaNs(ranks);
211 nanPositions = getNanPositions(ranks);
218 Arrays.sort(ranks);
222 double[] out = new double[ranks.length]
[all...] |
| /hardware/qcom/gps/msm8909/utils/ |
| LocHeap.cpp | 104 // mData of tree top ranks lower than that of the incoming node,
108 // ensure the current node ranks higher than in the incoming one
137 // a node from the left or right child, whichever ranks higher,
299 inline virtual int ranks(LocRankable& rankable) { function in class:LocHeapDebugData
|
| LocTimer.cpp | 63 heap, its ranks() implementation decides where it is placed
172 // This class implements LocRankable::ranks() so that when an obj is added into
189 virtual int ranks(LocRankable& rankable);
505 int LocTimerDelegate::ranks(LocRankable& rankable) { function in class:LocTimerDelegate
509 // larger time ranks lower!!!
666 inline virtual int ranks(LocRankable& rankable) { function in class:LocTimerTest
|
| /hardware/qcom/gps/msm8996/utils/ |
| LocHeap.cpp | 104 // mData of tree top ranks lower than that of the incoming node,
108 // ensure the current node ranks higher than in the incoming one
137 // a node from the left or right child, whichever ranks higher,
299 inline virtual int ranks(LocRankable& rankable) { function in class:LocHeapDebugData
|
| LocTimer.cpp | 63 heap, its ranks() implementation decides where it is placed
172 // This class implements LocRankable::ranks() so that when an obj is added into
189 virtual int ranks(LocRankable& rankable);
503 int LocTimerDelegate::ranks(LocRankable& rankable) { function in class:LocTimerDelegate
507 // larger time ranks lower!!!
664 inline virtual int ranks(LocRankable& rankable) { function in class:LocTimerTest
|
| /hardware/qcom/gps/msmcobalt/utils/ |
| LocHeap.cpp | 104 // mData of tree top ranks lower than that of the incoming node,
108 // ensure the current node ranks higher than in the incoming one
137 // a node from the left or right child, whichever ranks higher,
299 inline virtual int ranks(LocRankable& rankable) { function in class:LocHeapDebugData
|
| LocTimer.cpp | 63 heap, its ranks() implementation decides where it is placed
172 // This class implements LocRankable::ranks() so that when an obj is added into
189 virtual int ranks(LocRankable& rankable);
503 int LocTimerDelegate::ranks(LocRankable& rankable) { function in class:LocTimerDelegate
507 // larger time ranks lower!!!
669 inline virtual int ranks(LocRankable& rankable) { function in class:LocTimerTest
|
| /external/libgdx/extensions/gdx-bullet/jni/src/bullet/BulletSoftBody/ |
| btSoftBody.cpp | 741 btAlignedObjectArray<btScalar> ranks; local
742 ranks.resize(m_nodes.size(),0);
755 ranks[int(t.m_n[j]-&m_nodes[0])]+=1;
762 m_nodes[i].m_im=ranks[i]/m_nodes[i].m_im;
1583 btAlignedObjectArray<int> ranks; local
[all...] |
