Home
last modified time | relevance | path

Searched refs:digit_count (Results 1 – 25 of 259) sorted by relevance

1234567891011

/dports/lang/zig-devel/zig-0.9.0/src/stage1/
H A Dbigint.cpp178 dest->digit_count = digit_count; in bigint_init_data()
196 dest->digit_count = src->digit_count; in bigint_init_bigint()
744 if (op1->digit_count == 0 || op2->digit_count == 0) { in bigint_mul()
1167 if (op1->digit_count == 1 && op2->digit_count == 1) { in bigint_div_trunc()
1233 if (op1->digit_count == 1 && op2->digit_count == 1) { in bigint_rem()
1322 dest->digit_count = max(op1->digit_count, op2->digit_count); in bigint_or()
1366 dest->digit_count = max(op1->digit_count, op2->digit_count); in bigint_and()
1412 dest->digit_count = max(op1->digit_count, op2->digit_count); in bigint_xor()
1596 assert(dest->digit_count >= op->digit_count); in bigint_not()
1625 } else if (op1->digit_count > op2->digit_count) { in bigint_cmp()
[all …]
/dports/lang/zig/zig-0.9.0/src/stage1/
H A Dbigint.cpp178 dest->digit_count = digit_count; in bigint_init_data()
196 dest->digit_count = src->digit_count; in bigint_init_bigint()
744 if (op1->digit_count == 0 || op2->digit_count == 0) { in bigint_mul()
1167 if (op1->digit_count == 1 && op2->digit_count == 1) { in bigint_div_trunc()
1233 if (op1->digit_count == 1 && op2->digit_count == 1) { in bigint_rem()
1322 dest->digit_count = max(op1->digit_count, op2->digit_count); in bigint_or()
1366 dest->digit_count = max(op1->digit_count, op2->digit_count); in bigint_and()
1412 dest->digit_count = max(op1->digit_count, op2->digit_count); in bigint_xor()
1596 assert(dest->digit_count >= op->digit_count); in bigint_not()
1625 } else if (op1->digit_count > op2->digit_count) { in bigint_cmp()
[all …]
/dports/math/gismo/gismo-21.12.0/external/onurbs/
H A Dopennurbs_base32.cpp21 int digit_count = base32_digits.Count(); in ON_Base32ToString() local
22 sBase32.ReserveArray(digit_count); in ON_Base32ToString()
23 sBase32.SetLength(digit_count); in ON_Base32ToString()
156 base32_digits.SetCount(digit_count); in ON_StringToBase32()
157 return digit_count; in ON_StringToBase32()
163 int digit_count = 0; in ON_StringToBase32() local
171 base32_digits[digit_count++] = c - '0'; in ON_StringToBase32()
175 base32_digits[digit_count++] = 9 + c - 'A'; in ON_StringToBase32()
177 base32_digits[digit_count++] = 8 + c - 'A'; in ON_StringToBase32()
184 digit_count = 0; in ON_StringToBase32()
[all …]
/dports/graphics/pcl-pointclouds/pcl-pcl-1.12.0/surface/src/3rdparty/opennurbs/
H A Dopennurbs_base32.cpp21 int digit_count = base32_digits.Count(); in ON_Base32ToString() local
22 sBase32.ReserveArray(digit_count); in ON_Base32ToString()
23 sBase32.SetLength(digit_count); in ON_Base32ToString()
156 base32_digits.SetCount(digit_count); in ON_StringToBase32()
157 return digit_count; in ON_StringToBase32()
163 int digit_count = 0; in ON_StringToBase32() local
171 base32_digits[digit_count++] = c - '0'; in ON_StringToBase32()
175 base32_digits[digit_count++] = 9 + c - 'A'; in ON_StringToBase32()
177 base32_digits[digit_count++] = 8 + c - 'A'; in ON_StringToBase32()
184 digit_count = 0; in ON_StringToBase32()
[all …]
/dports/databases/redisdesktopmanager/RedisDesktopManager-2021.8/3rdparty/simdjson/include/simdjson/generic/
H A Dnumberparsing.h472 if (simdjson_unlikely(digit_count > 19 && significant_digits(start_digits, digit_count) > 19)) { in compute_float_64()
714 if ((digit_count == 0) || (digit_count > 20)) { return INCORRECT_TYPE; } in compute_float_64()
724 if (digit_count == 20) { in compute_float_64()
764 if ((digit_count == 0) || (digit_count > 20)) { return INCORRECT_TYPE; } in compute_float_64()
774 if (digit_count == 20) { in compute_float_64()
812 if ((digit_count == 0) || (digit_count > 20)) { return INCORRECT_TYPE; } in compute_float_64()
822 if (digit_count == 20) { in compute_float_64()
867 if ((digit_count == 0) || (digit_count > longest_digit_count)) { return INCORRECT_TYPE; } in compute_float_64()
911 if ((digit_count == 0) || (digit_count > longest_digit_count)) { return INCORRECT_TYPE; } in compute_float_64()
953 if ((digit_count == 0) || (digit_count > longest_digit_count)) { return INCORRECT_TYPE; } in compute_float_64()
[all …]
/dports/math/cln/cln-1.3.6/src/real/format-output/
H A Dcl_fmt_floatstring.cc185 var uintL digit_count = 0; // Zahl der bisher in digit-string in format_float_to_string() local
192 point_pos = digit_count; in format_float_to_string()
195 digit_count++; in format_float_to_string()
205 point_pos = digit_count; in format_float_to_string()
223 digit_count++; in format_float_to_string()
231 digit_count++; in format_float_to_string()
237 digit_count++; in format_float_to_string()
240 point_pos = digit_count; in format_float_to_string()
243 for (int i = d - (digit_count - point_pos); i >= 0; i--) { in format_float_to_string()
245 digit_count++; in format_float_to_string()
[all …]
/dports/science/py-cirq-aqt/Cirq-0.12.0/cirq-core/cirq/value/
H A Ddigits_test.py67 _ = cirq.big_endian_int_to_digits(0, base=[], digit_count=1)
69 _ = cirq.big_endian_int_to_digits(0, base=[2, 3], digit_count=20)
71 assert cirq.big_endian_int_to_digits(101, base=[], digit_count=0) == []
75 assert cirq.big_endian_int_to_digits(0, base=[], digit_count=0) == []
77 assert cirq.big_endian_int_to_digits(11, base=3, digit_count=4) == [0, 1, 0, 2]
78 assert cirq.big_endian_int_to_digits(11, base=[3, 3, 3, 3], digit_count=4) == [0, 1, 0, 2]
79 assert cirq.big_endian_int_to_digits(11, base=[2, 3, 4], digit_count=3) == [0, 2, 3]
82 assert cirq.big_endian_int_to_digits(11, base=(e for e in [2, 3, 4]), digit_count=3) == [
H A Ddigits.py123 def big_endian_int_to_digits(val: int, *, digit_count: int, base: int) -> List[int]:
133 val: int, *, digit_count: Optional[int] = None, base: Union[int, Iterable[int]]
166 if digit_count is None:
168 base = (base,) * digit_count
171 if digit_count is None:
172 digit_count = len(base)
174 if len(base) != digit_count:
/dports/science/py-cirq-pasqal/Cirq-0.13.1/cirq-core/cirq/value/
H A Ddigits_test.py67 _ = cirq.big_endian_int_to_digits(0, base=[], digit_count=1)
69 _ = cirq.big_endian_int_to_digits(0, base=[2, 3], digit_count=20)
71 assert cirq.big_endian_int_to_digits(101, base=[], digit_count=0) == []
75 assert cirq.big_endian_int_to_digits(0, base=[], digit_count=0) == []
77 assert cirq.big_endian_int_to_digits(11, base=3, digit_count=4) == [0, 1, 0, 2]
78 assert cirq.big_endian_int_to_digits(11, base=[3, 3, 3, 3], digit_count=4) == [0, 1, 0, 2]
79 assert cirq.big_endian_int_to_digits(11, base=[2, 3, 4], digit_count=3) == [0, 2, 3]
82 assert cirq.big_endian_int_to_digits(11, base=(e for e in [2, 3, 4]), digit_count=3) == [
H A Ddigits.py123 def big_endian_int_to_digits(val: int, *, digit_count: int, base: int) -> List[int]:
133 val: int, *, digit_count: Optional[int] = None, base: Union[int, Iterable[int]]
166 if digit_count is None:
168 base = (base,) * digit_count
171 if digit_count is None:
172 digit_count = len(base)
174 if len(base) != digit_count:
/dports/science/py-cirq-core/Cirq-0.13.1/cirq-core/cirq/value/
H A Ddigits_test.py67 _ = cirq.big_endian_int_to_digits(0, base=[], digit_count=1)
69 _ = cirq.big_endian_int_to_digits(0, base=[2, 3], digit_count=20)
71 assert cirq.big_endian_int_to_digits(101, base=[], digit_count=0) == []
75 assert cirq.big_endian_int_to_digits(0, base=[], digit_count=0) == []
77 assert cirq.big_endian_int_to_digits(11, base=3, digit_count=4) == [0, 1, 0, 2]
78 assert cirq.big_endian_int_to_digits(11, base=[3, 3, 3, 3], digit_count=4) == [0, 1, 0, 2]
79 assert cirq.big_endian_int_to_digits(11, base=[2, 3, 4], digit_count=3) == [0, 2, 3]
82 assert cirq.big_endian_int_to_digits(11, base=(e for e in [2, 3, 4]), digit_count=3) == [
H A Ddigits.py123 def big_endian_int_to_digits(val: int, *, digit_count: int, base: int) -> List[int]:
133 val: int, *, digit_count: Optional[int] = None, base: Union[int, Iterable[int]]
166 if digit_count is None:
168 base = (base,) * digit_count
171 if digit_count is None:
172 digit_count = len(base)
174 if len(base) != digit_count:
/dports/science/py-cirq-google/Cirq-0.13.0/cirq-core/cirq/value/
H A Ddigits_test.py67 _ = cirq.big_endian_int_to_digits(0, base=[], digit_count=1)
69 _ = cirq.big_endian_int_to_digits(0, base=[2, 3], digit_count=20)
71 assert cirq.big_endian_int_to_digits(101, base=[], digit_count=0) == []
75 assert cirq.big_endian_int_to_digits(0, base=[], digit_count=0) == []
77 assert cirq.big_endian_int_to_digits(11, base=3, digit_count=4) == [0, 1, 0, 2]
78 assert cirq.big_endian_int_to_digits(11, base=[3, 3, 3, 3], digit_count=4) == [0, 1, 0, 2]
79 assert cirq.big_endian_int_to_digits(11, base=[2, 3, 4], digit_count=3) == [0, 2, 3]
82 assert cirq.big_endian_int_to_digits(11, base=(e for e in [2, 3, 4]), digit_count=3) == [
H A Ddigits.py123 def big_endian_int_to_digits(val: int, *, digit_count: int, base: int) -> List[int]:
133 val: int, *, digit_count: Optional[int] = None, base: Union[int, Iterable[int]]
166 if digit_count is None:
168 base = (base,) * digit_count
171 if digit_count is None:
172 digit_count = len(base)
174 if len(base) != digit_count:
/dports/science/py-cirq-ionq/Cirq-0.13.1/cirq-core/cirq/value/
H A Ddigits_test.py67 _ = cirq.big_endian_int_to_digits(0, base=[], digit_count=1)
69 _ = cirq.big_endian_int_to_digits(0, base=[2, 3], digit_count=20)
71 assert cirq.big_endian_int_to_digits(101, base=[], digit_count=0) == []
75 assert cirq.big_endian_int_to_digits(0, base=[], digit_count=0) == []
77 assert cirq.big_endian_int_to_digits(11, base=3, digit_count=4) == [0, 1, 0, 2]
78 assert cirq.big_endian_int_to_digits(11, base=[3, 3, 3, 3], digit_count=4) == [0, 1, 0, 2]
79 assert cirq.big_endian_int_to_digits(11, base=[2, 3, 4], digit_count=3) == [0, 2, 3]
82 assert cirq.big_endian_int_to_digits(11, base=(e for e in [2, 3, 4]), digit_count=3) == [
H A Ddigits.py123 def big_endian_int_to_digits(val: int, *, digit_count: int, base: int) -> List[int]:
133 val: int, *, digit_count: Optional[int] = None, base: Union[int, Iterable[int]]
166 if digit_count is None:
168 base = (base,) * digit_count
171 if digit_count is None:
172 digit_count = len(base)
174 if len(base) != digit_count:
/dports/devel/simdjson/simdjson-0.9.6/include/simdjson/generic/
H A Dnumberparsing.h434 return digit_count - size_t(start - start_digits); in compute_float_64()
446 if (simdjson_unlikely(digit_count > 19 && significant_digits(start_digits, digit_count) > 19)) { in compute_float_64()
533 size_t digit_count = size_t(p - start_digits); in compute_float_64() local
534 if (digit_count == 0 || ('0' == *start_digits && digit_count > 1)) { return INVALID_NUMBER(src); } in compute_float_64()
564 if (digit_count == longest_digit_count) { in compute_float_64()
677 size_t digit_count = size_t(p - start_digits); in compute_float_64() local
683 if ((digit_count == 0) || (digit_count > 20)) { return INCORRECT_TYPE; } in compute_float_64()
693 if (digit_count == 20) { in compute_float_64()
730 size_t digit_count = size_t(p - start_digits); in compute_float_64() local
738 if ((digit_count == 0) || (digit_count > longest_digit_count)) { return INCORRECT_TYPE; } in compute_float_64()
[all …]
/dports/net/py-suds-community/suds-community-1.0.0/suds/xsd/
H A Dsxbuiltin.py165 digit_count = len(digits)
168 point_offset = digit_count + exponent
171 fractional_digit_count = min(digit_count, -exponent)
172 while fractional_digit_count and digits[digit_count - 1] == 0:
173 digit_count -= 1
182 if digit_count > 0:
185 result.extend(str(x) for x in digits[:digit_count])
189 if point_offset < digit_count:
191 result.extend(str(x) for x in digits[point_offset:digit_count])
/dports/www/squid/squid-4.15/src/auth/basic/RADIUS/
H A Dradius-util.cc73 int digit_count; in good_ipaddr() local
76 digit_count = 0; in good_ipaddr()
80 digit_count = 0; in good_ipaddr()
84 ++digit_count; in good_ipaddr()
85 if (digit_count > 3) { in good_ipaddr()
/dports/www/squid_radius_auth/squid_radius_auth-1.10/
H A Dutil.c60 int digit_count; in good_ipaddr() local
63 digit_count = 0; in good_ipaddr()
67 digit_count = 0; in good_ipaddr()
73 digit_count++; in good_ipaddr()
74 if(digit_count > 3) { in good_ipaddr()
/dports/security/masscan/masscan-1.3.2/src/
H A Dmassip-parse.c28 unsigned char digit_count; member
83 p->digit_count = 0; in _init_next_address()
313 p->digit_count = 1; in _parser_next()
318 p->digit_count = 1; in _parser_next()
323 p->digit_count = 1; in _parser_next()
341 p->digit_count = 0; in _parser_next()
347 p->digit_count = 1; in _parser_next()
358 p->digit_count = 0; in _parser_next()
383 p->digit_count++; in _parser_next()
620 p->digit_count = 0; in _parser_next()
[all …]
/dports/lang/scheme48/scheme48-1.9.2/c/
H A Ddouble_to_string.c21 int digit_count = strlen(raw); in s48_double_to_string() local
28 return digit_count; in s48_double_to_string()
35 --digit_count; in s48_double_to_string()
38 if ((exponent <= -4) || (exponent > (digit_count + 7))) in s48_double_to_string()
/dports/lang/sdcc/sdcc-4.0.0/device/lib/pic16/libc/utils/
H A Dcnvint.S58 digit_count res 1 label
446 clrf digit_count
466 incf digit_count, f
471 incf digit_count, f
476 incf digit_count, f
481 incf digit_count, f
486 incf digit_count, f
491 incf digit_count, f
496 incf digit_count, f
501 incf digit_count, f
[all …]
/dports/net/radiusclient/radiusclient-ng-0.5.6/lib/
H A Dip_util.c64 int digit_count; in rc_good_ipaddr() local
70 digit_count = 0; in rc_good_ipaddr()
76 digit_count = 0; in rc_good_ipaddr()
84 digit_count++; in rc_good_ipaddr()
85 if (digit_count > 3) in rc_good_ipaddr()
/dports/mail/mailutils/mailutils-3.13/libmailutils/sockaddr/
H A Dipaddr.c30 int digit_count = 0; in mu_str_is_ipv4() local
40 digit_count = 0; in mu_str_is_ipv4()
42 else if (!(mu_isdigit (*addr) && ++digit_count <= 3)) in mu_str_is_ipv4()

1234567891011