- Sort Score
- Result 10 results
- Languages All
Results 21 - 30 of 66 for dividend (0.05 sec)
-
src/main/webapp/js/admin/popper.min.js.map
single one\n // they could be separated by comma or space\n const divider = fragments.indexOf(\n find(fragments, frag => frag.search(/,|\\s/) !== -1)\n );\n\n if (fragments[divider] && fragments[divider].indexOf(',') === -1) {\n console.warn(\n 'Offsets separated by white space(s) are deprecated, use a comma (,) instead.'\n );\n }\n\n // If divider is found, we divide the list of values and operands to divide\n // them by ofset X and Y.\n const splitRegex = /\\s*,\\s*|\\s+/;\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) -
docs/erasure/README.md
## How are drives used for Erasure Code? MinIO divides the drives you provide into erasure-coding sets of *2 to 16* drives. Therefore, the number of drives you present must be a multiple of one of these numbers. Each object is written to a single erasure-coding set.
Registered: Sun Sep 07 19:28:11 UTC 2025 - Last Modified: Tue Aug 12 18:20:36 UTC 2025 - 4.2K bytes - Viewed (0) -
guava/src/com/google/common/collect/Iterables.java
* @param iterable the iterable to return a partitioned view of * @param size the desired size of each partition (the last may be smaller) * @return an iterable of unmodifiable lists containing the elements of {@code iterable} divided * into partitions * @throws IllegalArgumentException if {@code size} is nonpositive */ public static <T extends @Nullable Object> Iterable<List<T>> partition( Iterable<T> iterable, int size) {
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Thu Aug 07 16:05:33 UTC 2025 - 43.3K bytes - Viewed (0) -
android/guava-tests/benchmark/com/google/common/math/BigIntegerMathRoundingBenchmark.java
int j = i & ARRAY_MASK; tmp += BigIntegerMath.sqrt(positive[j], mode).intValue(); } return tmp; } @Benchmark int divide(int reps) { int tmp = 0; for (int i = 0; i < reps; i++) { int j = i & ARRAY_MASK; tmp += BigIntegerMath.divide(nonzero1[j], nonzero2[j], mode).intValue(); } return tmp; } @Benchmark long roundToDouble(int reps) { long tmp = 0;
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Thu Dec 19 18:03:30 UTC 2024 - 2.9K bytes - Viewed (0) -
android/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: Thu Jul 17 15:26:41 UTC 2025 - 29.8K bytes - Viewed (0) -
guava-tests/test/com/google/common/math/BigIntegerMathTest.java
for (RoundingMode mode : ALL_SAFE_ROUNDING_MODES) { BigInteger expected = new BigDecimal(p).divide(new BigDecimal(q), 0, mode).toBigIntegerExact(); assertEquals(expected, BigIntegerMath.divide(p, q, mode)); } } } } private static final BigInteger BAD_FOR_ANDROID_P = new BigInteger("-9223372036854775808");
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Thu Aug 07 16:05:33 UTC 2025 - 27K bytes - Viewed (0) -
okhttp/src/commonJvmAndroid/kotlin/okhttp3/internal/idn/IdnaMappingTable.kt
} /** * Binary search [sections] for [codePoint], looking at its top 14 bits. * * This binary searches over 4-byte entries, and so it needs to adjust binary search indices * in (by dividing by 4) and out (by multiplying by 4). */ private fun findSectionsIndex(codePoint: Int): Int { val target = (codePoint and 0x1fff80) shr 7 val offset = binarySearch( position = 0,
Registered: Fri Sep 05 11:42:10 UTC 2025 - Last Modified: Fri Dec 27 13:39:56 UTC 2024 - 9K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Iterators.java
* partitions * @throws IllegalArgumentException if {@code size} is nonpositive */ public static <T extends @Nullable Object> UnmodifiableIterator<List<T>> partition( Iterator<T> iterator, int size) { return partitionImpl(iterator, size, false); } /**
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Thu Aug 07 16:05:33 UTC 2025 - 50.5K bytes - Viewed (0) -
android/guava-tests/benchmark/com/google/common/math/IntMathRoundingBenchmark.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) -
guava-tests/benchmark/com/google/common/math/BigIntegerMathRoundingBenchmark.java
int j = i & ARRAY_MASK; tmp += BigIntegerMath.sqrt(positive[j], mode).intValue(); } return tmp; } @Benchmark int divide(int reps) { int tmp = 0; for (int i = 0; i < reps; i++) { int j = i & ARRAY_MASK; tmp += BigIntegerMath.divide(nonzero1[j], nonzero2[j], mode).intValue(); } return tmp; } @Benchmark long roundToDouble(int reps) { long tmp = 0;
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Thu Dec 19 18:03:30 UTC 2024 - 2.9K bytes - Viewed (0)