- Sort Score
- Result 10 results
- Languages All
Results 71 - 80 of 876 for 12 (0.09 sec)
-
helm/minio/templates/deployment.yaml
- name: extra-secret mountPath: "/tmp/minio-config-env" {{- end }} {{- include "minio.tlsKeysVolumeMount" . | indent 12 }} {{- if .Values.extraVolumeMounts }} {{- toYaml .Values.extraVolumeMounts | nindent 12 }} {{- end }} ports: - name: {{ $scheme }} containerPort: {{ .Values.minioAPIPort }}
Registered: Sun Nov 03 19:28:11 UTC 2024 - Last Modified: Thu Oct 10 15:48:31 UTC 2024 - 8.6K bytes - Viewed (0) -
guava-testlib/test/com/google/common/collect/testing/IteratorTesterTest.java
3, MODIFIABLE, newArrayList(1, 2), IteratorTester.KnownOrder.KNOWN_ORDER) { @Override protected Iterator<Integer> newTargetIterator() { return ImmutableList.of(1, 2).iterator(); } }; assertFailure(tester); } public void testUnknownOrder() { new IteratorTester<Integer>( 3, MODIFIABLE, newArrayList(1, 2), IteratorTester.KnownOrder.UNKNOWN_ORDER) {
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Tue Jun 11 16:13:05 UTC 2024 - 10.3K bytes - Viewed (0) -
src/main/webapp/WEB-INF/view/admin/badword/admin_badword.jsp
Registered: Thu Oct 31 13:40:30 UTC 2024 - Last Modified: Wed Feb 12 20:25:27 UTC 2020 - 6.5K bytes - Viewed (0) -
src/main/java/jcifs/smb1/util/Base64.java
block = ((bytes[i++] & 0xff) << 16) | ((bytes[i++] & 0xff) << 8) | (bytes[i++] & 0xff); buffer.append(ALPHABET.charAt(block >>> 18)); buffer.append(ALPHABET.charAt((block >>> 12) & 0x3f)); buffer.append(ALPHABET.charAt((block >>> 6) & 0x3f)); buffer.append(ALPHABET.charAt(block & 0x3f)); } if (remainder == 0) return buffer.toString();
Registered: Sun Nov 03 00:10:13 UTC 2024 - Last Modified: Fri Mar 22 20:39:42 UTC 2019 - 3.7K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/primitives/DoublesTest.java
testRotate(new double[] {1, 2}, -2, new double[] {1, 2}); testRotate(new double[] {1, 2}, 0, new double[] {1, 2}); testRotate(new double[] {1, 2}, 1, new double[] {2, 1}); testRotate(new double[] {1, 2}, 2, new double[] {1, 2}); testRotate(new double[] {1, 2}, 3, new double[] {2, 1}); testRotate(new double[] {1, 2, 3}, -5, new double[] {3, 1, 2});
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Sat Oct 19 02:56:12 UTC 2024 - 32.2K bytes - Viewed (0) -
src/main/webapp/WEB-INF/view/admin/backup/admin_backup.jsp
Registered: Thu Oct 31 13:40:30 UTC 2024 - Last Modified: Wed Feb 12 20:25:27 UTC 2020 - 5.1K bytes - Viewed (0) -
cmd/erasure-heal_test.go
{dataBlocks: 6, disks: 12, offDisks: 8, badDisks: 3, badStaleDisks: 0, blocksize: int64(blockSizeV2), size: oneMiByte, algorithm: DefaultBitrotAlgorithm, shouldFail: true}, // 12
Registered: Sun Nov 03 19:28:11 UTC 2024 - Last Modified: Tue Jan 30 20:43:25 UTC 2024 - 7.9K bytes - Viewed (0) -
src/test/java/org/codelibs/core/collection/ArrayIteratorTest.java
public void testNoSuchElement() { exception.expect(NoSuchElementException.class); exception.expectMessage(is("index=2")); final ArrayIterator<Integer> itr = new ArrayIterator<Integer>(new Integer[] { 1, 2 }); itr.next(); itr.next(); itr.next(); } /** * */ @Test public void testHasNext() {
Registered: Fri Nov 01 20:58:10 UTC 2024 - Last Modified: Thu Mar 07 01:59:08 UTC 2024 - 2.5K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/primitives/BytesTest.java
testRotate(new byte[] {1, 2}, -2, new byte[] {1, 2}); testRotate(new byte[] {1, 2}, 0, new byte[] {1, 2}); testRotate(new byte[] {1, 2}, 1, new byte[] {2, 1}); testRotate(new byte[] {1, 2}, 2, new byte[] {1, 2}); testRotate(new byte[] {1, 2}, 3, new byte[] {2, 1}); testRotate(new byte[] {1, 2, 3}, -5, new byte[] {3, 1, 2}); testRotate(new byte[] {1, 2, 3}, -4, new byte[] {2, 3, 1});
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Sat Oct 19 02:56:12 UTC 2024 - 17.3K bytes - Viewed (0) -
docs/erasure/README.md
## What is Erasure Code? Erasure code is a mathematical algorithm to reconstruct missing or corrupted data. MinIO uses Reed-Solomon code to shard objects into variable data and parity blocks. For example, in a 12 drive setup, an object can be sharded to a variable number of data and parity blocks across all the drives - ranging from six data and six parity blocks to ten data and two parity blocks.
Registered: Sun Nov 03 19:28:11 UTC 2024 - Last Modified: Thu Sep 29 04:28:45 UTC 2022 - 4.1K bytes - Viewed (0)