Searched refs:multipliers (Results 1 – 4 of 4) sorted by relevance
181 DenseMap<StringRef, uint64_t> multipliers = { in ParseUserFriendlySizeExpression() local204 auto it = multipliers.find(multiplier); in ParseUserFriendlySizeExpression()205 if (it == multipliers.end()) in ParseUserFriendlySizeExpression()
234 } multipliers[] = { in ucl_lex_num_multiplier() local241 if (tolower(c) == multipliers[i].c) { in ucl_lex_num_multiplier()243 return multipliers[i].mult_bytes; in ucl_lex_num_multiplier()245 return multipliers[i].mult_normal; in ucl_lex_num_multiplier()264 } multipliers[] = { in ucl_lex_time_multiplier() local273 if (tolower(c) == multipliers[i].c) { in ucl_lex_time_multiplier()274 return multipliers[i].mult; in ucl_lex_time_multiplier()
1342 and multipliers . . . . . . . . . . . . 257--257
2075 …multipliers $x(i)$ such that $\mbox{gcd} = x(1)a(1) + \ldots + x(n)a(n)$ is presented. The number …9854 title = "Greatest common divisor of $n$ integers and multipliers",9867 …orithm; greatest common divisor; inductive assertion method; integers; multipliers; number theory;…