- Sort Score
- Result 10 results
- Languages All
Results 21 - 30 of 41 for divisor (0.07 sec)
-
guava/src/com/google/common/hash/Fingerprint2011.java
* <p>Note to maintainers: This implementation relies on signed arithmetic being bit-wise equivalent * to unsigned arithmetic in all cases except: * * <ul> * <li>comparisons (signed values can be negative) * <li>division (avoided here) * <li>shifting (right shift must be unsigned) * </ul> * * @author ******@****.*** (Kyle Maddison) * @author ******@****.*** (Geoff Pike) */
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Mon Aug 11 19:31:30 UTC 2025 - 6.5K bytes - Viewed (0) -
src/main/webapp/js/admin/popper.min.js.map
const splitRegex = /\\s*,\\s*|\\s+/;\n let ops = divider !== -1\n ? [\n fragments\n .slice(0, divider)\n .concat([fragments[divider].split(splitRegex)[0]]),\n [fragments[divider].split(splitRegex)[1]].concat(\n fragments.slice(divider + 1)\n ),\n ]\n : [fragments];\n\n // Convert the values with units to absolute pixels to allow our computations\n ops = ops.map((op, index) => {\n // Most of the units rely on the orientation of the popper\n...
Registered: Thu Sep 04 12:52:25 UTC 2025 - Last Modified: Sat Oct 26 01:49:09 UTC 2024 - 120.9K bytes - Viewed (0) -
android/guava/src/com/google/common/hash/Fingerprint2011.java
* <p>Note to maintainers: This implementation relies on signed arithmetic being bit-wise equivalent * to unsigned arithmetic in all cases except: * * <ul> * <li>comparisons (signed values can be negative) * <li>division (avoided here) * <li>shifting (right shift must be unsigned) * </ul> * * @author ******@****.*** (Kyle Maddison) * @author ******@****.*** (Geoff Pike) */
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Mon Aug 11 19:31:30 UTC 2025 - 6.5K bytes - Viewed (0) -
src/test/java/jcifs/internal/dfs/DfsReferralResponseBufferTest.java
bb.putShort((short) 0); bb.putShort((short) 0); buffer.decode(testBuffer, 0, testBuffer.length); assertEquals(7, buffer.getPathConsumed()); // 15 / 2 = 7 (integer division) } }
Registered: Sun Sep 07 00:10:21 UTC 2025 - Last Modified: Thu Aug 14 05:31:44 UTC 2025 - 15.4K bytes - Viewed (0) -
.teamcity/src/main/kotlin/model/PerformanceTestBucketProvider.kt
scenario.scenario } }.firstOrNull() // Fallback for new performance tests (don't use 0 to avoid division by zero) ?: PerformanceTestDuration(scenario.scenario, 1) }) .entries .map { TestProjectDuration(it.key, it.value) } .sortedBy { -it.totalTime }
Registered: Wed Sep 10 11:36:15 UTC 2025 - Last Modified: Thu Jul 10 02:18:03 UTC 2025 - 16.6K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/math/IntMathTest.java
} } } @AndroidIncompatible // slow @GwtIncompatible // Math.floorDiv gets wrong answers for negative divisors public void testDivNonZero() { for (int p : NONZERO_INTEGER_CANDIDATES) { for (int q : NONZERO_INTEGER_CANDIDATES) { for (RoundingMode mode : ALL_SAFE_ROUNDING_MODES) {
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Mon Aug 11 19:31:30 UTC 2025 - 24.1K bytes - Viewed (0) -
android/guava/src/com/google/common/math/Quantiles.java
checkArgument(dataset.length > 0, "Cannot calculate quantiles of an empty dataset"); if (containsNaN(dataset)) { return NaN; } // Calculate the quotient and remainder in the integer division x = k * (N-1) / q, i.e. // index * (dataset.length - 1) / scale. If there is no remainder, we can just find the value // whose index in the sorted dataset equals the quotient; if there is a remainder, we
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Mon Mar 17 20:26:29 UTC 2025 - 30.1K bytes - Viewed (0) -
docs/pt/docs/async.md
Levaria o mesmo tempo para finalizar com ou sem turnos (concorrência) e você teria feito o mesmo tanto de trabalho. Mas nesse caso, se você trouxesse os 8 ex-caixas / cozinheiros / agora-faxineiros, e cada um deles (mais você) pudessem dividir a casa para limpá-la, vocês fariam toda a limpeza em **paralelo**, com a ajuda extra, e terminariam muito mais cedo. Nesse cenário, cada um dos faxineiros (incluindo você) poderia ser um processador, fazendo a sua parte do trabalho.
Registered: Sun Sep 07 07:19:17 UTC 2025 - Last Modified: Sun Aug 31 09:56:21 UTC 2025 - 23.6K bytes - Viewed (0) -
lib/fips140/v1.0.0.zip
nil, errors.New("rsa: 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]...
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/bootstrap.min.css
transparent;border-right:.3em solid;border-bottom:.3em solid transparent}.dropstart .dropdown-toggle:empty::after{margin-left:0}.dropstart .dropdown-toggle::before{vertical-align:0}.dropdown-divider{height:0;margin:var(--bs-dropdown-divider-margin-y) 0;overflow:hidden;border-top:1px solid var(--bs-dropdown-divider-bg);opacity:1}.dropdown-item{display:block;width:100%;padding:var(--bs-dropdown-item-padding-y) var(--bs-dropdown-item-padding-x);clear:both;font-weight:400;color:var(--bs-dropdown-link-c...
Registered: Thu Sep 04 12:52:25 UTC 2025 - Last Modified: Sun Jan 12 06:14:02 UTC 2025 - 227.5K bytes - Viewed (0)