Searched refs:multipliers (Results 1 – 6 of 6) sorted by relevance
181 DenseMap<StringRef, uint64_t> multipliers = { in ParseUserFriendlySizeExpression() 204 auto it = multipliers.find(multiplier); in ParseUserFriendlySizeExpression() 205 if (it == multipliers.end()) in ParseUserFriendlySizeExpression() 183 DenseMap<StringRef, uint64_t> multipliers = { ParseUserFriendlySizeExpression() local
198 * Numbers can have suffixes to specify standard multipliers:199 + `[kKmMgG]` - standard 10 base multipliers (so `1k` is translated to 1000)200 + `[kKmMgG]b` - 2 power multipliers (so `1kb` is translated to 1024)201 …+ `[s|min|d|w|y]` - time multipliers, all time values are translated to float number of seconds, f…
230 } multipliers[] = { in ucl_lex_num_multiplier() local238 if (tolower (c) == multipliers[i].c) { in ucl_lex_num_multiplier()240 return multipliers[i].mult_bytes; in ucl_lex_num_multiplier()242 return multipliers[i].mult_normal; in ucl_lex_num_multiplier()260 } multipliers[] = { in ucl_lex_time_multiplier() local270 if (tolower (c) == multipliers[i].c) { in ucl_lex_time_multiplier()271 return multipliers[i].mult; in ucl_lex_time_multiplier()
374 - `UCL_STRING_PARSE_BYTES` - assume that numeric multipliers are in bytes notation, for example `10…
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;…