Searched refs:winner (Results 1 – 9 of 9) sorted by relevance
| /external/chromium/chrome/browser/extensions/ |
| D | extension_pref_value_map.cc | 59 ExtensionEntryMap::const_iterator winner = in CanExtensionControlPref() local
61 if (winner == entries_.end()) in CanExtensionControlPref()
64 return winner->second->install_time <= ext->second->install_time; in CanExtensionControlPref()
71 ExtensionEntryMap::const_iterator winner = in DoesExtensionControlPref() local
73 if (winner == entries_.end()) in DoesExtensionControlPref()
75 return winner->first == extension_id; in DoesExtensionControlPref()
149 ExtensionEntryMap::const_iterator winner = in GetEffectivePrefValue() local
151 if (winner == entries_.end()) in GetEffectivePrefValue()
155 const std::string& ext_id = winner->first; in GetEffectivePrefValue()
168 ExtensionEntryMap::const_iterator winner = entries_.end(); in GetEffectivePrefValueController() local
[all …]
|
| D | extension_pref_store.cc | 29 const Value *winner = in OnPrefValueChanged() local
33 if (winner) in OnPrefValueChanged()
34 SetValue(key, winner->DeepCopy()); in OnPrefValueChanged()
|
| /external/chromium/base/metrics/ |
| D | field_trial_unittest.cc | 85 const std::string winner = "TheWinner"; in TEST_F() local
86 int winner_group = trial_true->AppendGroup(winner, 10); in TEST_F()
89 EXPECT_EQ(winner, trial_true->group_name()); in TEST_F()
102 const std::string winner = "Winner"; in TEST_F() local
108 trial = new FieldTrial(name, 10, winner, next_year_, 12, 31); in TEST_F()
117 EXPECT_EQ(winner, trial->group_name()); in TEST_F()
|
| /external/icu4c/i18n/ |
| D | nfrs.cpp | 498 int32_t winner = 0; in findFractionRuleSetRule() local
522 winner = i; in findFractionRuleSetRule()
535 if ((unsigned)(winner + 1) < rules.size() && in findFractionRuleSetRule()
536 rules[winner + 1]->getBaseValue() == rules[winner]->getBaseValue()) { in findFractionRuleSetRule()
537 double n = ((double)rules[winner]->getBaseValue()) * number; in findFractionRuleSetRule()
539 ++winner; in findFractionRuleSetRule()
544 return rules[winner]; in findFractionRuleSetRule()
|
| /external/ppp/pppd/ |
| D | options.c | 794 mainopt->winner = opt - mainopt;
821 opt->winner = -1;
979 && opt->winner != (short int) -1)
980 print_option(opt + opt->winner, opt, printer, arg);
|
| D | pppd.h | 111 short int winner; member
|
| /external/webkit/Source/WebCore/dom/ |
| D | Document.cpp | 2516 Node* winner = 0; in nextNodeWithGreaterTabIndex() local
2519 winner = n; in nextNodeWithGreaterTabIndex()
2523 return winner; in nextNodeWithGreaterTabIndex()
2530 Node* winner = 0; in previousNodeWithLowerTabIndex() local
2533 winner = n; in previousNodeWithLowerTabIndex()
2537 return winner; in previousNodeWithLowerTabIndex()
2551 … if (Node* winner = nextNodeWithExactTabIndex(start->traverseNextNode(), start->tabIndex(), event)) in nextFocusableNode() local
2552 return winner; in nextFocusableNode()
2562 if (Node* winner = nextNodeWithGreaterTabIndex(this, start ? start->tabIndex() : 0, event)) in nextFocusableNode() local
2563 return winner; in nextFocusableNode()
[all …]
|
| /external/llvm/lib/Target/ |
| D | README.txt | 1053 int winner, numf2s;
1058 winner = 0;
1060 if (Y[i].y > Y[winner].y)
1061 winner =i;
1089 sunk the store to winner out.
1094 Beyond that, we have a partially redundant load in the loop: if "winner" (aka
1095 %i.01718) isn't updated, we reload Y[winner].y the next time through the loop.
|
| /external/srec/config/en.us/dictionary/ |
| D | large.ok | 32226 winner winP
|