- Sort Score
- Result 10 results
- Languages All
Results 11 - 20 of 21 for divisors (0.09 sec)
-
misc/cgo/gmp/gmp.go
func DivModInt(q, r, x, y *Int) { q.doinit() r.doinit() x.doinit() y.doinit() C.mpz_tdiv_qr(&q.i[0], &r.i[0], &x.i[0], &y.i[0]) } // GcdInt sets d to the greatest common divisor of a and b, // which must be positive numbers. // If x and y are not nil, GcdInt sets x and y such that d = a*x + b*y. // If either a or b is not positive, GcdInt sets d = x = y = 0. func GcdInt(d, x, y, a, b *Int) {
Registered: Tue Sep 09 11:13:09 UTC 2025 - Last Modified: Mon Apr 11 16:34:30 UTC 2022 - 9.5K bytes - Viewed (0) -
guava/src/com/google/common/math/LongMath.java
if (m <= 0) { throw new ArithmeticException("Modulus must be positive"); } return Math.floorMod(x, m); } /** * Returns the greatest common divisor of {@code a, b}. Returns {@code 0} if {@code a == 0 && b == * 0}. * * @throws IllegalArgumentException if {@code a < 0} or {@code b < 0} */ public static long gcd(long a, long b) { /*
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Fri Aug 29 16:20:07 UTC 2025 - 46.8K bytes - Viewed (0) -
okhttp/src/jvmTest/kotlin/okhttp3/internal/http2/Http2ConnectionTest.kt
Registered: Fri Sep 05 11:42:10 UTC 2025 - Last Modified: Thu Jul 31 04:18:40 UTC 2025 - 75.5K bytes - Viewed (0) -
docs/fr/docs/async.md
*Oui, c'est toute l'histoire*. --- Il n'y a plus d'attente 🕙 nulle part, juste beaucoup de travail à effectuer, dans différentes pièces de la maison. Vous pourriez diviser en différentes sections comme avec les burgers, d'abord le salon, puis la cuisine, etc. Mais vous n'attendez 🕙 rien, vous ne faites que nettoyer et nettoyer, la séparation en sections ne changerait rien au final.
Registered: Sun Sep 07 07:19:17 UTC 2025 - Last Modified: Sun Aug 31 09:56:21 UTC 2025 - 25.4K bytes - Viewed (0) -
src/main/webapp/css/admin/bootstrap.min.css.map
true !default;\n\n// Cache $rfs-base-font-size unit\n$rfs-base-font-size-unit: unit($rfs-base-font-size);\n\n@function divide($dividend, $divisor, $precision: 10) {\n $sign: if($dividend > 0 and $divisor > 0 or $dividend < 0 and $divisor < 0, 1, -1);\n $dividend: abs($dividend);\n $divisor: abs($divisor);\n @if $dividend == 0 {\n @return 0;\n }\n @if $divisor == 0 {\n @error \"Cannot divide by 0\";\n }\n $remainder: $dividend;\n $result: 0;\n $factor: 10;\n @while ($remainder > 0 and...
Registered: Thu Sep 04 12:52:25 UTC 2025 - Last Modified: Sat Oct 26 01:49:09 UTC 2024 - 639.3K bytes - Viewed (1) -
src/main/webapp/css/bootstrap.min.css.map
false\n$enable-rfs: true !default;\n\n// Cache $rfs-base-value unit\n$rfs-base-value-unit: unit($rfs-base-value);\n\n@function divide($dividend, $divisor, $precision: 10) {\n $sign: if($dividend > 0 and $divisor > 0 or $dividend < 0 and $divisor < 0, 1, -1);\n $dividend: abs($dividend);\n $divisor: abs($divisor);\n @if $dividend == 0 {\n @return 0;\n }\n @if $divisor == 0 {\n @error \"Cannot divide by 0\";\n }\n $remainder: $dividend;\n $result: 0;\n $factor: 10;\n @while ($remainder > 0 and...
Registered: Thu Sep 04 12:52:25 UTC 2025 - Last Modified: Sun Jan 12 06:14:02 UTC 2025 - 575.5K bytes - Viewed (0) -
doc/go_spec.html
int16 -32768 int32 -2147483648 int64 -9223372036854775808 </pre> <p> If the divisor is a <a href="#Constants">constant</a>, it must not be zero. If the divisor is zero at run time, a <a href="#Run_time_panics">run-time panic</a> occurs. If the dividend is non-negative and the divisor is a constant power of 2, the division may be replaced by a right shift, and computing the remainder may
Registered: Tue Sep 09 11:13:09 UTC 2025 - Last Modified: Tue May 06 19:12:15 UTC 2025 - 286.2K bytes - Viewed (0) -
src/main/webapp/js/admin/popper.min.js.map
white spaces.<br />\n * The latter is a deprecated method because it leads to confusion and will be\n * removed in v2.<br />\n * Additionally, it accepts additions and subtractions between different units.\n * Note that multiplications and divisions aren't supported.\n *\n * Valid examples are:\n * ```\n * 10\n * '10%'\n * '10, 10'\n * '10%, 10'\n * '10 + 10%'\n * '10 - 5vh + 3%'\n * '-10px + 5vh, 5px - 6%'\n * ```\n * > **NB**: If you desire to apply offsets to your...
Registered: Thu Sep 04 12:52:25 UTC 2025 - Last Modified: Sat Oct 26 01:49:09 UTC 2024 - 120.9K bytes - Viewed (0) -
lib/fips140/v1.0.0.zip
internal error: gcd(a, b) is even") } // To avoid implementing multiple-precision division, we just try again if // the divisor doesn't fit in a single word. This would have a chance of // 2⁻⁶⁴ on 64-bit platforms, and 2⁻³² on 32-bit platforms, but testing 2⁻⁶⁴ // edge cases is impractical, and we'd rather not behave differently on // different platforms, so we reject divisors above 2³²-1. if gcd.BitLenVarTime() > 32 { return nil, errDivisorTooLarge } if gcd.IsZero() == 1 || gcd.Bits()[0] == 0 {...
Registered: Tue Sep 09 11:13:09 UTC 2025 - Last Modified: Wed Jan 29 15:10:35 UTC 2025 - 635K bytes - Viewed (0) -
src/main/webapp/css/admin/adminlte.min.css.map
true !default;\n\n// Cache $rfs-base-font-size unit\n$rfs-base-font-size-unit: unit($rfs-base-font-size);\n\n@function divide($dividend, $divisor, $precision: 10) {\n $sign: if($dividend > 0 and $divisor > 0 or $dividend < 0 and $divisor < 0, 1, -1);\n $dividend: abs($dividend);\n $divisor: abs($divisor);\n @if $dividend == 0 {\n @return 0;\n }\n @if $divisor == 0 {\n @error \"Cannot divide by 0\";\n }\n $remainder: $dividend;\n $result: 0;\n $factor: 10;\n @while ($remainder > 0 and...
Registered: Thu Sep 04 12:52:25 UTC 2025 - Last Modified: Sat Oct 26 01:49:09 UTC 2024 - 3.7M bytes - Viewed (1)