Searched refs:winner (Results 1 - 10 of 10) sorted by relevance
/external/chromium/chrome/browser/extensions/ |
H A D | extension_pref_store.cc | 29 const Value *winner = local 33 if (winner) 34 SetValue(key, winner->DeepCopy());
|
H A D | extension_pref_value_map.cc | 59 ExtensionEntryMap::const_iterator winner = local 61 if (winner == entries_.end()) 64 return winner->second->install_time <= ext->second->install_time; 71 ExtensionEntryMap::const_iterator winner = local 73 if (winner == entries_.end()) 75 return winner->first == extension_id; 149 ExtensionEntryMap::const_iterator winner = local 151 if (winner == entries_.end()) 155 const std::string& ext_id = winner->first; 168 ExtensionEntryMap::const_iterator winner local [all...] |
/external/chromium/base/metrics/ |
H A D | field_trial_unittest.cc | 85 const std::string winner = "TheWinner"; local 86 int winner_group = trial_true->AppendGroup(winner, 10); 89 EXPECT_EQ(winner, trial_true->group_name()); 101 // First create a test that hasn't had a winner yet. 102 const std::string winner = "Winner"; local 108 trial = new FieldTrial(name, 10, winner, next_year_, 12, 31); 113 // And that 'default' group (winner) should always win. 116 // And that winner should ALWAYS win. 117 EXPECT_EQ(winner, trial->group_name()); 226 // There is no winner ye [all...] |
/external/icu4c/i18n/ |
H A D | nfrs.cpp | 524 int32_t winner = 0; local 548 winner = i; 561 if ((unsigned)(winner + 1) < rules.size() && 562 rules[winner + 1]->getBaseValue() == rules[winner]->getBaseValue()) { 563 double n = ((double)rules[winner]->getBaseValue()) * number; 565 ++winner; 570 return rules[winner];
|
/external/ppp/pppd/ |
H A 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);
|
H A D | pppd.h | 111 short int winner; member in struct:__anon10846
|
/external/webkit/Source/WebCore/dom/ |
H A D | Document.cpp | 2516 Node* winner = 0; local 2519 winner = n; 2523 return winner; 2530 Node* winner = 0; local 2533 winner = n; 2537 return winner; 2551 if (Node* winner = nextNodeWithExactTabIndex(start->traverseNextNode(), start->tabIndex(), event)) 2552 return winner; 2562 if (Node* winner = nextNodeWithGreaterTabIndex(this, start ? start->tabIndex() : 0, event)) 2563 return winner; [all...] |
/external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/ |
H A D | com.ibm.icu_4.2.1.v20100412.jar | META-INF/MANIFEST.MF META-INF/ECLIPSEF.SF META-INF/ECLIPSEF.RSA META ... |
H A D | org.eclipse.jface_3.6.1.M20100825-0800.jar | META-INF/MANIFEST.MF META-INF/ECLIPSEF.SF META-INF/ECLIPSEF.RSA META ... |
H A D | org.eclipse.ui.workbench_3.6.1.M20101117-0800.jar | META-INF/MANIFEST.MF META-INF/ECLIPSEF.SF META-INF/ECLIPSEF.RSA META ... |
Completed in 301 milliseconds