- Sort Score
- Result 10 results
- Languages All
Results 1 - 5 of 5 for Remainder (0.07 sec)
-
src/main/webapp/css/admin/bootstrap.min.css.map
@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 $precision >= 0) {\n $quotient: 0;\n @while ($remainder >= $divisor) {\n $remainder: $remainder - $divisor;\n $quotient: $quotient + 1;\n }\n $result: $result * 10 + $quotient;\n $factor: $factor * .1;\n $remainder: $remainder * 10;\n $precision: $precision - 1;\n @if ($precision < 0 and $remainder >=...Registered: Sat Dec 20 09:19:18 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
@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 $precision >= 0) {\n $quotient: 0;\n @while ($remainder >= $divisor) {\n $remainder: $remainder - $divisor;\n $quotient: $quotient + 1;\n }\n $result: $result * 10 + $quotient;\n $factor: $factor * .1;\n $remainder: $remainder * 10;\n $precision: $precision - 1;\n @if ($precision < 0 and $remainder >=...Registered: Sat Dec 20 09:19:18 UTC 2025 - Last Modified: Sun Jan 12 06:14:02 UTC 2025 - 575.5K bytes - Viewed (0) -
lib/fips140/v1.0.0-c2097c7c.zip
// [ q/2, q + q/2 ) -> round to 1 // [ q + q/2, 2q ) -> round to 2 // // We can convert that to the following logic: add 1 if remainder > q/2, // then add 1 again if remainder > q + q/2. // // Note that if remainder > x, then ⌊x⌋ - remainder underflows, and the top // bit of the difference will be set. quotient += (q/2 - remainder) >> 31 & 1 quotient += (q + q/2 - remainder) >> 31 & 1 // quotient might have overflowed at this point, so reduce it by masking. var mask uint32 = (1 << d) - 1 return uint16(quotient...
Registered: Tue Dec 30 11:13:12 UTC 2025 - Last Modified: Thu Sep 25 19:53:19 UTC 2025 - 642.7K bytes - Viewed (0) -
lib/fips140/v1.1.0-rc1.zip
// [ q/2, q + q/2 ) -> round to 1 // [ q + q/2, 2q ) -> round to 2 // // We can convert that to the following logic: add 1 if remainder > q/2, // then add 1 again if remainder > q + q/2. // // Note that if remainder > x, then ⌊x⌋ - remainder underflows, and the top // bit of the difference will be set. quotient += (q/2 - remainder) >> 31 & 1 quotient += (q + q/2 - remainder) >> 31 & 1 // quotient might have overflowed at this point, so reduce it by masking. var mask uint32 = (1 << d) - 1 return uint16(quotient...
Registered: Tue Dec 30 11:13:12 UTC 2025 - Last Modified: Thu Dec 11 16:27:41 UTC 2025 - 663K bytes - Viewed (0) -
docs/en/docs/release-notes.md
### Internal * 🔧 Add sponsor Requestly. PR [#14205](https://github.com/fastapi/fastapi/pull/14205) by [@tiangolo](https://github.com/tiangolo). * 🔧 Configure reminder for `waiting` label in `issue-manager`. PR [#14156](https://github.com/fastapi/fastapi/pull/14156) by [@YuriiMotov](https://github.com/YuriiMotov). ## 0.119.0
Registered: Sun Dec 28 07:19:09 UTC 2025 - Last Modified: Sat Dec 27 19:06:15 UTC 2025 - 586.7K bytes - Viewed (0)