- Sort Score
- Result 10 results
- Languages All
Results 31 - 40 of 66 for dividend (0.06 sec)
-
guava/src/com/google/common/hash/Hashing.java
* * <p>This method is suitable for the common use case of dividing work among buckets that meet the * following conditions: * * <ul> * <li>You want to assign the same fraction of inputs to each bucket. * <li>When you reduce the number of buckets, you can accept that the most recently added * buckets will be removed first. More concretely, if you are dividing traffic among tasks,
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Mon Aug 11 22:06:57 UTC 2025 - 31.1K bytes - Viewed (0) -
android/guava-tests/benchmark/com/google/common/math/LongMathRoundingBenchmark.java
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Thu Dec 19 18:03:30 UTC 2024 - 2.6K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/math/BigDecimalMathTest.java
new RoundToDoubleTester(BigDecimal.ZERO).setExpectation(0.0, values()).test(); } public void testRoundToDouble_oneThird() { new RoundToDoubleTester( BigDecimal.ONE.divide(BigDecimal.valueOf(3), new MathContext(50, HALF_EVEN))) .roundUnnecessaryShouldThrow() .setExpectation(0.33333333333333337, UP, CEILING)
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Mon Jul 14 14:44:08 UTC 2025 - 10.9K bytes - Viewed (0) -
.teamcity/src/main/kotlin/model/BucketExtensions.kt
} val roughSizeOfEachBucket = list.sumOf(toIntFunction) / expectedBucketNumber if (roughSizeOfEachBucket == 0) { // The elements in the list are so small that they can't even be divided into {expectedBucketNumber}. // For example, how do you split [0,0,0,0,0] into 3 buckets? // In this case, we simply put the elements into these buckets evenly.
Registered: Wed Sep 10 11:36:15 UTC 2025 - Last Modified: Wed Feb 12 09:12:03 UTC 2025 - 5.7K bytes - Viewed (0) -
android/guava-testlib/src/com/google/common/testing/CollectorTester.java
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Thu May 15 21:47:56 UTC 2025 - 6.8K bytes - Viewed (0) -
guava-testlib/src/com/google/common/testing/CollectorTester.java
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Thu May 15 21:47:56 UTC 2025 - 6.6K bytes - Viewed (0) -
docs/erasure/storage-class/README.md
Below is a list of data/parity drives and corresponding _approximate_ storage space usage on a 16 drive MinIO deployment. The field _storage usage ratio_ is simply the drive space used by the file after erasure-encoding, divided by actual file size. | Total Drives (N) | Data Drives (D) | Parity Drives (P) | Storage Usage Ratio | |------------------|-----------------|-------------------|---------------------|
Registered: Sun Sep 07 19:28:11 UTC 2025 - Last Modified: Tue Aug 12 18:20:36 UTC 2025 - 5.9K bytes - Viewed (0) -
src/main/webapp/js/admin/moment-with-locales.min.js.map
filter","item","isNumberOrStringArray","property","objectTest","propertyTest","properties","isMomentInputObject","monthDiff","wholeMonthDiff","anchor","adjust","newLocaleData","defaultFormat","defaultFormatUtc","lang","MS_PER_400_YEARS","mod$1","dividend","divisor","localStartOfDate","utcStartOfDate","matchEraAbbr","erasAbbrRegex","computeErasParse","abbrPieces","namePieces","narrowPieces","eras","narrow","_erasRegex","_erasNameRegex","_erasAbbrRegex","_erasNarrowRegex","addWeekYearFormatToken",...
Registered: Thu Sep 04 12:52:25 UTC 2025 - Last Modified: Sat Oct 26 01:49:09 UTC 2024 - 224.8K bytes - Viewed (1) -
lib/fips140/v1.0.0.zip
to compute (y * q) / 2ᵈ, rounded to nearest integer, with 1/2 // rounding up (see FIPS 203, Section 2.3). dividend := uint32(y) * q quotient := dividend >> d // (y * q) / 2ᵈ // The d'th least-significant bit of the dividend (the most significant bit // of the remainder) is 1 for the top half of the values that divide to the // same quotient, which are the ones that round up. quotient += dividend >> (d - 1) & 1 // quotient is at most (2¹¹-1) * q / 2¹¹ + 1 = 3328, so it didn't overflow. return fieldElement(quotient)...
Registered: Tue Sep 09 11:13:09 UTC 2025 - Last Modified: Wed Jan 29 15:10:35 UTC 2025 - 635K bytes - Viewed (0) -
src/test/java/jcifs/smb1/smb1/SmbComQueryInformationResponseTest.java
assertEquals(0x0010, response.getAttributes()); // getLastWriteTime returns lastWriteTime (from readUTime) + serverTimeZoneOffset // readUTime multiplies the seconds value by 1000, and writeUTime divides milliseconds by 1000 // So the round-trip should preserve the milliseconds value assertEquals(sampleTimeMillis + serverTimeZoneOffset, response.getLastWriteTime()); assertEquals(1024, response.getSize());
Registered: Sun Sep 07 00:10:21 UTC 2025 - Last Modified: Thu Aug 14 05:31:44 UTC 2025 - 5.5K bytes - Viewed (0)