- Sort Score
- Result 10 results
- Languages All
Results 51 - 60 of 218 for remaining (0.21 sec)
-
cmd/erasure-utils.go
// Skip until offset. block = block[offset:] // Reset the offset for next iteration to read everything // from subsequent blocks. offset = 0 // We have written all the blocks, write the last remaining block. if write < int64(len(block)) { n, err := dst.Write(block[:write]) if err != nil { return 0, err } totalWritten += int64(n) break } // Copy the block.
Go - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Wed Jan 31 02:11:45 GMT 2024 - 3.1K bytes - Viewed (0) -
guava-tests/test/com/google/common/hash/SipHashFunctionTest.java
// Test for common pitfall regarding sign extension. // For example: (long) data[i++] | (long) data[i++] << 8 | ... // If data[i] == (byte) 0x80, the first cast will sign-extend it to 0xffffffffffffff80, // masking the remaining seven bytes. // To test this, we give an input where bit 7 is not cleared. For example: // (1) 00 01 02 03 04 05 06 07 80 // (2) 00 01 02 03 04 05 06 07 81 // (3) 00 01 02 03 04 05 06 07 ff (or anything in between)
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Sun May 05 18:02:35 GMT 2019 - 6.6K bytes - Viewed (0) -
docs/erasure/README.md
In 12 drive example above, with MinIO server running in the default configuration, you can lose any of the six drives and still reconstruct the data reliably from the remaining drives. ## Why is Erasure Code useful?
Plain Text - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Thu Sep 29 04:28:45 GMT 2022 - 4.1K bytes - Viewed (0) -
android/guava/src/com/google/common/hash/Murmur3_32HashFunction.java
for (int i = 1; i < input.length(); i += 2) { int k1 = input.charAt(i - 1) | (input.charAt(i) << 16); k1 = mixK1(k1); h1 = mixH1(h1, k1); } // deal with any remaining characters if ((input.length() & 1) == 1) { int k1 = input.charAt(input.length() - 1); k1 = mixK1(k1); h1 ^= k1; } return fmix(h1, Chars.BYTES * input.length()); }
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Jun 15 20:59:00 GMT 2022 - 11.9K bytes - Viewed (0) -
guava-tests/test/com/google/common/graph/GraphMutationTest.java
for (int i = 0; i < numNodesToRemove; ++i) { assertThat(graph.removeNode(nodeList.get(i))).isTrue(); } assertThat(graph.nodes()).hasSize(NUM_NODES - numNodesToRemove); // Number of edges remaining is unknown (node's incident edges have been removed). AbstractGraphTest.validateGraph(graph); for (int i = numNodesToRemove; i < NUM_NODES; ++i) { assertThat(graph.removeNode(nodeList.get(i))).isTrue();
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Fri Aug 18 16:17:46 GMT 2017 - 4.2K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/GraphMutationTest.java
for (int i = 0; i < numNodesToRemove; ++i) { assertThat(graph.removeNode(nodeList.get(i))).isTrue(); } assertThat(graph.nodes()).hasSize(NUM_NODES - numNodesToRemove); // Number of edges remaining is unknown (node's incident edges have been removed). AbstractGraphTest.validateGraph(graph); for (int i = numNodesToRemove; i < NUM_NODES; ++i) { assertThat(graph.removeNode(nodeList.get(i))).isTrue();
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Fri Aug 18 16:17:46 GMT 2017 - 4.2K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/NetworkMutationTest.java
for (int i = 0; i < numNodesToRemove; ++i) { assertThat(network.removeNode(nodeList.get(i))).isTrue(); } assertThat(network.nodes()).hasSize(NUM_NODES - numNodesToRemove); // Number of edges remaining is unknown (node's incident edges have been removed). AbstractNetworkTest.validateNetwork(network); for (int i = numNodesToRemove; i < NUM_NODES; ++i) {
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Apr 10 19:42:18 GMT 2024 - 4.5K bytes - Viewed (0) -
android/guava/src/com/google/common/hash/PrimitiveSink.java
* {@code len < 0} */ @CanIgnoreReturnValue PrimitiveSink putBytes(byte[] bytes, int off, int len); /** * Puts the remaining bytes of a byte buffer into this sink. {@code bytes.position()} is the first * byte written, {@code bytes.limit() - 1} is the last. The position of the buffer will be equal * to the limit when this method returns. *
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Jun 15 20:59:00 GMT 2022 - 3.9K bytes - Viewed (0) -
guava/src/com/google/common/collect/ImmutableSortedSet.java
E e1, E e2, E e3, E e4, E e5, E e6, E... remaining) { Comparable<?>[] contents = new Comparable<?>[6 + remaining.length]; contents[0] = e1; contents[1] = e2; contents[2] = e3; contents[3] = e4; contents[4] = e5; contents[5] = e6; System.arraycopy(remaining, 0, contents, 6, remaining.length); return construct(Ordering.natural(), contents.length, (E[]) contents);
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 38.5K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/SmoothRateLimiter.java
* this is translated to throttling time is discussed later). Immediately after, assume that an * acquire(10) request arriving. We serve the request partly from storedPermits, using all the * remaining 7.0 permits, and the remaining 3.0, we serve them by fresh permits produced by the * rate limiter. * * We already know how much time it takes to serve 3 fresh permits: if the rate is
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue Apr 04 09:45:04 GMT 2023 - 19.3K bytes - Viewed (0)