Home
last modified time | relevance | path

Searched refs:winner (Results 1 – 12 of 12) sorted by relevance

/external/icu/icu4j/main/classes/core/src/com/ibm/icu/text/
DNFRuleSet.java636 int winner = 0; in findFractionRuleSetRule() local
659 winner = i; in findFractionRuleSetRule()
672 if (winner + 1 < rules.length in findFractionRuleSetRule()
673 && rules[winner + 1].getBaseValue() == rules[winner].getBaseValue()) { in findFractionRuleSetRule()
674 if (Math.round(number * rules[winner].getBaseValue()) < 1 in findFractionRuleSetRule()
675 || Math.round(number * rules[winner].getBaseValue()) >= 2) { in findFractionRuleSetRule()
676 ++winner; in findFractionRuleSetRule()
681 return rules[winner]; in findFractionRuleSetRule()
/external/icu/android_icu4j/src/main/java/android/icu/text/
DNFRuleSet.java637 int winner = 0; in findFractionRuleSetRule() local
660 winner = i; in findFractionRuleSetRule()
673 if (winner + 1 < rules.length in findFractionRuleSetRule()
674 && rules[winner + 1].getBaseValue() == rules[winner].getBaseValue()) { in findFractionRuleSetRule()
675 if (Math.round(number * rules[winner].getBaseValue()) < 1 in findFractionRuleSetRule()
676 || Math.round(number * rules[winner].getBaseValue()) >= 2) { in findFractionRuleSetRule()
677 ++winner; in findFractionRuleSetRule()
682 return rules[winner]; in findFractionRuleSetRule()
/external/libchrome/base/metrics/
Dfield_trial_unittest.cc129 const std::string winner = "TheWinner"; in TEST_F() local
130 int winner_group = trial_true->AppendGroup(winner, 10); in TEST_F()
133 EXPECT_EQ(winner, trial_true->group_name()); in TEST_F()
145 const std::string winner = "Winner"; in TEST_F() local
152 trial = CreateFieldTrial(name, 10, winner, &default_group_number); in TEST_F()
161 EXPECT_EQ(winner, trial->group_name()); in TEST_F()
282 std::string winner("Winner"); in TEST_F() local
283 trial->AppendGroup(winner, 10); in TEST_F()
289 EXPECT_EQ(winner, active_group.group_name); in TEST_F()
313 winner == active_groups[i].group_name); in TEST_F()
[all …]
/external/icu/icu4c/source/i18n/
Dnfrs.cpp595 int32_t winner = 0; in findFractionRuleSetRule() local
619 winner = i; in findFractionRuleSetRule()
632 if ((unsigned)(winner + 1) < rules.size() && in findFractionRuleSetRule()
633 rules[winner + 1]->getBaseValue() == rules[winner]->getBaseValue()) { in findFractionRuleSetRule()
634 double n = ((double)rules[winner]->getBaseValue()) * number; in findFractionRuleSetRule()
636 ++winner; in findFractionRuleSetRule()
641 return rules[winner]; in findFractionRuleSetRule()
/external/ppp/pppd/
Doptions.c831 mainopt->winner = opt - mainopt;
858 opt->winner = -1;
1013 && opt->winner != (short int) -1)
1014 print_option(opt + opt->winner, opt, printer, arg);
Dpppd.h111 short int winner; member
/external/llvm/lib/Target/
DREADME.txt1000 int winner, numf2s;
1005 winner = 0;
1007 if (Y[i].y > Y[winner].y)
1008 winner =i;
1036 sunk the store to winner out.
1041 Beyond that, we have a partially redundant load in the loop: if "winner" (aka
1042 %i.01718) isn't updated, we reload Y[winner].y the next time through the loop.
/external/opencv3/modules/ml/doc/
Dml_intro.markdown277 class-<em>winner</em> for it (the class that has got the majority of votes in the trees where
/external/avahi/specs/
Ddraft-cheshire-dnsext-multicastdns-03.txt1084 deemed the winner.
1090 wrong address record would be deemed the winner.
1184 protocol used in the Probing phase will determine a winner and a
Ddraft-cheshire-dnsext-multicastdns-04.txt1084 deemed the winner.
1090 wrong address record would be deemed the winner.
1184 protocol used in the Probing phase will determine a winner and a
Ddraft-cheshire-dnsext-multicastdns-05.txt1184 so it is deemed the winner.
1190 wrong address record would be deemed the winner.
1298 will determine a winner and a loser, and the loser MUST cease using
Ddraft-cheshire-dnsext-multicastdns-06.txt1354 so it is deemed the winner.
1361 winner.
1519 will determine a winner and a loser, and the loser MUST cease using