| /external/tensorflow/tensorflow/examples/image_retraining/data/ |
| labels.txt | 2 Winner
|
| /frameworks/base/services/core/java/com/android/server/audio/ |
| PlayerFocusEnforcer.java | 24 * @param winner
28 public boolean duckPlayers(FocusRequester winner, FocusRequester loser, boolean forceDuck);
30 public void unduckPlayers(FocusRequester winner);
|
| PlaybackActivityMonitor.java | 428 public boolean duckPlayers(FocusRequester winner, FocusRequester loser, boolean forceDuck) {
430 Log.v(TAG, String.format("duckPlayers: uids winner=%d loser=%d",
431 winner.getClientUid(), loser.getClientUid()));
444 if (!winner.hasSameUid(apc.getClientUid())
476 public void unduckPlayers(FocusRequester winner) {
477 if (DEBUG) { Log.v(TAG, "unduckPlayers: uids winner=" + winner.getClientUid()); }
479 mDuckingManager.unduckUid(winner.getClientUid(), mPlayers);
[all...] |
| /external/libchrome/base/metrics/ |
| field_trial_unittest.cc | 136 const std::string winner = "TheWinner"; local
137 int winner_group = trial_true->AppendGroup(winner, 10);
140 EXPECT_EQ(winner, trial_true->group_name());
151 // First create a test that hasn't had a winner yet.
152 const std::string winner = "Winner"; local
159 trial = CreateFieldTrial(name, 10, winner, &default_group_number);
164 // And that 'default' group (winner) should always win.
167 // And that winner should ALWAYS win.
168 EXPECT_EQ(winner, trial->group_name())
[all...] |
| /external/tensorflow/tensorflow/core/kernels/ |
| gpu_utils.h | 44 // they get promoted; otherwise, the winner gets demoted. This process stops
45 // when the winner's score exceeds the threshold.
78 // If it is different from the current winner, demotes the winner.
87 // If it is the same as the current winner, promotes the winner.
|
| /prebuilts/go/darwin-x86/doc/codewalk/ |
| pig.go | 56 // play simulates a Pig game and returns the winner (0 or 1).
78 winner := play(strategies[i], strategies[j])
79 if winner == 0 {
|
| /prebuilts/go/linux-x86/doc/codewalk/ |
| pig.go | 56 // play simulates a Pig game and returns the winner (0 or 1).
78 winner := play(strategies[i], strategies[j])
79 if winner == 0 {
|
| /external/python/cpython2/Demo/turtle/ |
| tdemo_nim.py | 6 who takes the last stick is the winner.
62 self.winner = None
72 self.winner = self.player
174 if self.game.model.winner == 0:
175 msg2 = "Congrats. You're the winner!!!"
177 msg2 = "Sorry, the computer is the winner."
|
| /external/python/cpython3/Lib/turtledemo/ |
| nim.py | 6 who takes the last stick is the winner.
62 self.winner = None
72 self.winner = self.player
173 if self.game.model.winner == 0:
174 msg2 = "Congrats. You're the winner!!!"
176 msg2 = "Sorry, the computer is the winner."
|
| /external/python/cpython3/Lib/ |
| types.py | 98 winner = meta
101 if issubclass(winner, base_meta):
103 if issubclass(base_meta, winner):
104 winner = base_meta
111 return winner
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/lib-dynload/ |
| _heapq.so | |
| /frameworks/base/core/tests/coretests/src/android/os/ |
| BroadcasterTest.java | 97 boolean winner = true;
100 winner = false;
103 if (winner) {
|
| /external/python/cpython2/Doc/library/ |
| heapq.rst | 248 binary tournament we see in sports, each cell is the winner over the two cells
249 it tops, and we can trace the winner down the tree to see all opponents s/he
251 to trace the history of a winner. To be more memory efficient, when a winner is
257 winner. The simplest algorithmic way to remove it and find the "next" winner is
|
| /external/python/cpython3/Doc/library/ |
| heapq.rst | 247 binary tournament we see in sports, each cell is the winner over the two cells
248 it tops, and we can trace the winner down the tree to see all opponents s/he
250 to trace the history of a winner. To be more memory efficient, when a winner is
256 winner. The simplest algorithmic way to remove it and find the "next" winner is
|
| /dalvik/libdex/ |
| DexCatch.cpp | 75 // We have a winner!
|
| DexDataMap.cpp | 112 // We have a winner!
|
| /external/icu/android_icu4j/src/main/java/android/icu/text/ |
| NFRuleSet.java | 639 int winner = 0; local
662 winner = i;
675 if (winner + 1 < rules.length
676 && rules[winner + 1].getBaseValue() == rules[winner].getBaseValue()) {
677 if (Math.round(number * rules[winner].getBaseValue()) < 1
678 || Math.round(number * rules[winner].getBaseValue()) >= 2) {
679 ++winner;
684 return rules[winner];
[all...] |
| /external/icu/icu4j/main/classes/core/src/com/ibm/icu/text/ |
| NFRuleSet.java | 638 int winner = 0; local
661 winner = i;
674 if (winner + 1 < rules.length
675 && rules[winner + 1].getBaseValue() == rules[winner].getBaseValue()) {
676 if (Math.round(number * rules[winner].getBaseValue()) < 1
677 || Math.round(number * rules[winner].getBaseValue()) >= 2) {
678 ++winner;
683 return rules[winner];
[all...] |
| /external/apache-commons-math/src/main/java/org/apache/commons/math/genetics/ |
| TournamentSelection.java | 92 // the winner takes it all
|
| /external/libunwind/src/coredump/ |
| _UPT_get_dyn_info_list_addr.c | 101 dynamic name resolution algorithm will pick one "winner").
|
| /external/libunwind/src/ptrace/ |
| _UPT_get_dyn_info_list_addr.c | 96 dynamic name resolution algorithm will pick one "winner").
|
| /external/skia/src/core/ |
| SkPixelRef.cpp | 81 // We lost a race to set fTaggedGenID. compare_exchange() filled id with the winner.
|
| /external/skqp/src/core/ |
| SkPixelRef.cpp | 81 // We lost a race to set fTaggedGenID. compare_exchange() filled id with the winner.
|
| /external/icu/icu4c/source/i18n/ |
| nfrs.cpp | 598 int32_t winner = 0; local
622 winner = i;
635 if ((unsigned)(winner + 1) < rules.size() &&
636 rules[winner + 1]->getBaseValue() == rules[winner]->getBaseValue()) {
637 double n = ((double)rules[winner]->getBaseValue()) * number;
639 ++winner;
644 return rules[winner];
|
| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.10/Lib/ |
| 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
|
