Searched refs:winner (Results 1 – 5 of 5) sorted by relevance
499 int32_t winner = 0; in findFractionRuleSetRule() local523 winner = i; in findFractionRuleSetRule()536 if ((unsigned)(winner + 1) < rules.size() && in findFractionRuleSetRule()537 rules[winner + 1]->getBaseValue() == rules[winner]->getBaseValue()) { in findFractionRuleSetRule()538 double n = ((double)rules[winner]->getBaseValue()) * number; in findFractionRuleSetRule()540 ++winner; in findFractionRuleSetRule()545 return rules[winner]; in findFractionRuleSetRule()
794 mainopt->winner = opt - mainopt;821 opt->winner = -1;979 && opt->winner != (short int) -1)980 print_option(opt + opt->winner, opt, printer, arg);
111 short int winner; member
1988 Node* winner = 0; in nextNodeWithGreaterTabIndex() local1991 winner = n; in nextNodeWithGreaterTabIndex()1995 return winner; in nextNodeWithGreaterTabIndex()2002 Node* winner = 0; in previousNodeWithLowerTabIndex() local2005 winner = n; in previousNodeWithLowerTabIndex()2009 return winner; in previousNodeWithLowerTabIndex()2023 … if (Node* winner = nextNodeWithExactTabIndex(start->traverseNextNode(), start->tabIndex(), event)) in nextFocusableNode() local2024 return winner; in nextFocusableNode()2034 if (Node* winner = nextNodeWithGreaterTabIndex(this, start ? start->tabIndex() : 0, event)) in nextFocusableNode() local2035 return winner; in nextFocusableNode()[all …]
32226 winner winP