HomeSort by relevance Sort by last modified time
    Searched full:ranks (Results 1 - 25 of 83) sorted by null

1 2 3 4

  /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...]
RankingAlgorithm.java 29 * of ranks.</p>
31 * <p>Ranks should be 1-based - that is, the smallest value
32 * returned in an array of ranks should be greater than or equal to one,
33 * rather than 0. Ranks should in general take integer values, though
38 * @return an array of ranks corresponding to the elements of the input array
TiesStrategy.java 23 * <li>SEQUENTIAL - Ties are assigned ranks in order of occurrence in the original array,
29 * <li>AVERAGE - Tied values are assigned the average of the applicable ranks.
41 /** Ties assigned sequential ranks in order of occurrence */
50 /** Ties get the average of applicable ranks */
53 /** Ties get a random integral value from among applicable ranks */
NaNStrategy.java 44 /** NaNs are removed before computing ranks */
  /packages/apps/UnifiedEmail/src/com/android/mail/utils/
RankedComparator.java 27 * Compares objects of the type {@code T} based on predefined order of the ranks of the type
28 * {@code K}. The ranks that are not in the predefined order will be considered larger than other
29 * ranks (if this comparator is used for sorting those elements will be at the end).
32 * @param <K> Type of the ranks used for comparison.
41 * Creates a comparator that compares objects of type {@code T} by extracting the ranks of the
43 * {@code rankOrder}. Ranks not present in {@code rankOrder} are considered larger than the
44 * ranks present in the {@code rankOrder}.
46 * @param rankOrder Order of the ranks.
  /hardware/qcom/gps/msm8909/utils/
LocHeap.h 42 // >0 if ranks higher than the input;
43 // ==0 if equally ranks with the input;
44 // <0 if ranks lower than the input
45 virtual int ranks(LocRankable& rankable) = 0;
48 inline bool outRanks(LocRankable& rankable) { return ranks(rankable) > 0; }
55 // i.e. parent always ranks higher than children, if they exist. Ranking algorithm is
84 // navigating through the tree and find the node that ranks the same
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.h 42 // >0 if ranks higher than the input;
43 // ==0 if equally ranks with the input;
44 // <0 if ranks lower than the input
45 virtual int ranks(LocRankable& rankable) = 0;
48 inline bool outRanks(LocRankable& rankable) { return ranks(rankable) > 0; }
55 // i.e. parent always ranks higher than children, if they exist. Ranking algorithm is
84 // navigating through the tree and find the node that ranks the same
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.h 42 // >0 if ranks higher than the input;
43 // ==0 if equally ranks with the input;
44 // <0 if ranks lower than the input
45 virtual int ranks(LocRankable& rankable) = 0;
48 inline bool outRanks(LocRankable& rankable) { return ranks(rankable) > 0; }
55 // i.e. parent always ranks higher than children, if they exist. Ranking algorithm is
84 // navigating through the tree and find the node that ranks the same
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
  /packages/apps/UnifiedEmail/tests/src/com/android/mail/utils/
RankedComparatorTest.java 30 private static final String[] RANKS = new String[]{RANK1, RANK2};
41 new RankedComparator<DummyObject, String>(RANKS, DUMMY_OBJECT_TO_RANK_FUNCTION);
54 // Testing different ranks and with different order of the parameters
68 assertTrue("Two different unknown ranks should be equal.",
  /external/apache-commons-math/src/main/java/org/apache/commons/math/stat/descriptive/rank/
package.html 19 <body>Summary statistics based on ranks.</body>
  /packages/inputmethods/LatinIME/java/src/com/android/inputmethod/latin/utils/
SuggestionResults.java 75 // This comparator ranks the word info with the higher frequency first. That's because
  /external/junit/src/org/junit/experimental/max/
MaxHistory.java 160 * @return a comparator that ranks tests based on the JUnit Max sorting
  /external/vboot_reference/cgpt/
cmd_prioritize.c 27 " If necessary the lowest ranks will be coalesced.\n"
  /developers/build/prebuilts/gradle/AppRestrictionEnforcer/Application/src/main/java/com/example/android/apprestrictionenforcer/
AppRestrictionEnforcerFragment.java 299 private void updateRank(Context context, String[] ranks, String selectedRank) {
302 android.R.layout.simple_spinner_dropdown_item, ranks));
303 mSpinnerRank.setSelection(search(ranks, selectedRank));
  /developers/samples/android/admin/AppRestrictionEnforcer/Application/src/main/java/com/example/android/apprestrictionenforcer/
AppRestrictionEnforcerFragment.java 299 private void updateRank(Context context, String[] ranks, String selectedRank) {
302 android.R.layout.simple_spinner_dropdown_item, ranks));
303 mSpinnerRank.setSelection(search(ranks, selectedRank));
  /development/samples/browseable/AppRestrictionEnforcer/src/com.example.android.apprestrictionenforcer/
AppRestrictionEnforcerFragment.java 299 private void updateRank(Context context, String[] ranks, String selectedRank) {
302 android.R.layout.simple_spinner_dropdown_item, ranks));
303 mSpinnerRank.setSelection(search(ranks, selectedRank));
  /external/vboot_reference/tests/
run_cgpt_tests.sh 238 # squish all the ranks
243 # squish the ranks by not leaving room
248 # squish the ranks while bringing the friends along
  /frameworks/base/services/core/java/com/android/server/pm/
ShortcutPackage.java 847 * If too many, we'll remove the dynamic with the lowest ranks.
    [all...]
  /external/apache-commons-math/src/main/java/org/apache/commons/math/stat/correlation/
SpearmansCorrelation.java 32 * <p>By default, ranks are computed using {@link NaturalRanking} with default

Completed in 3185 milliseconds

1 2 3 4