| /external/chromium/chrome/browser/extensions/ |
| extension_pref_store.cc | 29 const Value *winner = local
33 if (winner)
34 SetValue(key, winner->DeepCopy());
|
| 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 = entries_.end() local
[all...] |
| extension_pref_value_map_unittest.cc | 289 int effective_value_regular_; // desired winner regular
290 int effective_value_incognito_; // desired winner incognito
|
| /external/chromium_org/chrome/browser/extensions/ |
| extension_pref_store.cc | 24 const Value *winner = local
28 if (winner)
29 SetValue(key, winner->DeepCopy());
|
| extension_pref_value_map.cc | 77 ExtensionEntryMap::const_iterator winner = local
79 if (winner == entries_.end())
82 return winner->second->install_time <= ext->second->install_time;
109 ExtensionEntryMap::const_iterator winner = local
111 if (winner == entries_.end())
113 return winner->first == extension_id;
221 ExtensionEntryMap::const_iterator winner = local
223 if (winner == entries_.end())
227 const std::string& ext_id = winner->first;
266 ExtensionEntryMap::const_iterator winner = entries_.end() local
[all...] |
| extension_pref_value_map_unittest.cc | 312 int effective_value_regular_; // desired winner regular
313 int effective_value_incognito_; // desired winner incognito
|
| /external/chromium/base/metrics/ |
| 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())
[all...] |
| /external/chromium_org/base/metrics/ |
| field_trial_unittest.cc | 122 const std::string winner = "TheWinner"; local
123 int winner_group = trial_true->AppendGroup(winner, 10);
126 EXPECT_EQ(winner, trial_true->group_name());
137 // First create a test that hasn't had a winner yet.
138 const std::string winner = "Winner"; local
145 trial = CreateFieldTrial(name, 10, winner, &default_group_number);
150 // And that 'default' group (winner) should always win.
153 // And that winner should ALWAYS win.
154 EXPECT_EQ(winner, trial->group_name())
[all...] |
| /external/chromium_org/chrome/common/metrics/variations/ |
| variations_associated_data_unittest.cc | 99 const std::string winner = "TheWinner"; local
100 int winner_group = trial_true->AppendGroup(winner, 10);
106 winner, TEST_VALUE_B);
109 EXPECT_EQ(winner, trial_true->group_name());
136 const std::string winner = "TheWinner"; local
137 const int winner_group = no_id_trial->AppendGroup(winner, 10);
139 // Ensure that despite the fact that a normal winner is elected, it does not
142 EXPECT_EQ(winner, no_id_trial->group_name());
|
| /external/chromium_org/third_party/WebKit/PerformanceTests/Dromaeo/resources/dromaeo/web/ |
| web-style.css | 24 table.results .winner { background-color: #c7331d; }
|
| application.css | 15 table.results .winner { color: #000; background-color: #c7331d; }
74 table.results .winner {background: #58bd79;}
|
| /external/chromium_org/third_party/WebKit/Source/core/page/ |
| FocusController.cpp | 444 Node* winner = 0; local
447 winner = node;
452 return winner;
459 Node* winner = 0; local
463 winner = node;
467 return winner;
485 if (Node* winner = findNodeWithExactTabIndex(nextInScope(start), tabIndex, FocusDirectionForward))
486 return winner;
496 if (Node* winner = nextNodeWithGreaterTabIndex(scope.rootNode(), start ? adjustedTabIndex(start) : 0))
497 return winner;
[all...] |
| /frameworks/base/core/tests/coretests/src/android/os/ |
| BroadcasterTest.java | 97 boolean winner = true;
100 winner = false;
103 if (winner) {
|
| /dalvik/libdex/ |
| DexCatch.cpp | 75 // We have a winner!
|
| DexDataMap.cpp | 111 // We have a winner!
|
| /external/chromium_org/chrome/browser/search_engines/ |
| template_url_service_util_unittest.cc | 77 EXPECT_TRUE(StartsWith((*itr)->keyword(), ASCIIToUTF16("winner"), true));
|
| /external/chromium_org/third_party/icu/source/i18n/ |
| nfrs.cpp | 499 int32_t winner = 0; local
523 winner = i;
536 if ((unsigned)(winner + 1) < rules.size() &&
537 rules[winner + 1]->getBaseValue() == rules[winner]->getBaseValue()) {
538 double n = ((double)rules[winner]->getBaseValue()) * number;
540 ++winner;
545 return rules[winner];
|
| /external/icu4c/i18n/ |
| 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/chromium_org/third_party/opus/src/silk/ |
| NSQ_del_dec.c | 202 /* Find winner */
218 /* Copy final part of signals from winner state to output and long-term filter states */
257 /* Find winner */
267 /* Copy final part of signals from winner state to output and long-term filter states */
539 /* Find winner */
[all...] |
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/ |
| heapq.py | 59 an usual binary tournament we see in sports, each cell is the winner
60 over the two cells it tops, and we can trace the winner down the tree
62 of such tournaments, we do not need to trace the history of a winner.
63 To be more memory efficient, when a winner is promoted, we try to
69 the overall winner. The simplest algorithmic way to remove it and
70 find the "next" winner is to move some loser (let's say cell 30 in the
|
| textwrap.py | 396 # Current line more deeply indented than previous winner:
397 # no change (previous winner is still on top).
401 # Current line consistent with and no deeper than previous winner:
402 # it's the new winner.
406 # Current line and previous winner have no common whitespace:
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/ |
| heapq.py | 59 an usual binary tournament we see in sports, each cell is the winner
60 over the two cells it tops, and we can trace the winner down the tree
62 of such tournaments, we do not need to trace the history of a winner.
63 To be more memory efficient, when a winner is promoted, we try to
69 the overall winner. The simplest algorithmic way to remove it and
70 find the "next" winner is to move some loser (let's say cell 30 in the
|
| textwrap.py | 396 # Current line more deeply indented than previous winner:
397 # no change (previous winner is still on top).
401 # Current line consistent with and no deeper than previous winner:
402 # it's the new winner.
406 # Current line and previous winner have no common whitespace:
|
| /external/chromium_org/chrome/browser/extensions/api/declarative_webrequest/ |
| webrequest_rules_registry_unittest.cc | 430 LinkedPtrEventResponseDelta winner = *i++; local
433 EXPECT_EQ(kExtensionId2, winner->extension_id);
435 winner->extension_install_time);
436 EXPECT_EQ(GURL("http://www.bar.com"), winner->new_url);
[all...] |
| /external/dropbear/libtomcrypt/src/pk/asn1/der/choice/ |
| der_decode_choice.c | 48 /* now scan until we have a winner */
|
