- Sort Score
- Result 10 results
- Languages All
Results 51 - 60 of 77 for Odivide (0.19 sec)
-
internal/ioutil/ioutil.go
return false } return fi1.Size() == fi2.Size() } // DirectioAlignSize - DirectIO alignment needs to be 4K. Defined here as // directio.AlignSize is defined as 0 in MacOS causing divide by 0 error. const DirectioAlignSize = 4096 // CopyAligned - copies from reader to writer using the aligned input // buffer, it is expected that input buffer is page aligned to
Go - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Fri Apr 19 11:26:59 GMT 2024 - 10.3K bytes - Viewed (0) -
internal/hash/checksum.go
crc := c.Raw if len(crc) != c.Type.RawByteLen() { return b } b = append(b, tmp[:n]...) b = append(b, crc...) if c.Type.Is(ChecksumMultipart) { var checksums int // Ensure we don't divide by 0: if c.Type.RawByteLen() == 0 || len(parts)%c.Type.RawByteLen() != 0 { hashLogIf(context.Background(), fmt.Errorf("internal error: Unexpected checksum length: %d, each checksum %d", len(parts), c.Type.RawByteLen()))
Go - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Thu Apr 04 12:04:40 GMT 2024 - 11.9K bytes - Viewed (0) -
android/guava/src/com/google/common/math/Quantiles.java
// non-negative int, we can do long-arithmetic on index * (dataset.length - 1) / scale to get // a rounded ratio and a remainder which can be expressed as ints, without risk of overflow: int quotient = (int) LongMath.divide(numerator, scale, RoundingMode.DOWN); int remainder = (int) (numerator - (long) quotient * scale); selectInPlace(quotient, dataset, 0, dataset.length - 1); if (remainder == 0) {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri May 12 17:02:53 GMT 2023 - 29.9K bytes - Viewed (0) -
cmd/endpoint-ellipses.go
return ep, nil } // GetAllSets - parses all ellipses input arguments, expands them into // corresponding list of endpoints chunked evenly in accordance with a // specific set size. // For example: {1...64} is divided into 4 sets each of size 16. // This applies to even distributed setup syntax as well. func GetAllSets(setDriveCount uint64, args ...string) ([][]string, error) { var setArgs [][]string if !ellipses.HasEllipses(args...) {
Go - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Fri May 03 15:54:03 GMT 2024 - 14.7K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/collect/TableCollectionTest.java
table.put('a', "two", 2); table.put('a', "three", 3); table.put('b', "four", 4); return table.row('a'); } } static final Function<@Nullable Integer, @Nullable Integer> DIVIDE_BY_2 = new Function<@Nullable Integer, @Nullable Integer>() { @Override public @Nullable Integer apply(@Nullable Integer input) { return (input == null) ? null : input / 2; }
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Feb 19 20:34:55 GMT 2024 - 35.3K bytes - Viewed (0) -
docs/distributed/README.md
- **MinIO creates erasure-coding sets of _2_ to _16_ drives per set. The number of drives you provide in total must be a multiple of one of those numbers.** - **MinIO chooses the largest EC set size which divides into the total number of drives or total number of nodes given - making sure to keep the uniform distribution i.e each node participates equal number of drives per set**.
Plain Text - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Thu Jan 18 07:03:17 GMT 2024 - 8.8K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/hash/BloomFilterTest.java
public void testBitSize() { double fpp = 0.03; for (int i = 1; i < 10000; i++) { long numBits = BloomFilter.optimalNumOfBits(i, fpp); int arraySize = Ints.checkedCast(LongMath.divide(numBits, 64, RoundingMode.CEILING)); assertEquals( arraySize * Long.SIZE, BloomFilter.create(Funnels.unencodedCharsFunnel(), i, fpp).bitSize()); } }
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Nov 09 22:49:56 GMT 2023 - 21.3K bytes - Viewed (0) -
architecture/environments/operator.md
See the [design doc](https://docs.google.com/document/d/11j9ZtYWNWnxQYnZy8ayZav1FMwTH6F6z6fkDYZ7V298/edit#heading=h.qex63c29z2to) for a more complete design description. The operator code is divided roughly into five areas: 1. [IstioOperatorSpec API](#istiooperatorspec-api) and related infrastructure, which is expressed as a [proto](https://github.com/istio/api/blob/master/operator/v1alpha1/operator.proto) and
Plain Text - Registered: Wed May 08 22:53:08 GMT 2024 - Last Modified: Wed Aug 09 22:09:18 GMT 2023 - 13.4K bytes - Viewed (0) -
cmd/data-scanner.go
oldCache dataUsageCache newCache dataUsageCache updateCache dataUsageCache dataUsageScannerDebug bool healObjectSelect uint32 // Do a heal check on an object once every n cycles. Must divide into healFolderInclude scanMode madmin.HealScanMode weSleep func() bool disks []StorageAPI disksQuorum int // If set updates will be sent regularly to this channel.
Go - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Fri May 03 11:18:58 GMT 2024 - 47.6K bytes - Viewed (0) -
guava-tests/test/com/google/common/collect/TableCollectionTest.java
table.put('a', "two", 2); table.put('a', "three", 3); table.put('b', "four", 4); return table.row('a'); } } static final Function<@Nullable Integer, @Nullable Integer> DIVIDE_BY_2 = new Function<@Nullable Integer, @Nullable Integer>() { @Override public @Nullable Integer apply(@Nullable Integer input) { return (input == null) ? null : input / 2; }
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Mon Feb 19 20:34:55 GMT 2024 - 35.3K bytes - Viewed (0)