| /external/icu/android_icu4j/src/main/java/android/icu/text/ |
| D | NFRuleSet.java | 642 int winner = 0; in findFractionRuleSetRule() local
665 winner = i; in findFractionRuleSetRule()
678 if (winner + 1 < rules.length in findFractionRuleSetRule()
679 && rules[winner + 1].getBaseValue() == rules[winner].getBaseValue()) { in findFractionRuleSetRule()
680 if (Math.round(number * rules[winner].getBaseValue()) < 1 in findFractionRuleSetRule()
681 || Math.round(number * rules[winner].getBaseValue()) >= 2) { in findFractionRuleSetRule()
682 ++winner; in findFractionRuleSetRule()
687 return rules[winner]; in findFractionRuleSetRule()
|
| /external/icu/icu4j/main/classes/core/src/com/ibm/icu/text/ |
| D | NFRuleSet.java | 641 int winner = 0; in findFractionRuleSetRule() local
664 winner = i; in findFractionRuleSetRule()
677 if (winner + 1 < rules.length in findFractionRuleSetRule()
678 && rules[winner + 1].getBaseValue() == rules[winner].getBaseValue()) { in findFractionRuleSetRule()
679 if (Math.round(number * rules[winner].getBaseValue()) < 1 in findFractionRuleSetRule()
680 || Math.round(number * rules[winner].getBaseValue()) >= 2) { in findFractionRuleSetRule()
681 ++winner; in findFractionRuleSetRule()
686 return rules[winner]; in findFractionRuleSetRule()
|
| /external/python/cpython3/Lib/ |
| D | types.py | 127 winner = meta
130 if issubclass(winner, base_meta):
132 if issubclass(base_meta, winner):
133 winner = base_meta
140 return winner
|
| /external/libchrome/base/synchronization/ |
| D | waitable_event_posix.cc | 332 size_t winner = count; in EnqueueMany() local
337 if (kernel->signaled_ && waitables[i].second < winner) { in EnqueueMany()
338 winner = waitables[i].second; in EnqueueMany()
345 if (winner == count) { in EnqueueMany()
355 if (w->second == winner) { in EnqueueMany()
|
| /external/icu/icu4c/source/i18n/ |
| D | nfrs.cpp | 598 int32_t winner = 0; in findFractionRuleSetRule() local
622 winner = i; in findFractionRuleSetRule()
635 if ((unsigned)(winner + 1) < rules.size() && in findFractionRuleSetRule()
636 rules[winner + 1]->getBaseValue() == rules[winner]->getBaseValue()) { in findFractionRuleSetRule()
637 double n = ((double)rules[winner]->getBaseValue()) * number; in findFractionRuleSetRule()
639 ++winner; in findFractionRuleSetRule()
644 return rules[winner]; in findFractionRuleSetRule()
|
| /external/python/cpython2/Demo/turtle/ |
| D | tdemo_nim.py | 62 self.winner = None
72 self.winner = self.player
174 if self.game.model.winner == 0:
|
| /external/python/cpython3/Lib/turtledemo/ |
| D | nim.py | 62 self.winner = None
72 self.winner = self.player
173 if self.game.model.winner == 0:
|
| /external/libchrome/base/metrics/ |
| D | field_trial_unittest.cc | 155 const std::string winner = "TheWinner"; in TEST_F() local
156 int winner_group = trial_true->AppendGroup(winner, 10); in TEST_F()
159 EXPECT_EQ(winner, trial_true->group_name()); in TEST_F()
171 const std::string winner = "Winner"; in TEST_F() local
178 trial = CreateFieldTrial(name, 10, winner, &default_group_number); in TEST_F()
187 EXPECT_EQ(winner, trial->group_name()); in TEST_F()
308 std::string winner("Winner"); in TEST_F() local
309 trial->AppendGroup(winner, 10); in TEST_F()
315 EXPECT_EQ(winner, active_group.group_name); in TEST_F()
339 winner == active_groups[i].group_name); in TEST_F()
|
| /external/skia/src/compute/skc/platforms/cl_12/kernels/ |
| D | rasterize.cl | 164 // SIMT subgroup scratchpad for max scan -- also shared with 'winner' member
170 skc_uint winner;
1208 uint const winner = ((uint*)&hash)[cc];
1209 uint const component_bit = 1u << winner;
1219 // new winner requires ejecting the old TTSB
1221 if (smem->bin.aN.count[winner] > 0)
1223 …skc_uint const elem_idx = smem->bin.aN.id[winner] * SKC_DEVICE_SUBBLOCK_WORDS + skc_subgroup_lane(…
1225 bp_elems[elem_idx].u32 = smem->bin.aN.ttsb[winner][skc_subgroup_lane()];
1271 smem->bin.vN.ttsb [winner] = ( SKC_TTS_INVALID );
1272 smem->bin.aN.id [winner] = smem->pool.aN.id[ttsb_id_count];
[all …]
|
| /external/skqp/src/compute/skc/platforms/cl_12/kernels/ |
| D | rasterize.cl | 164 // SIMT subgroup scratchpad for max scan -- also shared with 'winner' member
170 skc_uint winner;
1208 uint const winner = ((uint*)&hash)[cc];
1209 uint const component_bit = 1u << winner;
1219 // new winner requires ejecting the old TTSB
1221 if (smem->bin.aN.count[winner] > 0)
1223 …skc_uint const elem_idx = smem->bin.aN.id[winner] * SKC_DEVICE_SUBBLOCK_WORDS + skc_subgroup_lane(…
1225 bp_elems[elem_idx].u32 = smem->bin.aN.ttsb[winner][skc_subgroup_lane()];
1271 smem->bin.vN.ttsb [winner] = ( SKC_TTS_INVALID );
1272 smem->bin.aN.id [winner] = smem->pool.aN.id[ttsb_id_count];
[all …]
|
| /external/python/cpython2/Doc/library/ |
| D | 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/ |
| D | heapq.rst | 260 binary tournament we see in sports, each cell is the winner over the two cells
261 it tops, and we can trace the winner down the tree to see all opponents s/he
263 to trace the history of a winner. To be more memory efficient, when a winner is
269 winner. The simplest algorithmic way to remove it and find the "next" winner is
|
| /external/one-true-awk/ |
| D | main.c | 187 run(winner); in main()
|
| D | awk.h | 150 extern Node *winner;
|
| D | awkgram.y | 99 winner = (Node *)stat3(PROGRAM, beginloc, $1, endloc); }
|
| /external/python/cpython3/Objects/ |
| D | typeobject.c | 2010 PyTypeObject *base, *winner, *candidate, *base_i; in best_base() local
2017 winner = NULL; in best_base()
2038 if (winner == NULL) { in best_base()
2039 winner = candidate; in best_base()
2042 else if (PyType_IsSubtype(winner, candidate)) in best_base()
2044 else if (PyType_IsSubtype(candidate, winner)) { in best_base()
2045 winner = candidate; in best_base()
2317 PyTypeObject *winner; in _PyType_CalculateMetaclass() local
2327 winner = metatype; in _PyType_CalculateMetaclass()
2331 if (PyType_IsSubtype(winner, tmptype)) in _PyType_CalculateMetaclass()
[all …]
|
| /external/swiftshader/third_party/llvm-7.0/llvm/test/Transforms/LoopStrengthReduce/X86/ |
| D | lsr-filtering-scaledreg.ll | 23 ; to narrow LSR search space by picking winner reg will generate only one lsr.iv and
|
| /external/python/cpython2/Objects/ |
| D | typeobject.c | 1728 PyTypeObject *base, *winner, *candidate, *base_i; in best_base() local
1735 winner = NULL; in best_base()
1758 if (winner == NULL) { in best_base()
1759 winner = candidate; in best_base()
1762 else if (PyType_IsSubtype(winner, candidate)) in best_base()
1764 else if (PyType_IsSubtype(candidate, winner)) { in best_base()
1765 winner = candidate; in best_base()
2099 PyTypeObject *type, *base, *tmptype, *winner; in type_new() local
2141 winner = metatype; in type_new()
2147 if (PyType_IsSubtype(winner, tmptype)) in type_new()
[all …]
|
| /external/ppp/pppd/ |
| D | options.c | 831 mainopt->winner = opt - mainopt;
858 opt->winner = -1;
1013 && opt->winner != (short int) -1)
1014 print_option(opt + opt->winner, opt, printer, arg);
|
| D | pppd.h | 111 short int winner; member
|
| /external/cldr/tools/cldr-unittest/src/org/unicode/cldr/unittest/ |
| D | TestUtilities.java | 769 String winner = resolver.getWinningValue(); in TestTotalVotesStatus() local
771 assertEquals("", "apple", winner); in TestTotalVotesStatus()
783 winner = resolver.getWinningValue(); in TestTotalVotesStatus()
785 assertEquals("", "zebra", winner); in TestTotalVotesStatus()
|
| /external/python/cpython3/Python/ |
| D | bltinmodule.c | 131 PyObject *func, *name, *bases, *mkw, *meta, *winner, *prep, *ns, *orig_bases; in builtin___build_class__() local
203 winner = (PyObject *)_PyType_CalculateMetaclass((PyTypeObject *)meta, in builtin___build_class__()
205 if (winner == NULL) { in builtin___build_class__()
211 if (winner != meta) { in builtin___build_class__()
213 meta = winner; in builtin___build_class__()
|
| /external/cldr/tools/java/org/unicode/cldr/test/ |
| D | CheckCLDR.java | 219 CandidateInfo winner = pathValueInfo.getCurrentItem(); in getShowRowAction() local
223 valueStatus = getValueStatus(winner, valueStatus); in getShowRowAction()
|
| /external/swiftshader/third_party/llvm-7.0/llvm/lib/Target/ |
| D | README.txt | 1000 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/swiftshader/third_party/LLVM/lib/Target/ |
| D | README.txt | 1044 int winner, numf2s;
1049 winner = 0;
1051 if (Y[i].y > Y[winner].y)
1052 winner =i;
1080 sunk the store to winner out.
1085 Beyond that, we have a partially redundant load in the loop: if "winner" (aka
1086 %i.01718) isn't updated, we reload Y[winner].y the next time through the loop.
|