| /third_party/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()
|
| /third_party/icu/ohos_icu4j/src/main/java/ohos/global/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()
|
| /third_party/node/test/fixtures/source-map/ |
| D | tabs.coffee | 21 race = (winner, runners...) ->
22 print winner, runners
|
| D | tabs.js | 33 race = function(winner, ...runners) { argument
34 return print(winner, runners);
|
| /third_party/python/Lib/ |
| D | types.py | 134 winner = meta
137 if issubclass(winner, base_meta):
139 if issubclass(base_meta, winner):
140 winner = base_meta
147 return winner
|
| /third_party/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()
|
| /third_party/skia/third_party/externals/icu/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()
|
| /third_party/flutter/skia/third_party/externals/icu/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()
|
| /third_party/node/deps/icu-small/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()
|
| /third_party/flutter/flutter/packages/flutter/test/gestures/ |
| D | arena_test.dart | 116 test('Only first winner should win', () {
127 test('Only first winner should win, regardless of order', () {
149 test('Win before close is delayed to close, and only first winner should win', () {
161 …test('Win before close is delayed to close, and only first winner should win, regardless of order'…
|
| /third_party/flutter/flutter/packages/flutter/lib/src/gestures/ |
| D | arena.dart | 63 /// "eager winner". We look for an eager winner when closing the arena to new
81 return '$member (eager winner)';
165 /// Typically, a winner is chosen in an arena after all the other
221 assert(_debugLogDiagnostic(pointer, 'Self-declared winner: $member'));
236 assert(_debugLogDiagnostic(pointer, 'Eager winner: ${state.eagerWinner}'));
249 assert(_debugLogDiagnostic(pointer, 'Default winner: ${state.members.first}'));
|
| /third_party/python/Tools/c-analyzer/c_analyzer/ |
| D | analyze.py | 181 winner, = candidates
185 winner = samefile
188 winner = samefile
193 return winner
|
| /third_party/ffmpeg/libavcodec/ |
| D | mf_utils.c | 594 IMFActivate *winner = 0; in ff_instantiate_mf() local
631 winner = activate[n]; in ff_instantiate_mf()
632 IMFActivate_AddRef(winner); in ff_instantiate_mf()
658 hr = IMFActivate_GetString(winner, &MFT_FRIENDLY_NAME_Attribute, s, in ff_instantiate_mf()
665 IMFActivate_Release(winner); in ff_instantiate_mf()
|
| /third_party/python/Lib/turtledemo/ |
| D | nim.py | 62 self.winner = None
72 self.winner = self.player
173 if self.game.model.winner == 0:
|
| /third_party/python/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
|
| /third_party/python/Objects/ |
| D | typeobject.c | 2164 PyTypeObject *base, *winner, *candidate, *base_i; in best_base() local
2171 winner = NULL; in best_base()
2192 if (winner == NULL) { in best_base()
2193 winner = candidate; in best_base()
2196 else if (PyType_IsSubtype(winner, candidate)) in best_base()
2198 else if (PyType_IsSubtype(candidate, winner)) { in best_base()
2199 winner = candidate; in best_base()
2473 PyTypeObject *winner; in _PyType_CalculateMetaclass() local
2483 winner = metatype; in _PyType_CalculateMetaclass()
2487 if (PyType_IsSubtype(winner, tmptype)) in _PyType_CalculateMetaclass()
[all …]
|
| /third_party/python/Python/ |
| D | bltinmodule.c | 108 PyObject *func, *name, *winner, *prep; in builtin___build_class__() local
180 winner = (PyObject *)_PyType_CalculateMetaclass((PyTypeObject *)meta, in builtin___build_class__()
182 if (winner == NULL) { in builtin___build_class__()
185 if (winner != meta) { in builtin___build_class__()
187 meta = winner; in builtin___build_class__()
|
| /third_party/boost/libs/bimap/doc/ |
| D | quick_tutorial.qbk | 150 [^The winner is Argentina]
|
| /third_party/boost/libs/convert/doc/ |
| D | performance.qbk | 23 Based on the results, all things considered, I tend to conclude that there is no clear winner:
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.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.
|
| /third_party/python/Misc/NEWS.d/ |
| D | 3.10.0b2.rst | 29 metaclass constructor raises an exception and the winner class is not the
|
| /third_party/boost/libs/math/doc/roots/ |
| D | root_comparison.qbk | 173 * For a __multiprecision floating-point type, the __newton is a clear winner with a several-fold ga…
|
| /third_party/boost/libs/spirit/doc/support/ |
| D | multi_pass.qbk | 101 more than 1 character (token) is definitely a winner. After which, the Kleene
|
| /third_party/boost/libs/mp11/doc/article/ |
| D | simple_cxx11_metaprogramming_2.adoc | 309 This implementation is a clear winner.
|
| /third_party/flutter/flutter/packages/flutter/lib/src/rendering/ |
| D | table.dart | 749 // winner of the 2016 world's most expensive intrinsic dimension function award
|