Searched refs:getBaseValue (Results 1 – 3 of 3) sorted by relevance
278 if (rule->getBaseValue() < defaultBaseValue) { in parseRules()283 defaultBaseValue = rule->getBaseValue(); in parseRules()453 if (rules[mid]->getBaseValue() == number) { in findNormalRule()456 else if (rules[mid]->getBaseValue() > number) { in findNormalRule()513 int64_t leastCommonMultiple = rules[0]->getBaseValue(); in findFractionRuleSetRule()517 leastCommonMultiple = util_lcm(leastCommonMultiple, rules[i]->getBaseValue()); in findFractionRuleSetRule()532 tempDifference = numerator * rules[i]->getBaseValue() % leastCommonMultiple; in findFractionRuleSetRule()562 rules[winner + 1]->getBaseValue() == rules[winner]->getBaseValue()) { in findFractionRuleSetRule()563 double n = ((double)rules[winner]->getBaseValue()) * number; in findFractionRuleSetRule()697 if ((!fIsFractionRuleSet) && (rules[i]->getBaseValue() >= ub)) { in parse()
372 if (rule->getBaseValue() == NFRule::kNegativeNumberRule) { in makeSubstitution()380 else if (rule->getBaseValue() == NFRule::kImproperFractionRule in makeSubstitution()381 || rule->getBaseValue() == NFRule::kProperFractionRule in makeSubstitution()382 || rule->getBaseValue() == NFRule::kMasterRule) { in makeSubstitution()389 return new NumeratorSubstitution(pos, (double)rule->getBaseValue(), in makeSubstitution()403 if (rule->getBaseValue() == NFRule::kNegativeNumberRule) { in makeSubstitution()409 else if (rule->getBaseValue() == NFRule::kImproperFractionRule in makeSubstitution()410 || rule->getBaseValue() == NFRule::kProperFractionRule in makeSubstitution()411 || rule->getBaseValue() == NFRule::kMasterRule) { in makeSubstitution()
59 int64_t getBaseValue() const { return baseValue; } in getBaseValue() function