- Sort Score
- Result 10 results
- Languages All
Results 11 - 20 of 40 for upTo (0.12 sec)
-
guava-tests/test/com/google/common/collect/RangeTest.java
.addEqualityGroup(Range.atLeast(1), Range.downTo(1, CLOSED)) .addEqualityGroup(Range.greaterThan(1), Range.downTo(1, OPEN)) .addEqualityGroup(Range.atMost(7), Range.upTo(7, CLOSED)) .addEqualityGroup(Range.lessThan(7), Range.upTo(7, OPEN)) .addEqualityGroup(Range.open(1, 7), Range.range(1, OPEN, 7, OPEN)) .addEqualityGroup(Range.openClosed(1, 7), Range.range(1, OPEN, 7, CLOSED))
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Feb 21 10:16:44 GMT 2024 - 24.1K bytes - Viewed (0) -
cmd/dummy-data-generator_test.go
import ( "bytes" "errors" "fmt" "io" "testing" ) var alphabets = []byte("abcdefghijklmnopqrstuvwxyz0123456789") // DummyDataGen returns a reader that repeats the bytes in `alphabets` // upto the desired length. type DummyDataGen struct { b []byte idx, length int64 } // NewDummyDataGen returns a ReadSeeker over the first `totalLength` // bytes from the infinite stream consisting of repeated
Go - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Mon Sep 19 18:05:16 GMT 2022 - 4.8K bytes - Viewed (0) -
docs/distributed/DESIGN.md
is a single erasure coding unit within a MinIO deployment. An object is sharded within an erasure set. Erasure set size is automatically calculated based on the number of drives. MinIO supports unlimited number of drives but each erasure set can be upto 16 drives and a minimum of 2 drives. - We limited the number of drives to 16 for erasure set because, erasure code shards more than 16 can become chatty and do not have any performance advantages. Additionally since 16 drive erasure set gives...
Plain Text - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Tue Aug 15 23:04:20 GMT 2023 - 8K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/collect/RangeTest.java
.addEqualityGroup(Range.atLeast(1), Range.downTo(1, CLOSED)) .addEqualityGroup(Range.greaterThan(1), Range.downTo(1, OPEN)) .addEqualityGroup(Range.atMost(7), Range.upTo(7, CLOSED)) .addEqualityGroup(Range.lessThan(7), Range.upTo(7, OPEN)) .addEqualityGroup(Range.open(1, 7), Range.range(1, OPEN, 7, OPEN)) .addEqualityGroup(Range.openClosed(1, 7), Range.range(1, OPEN, 7, CLOSED))
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Feb 21 10:16:44 GMT 2024 - 24.1K bytes - Viewed (0) -
cmd/batch-job-common-types.go
// # is local and target is remote which is also minio. // snowball: // disable: false # optionally turn-off snowball archive transfer // batch: 100 # upto this many objects per archive // inmemory: true # indicates if the archive must be staged locally or in-memory // compress: true # S2/Snappy compressed archive
Go - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Thu Feb 01 21:53:26 GMT 2024 - 7.9K bytes - Viewed (0) -
internal/config/dns/etcd_dns.go
for i, j := 0, len(ks)-1; i < j; i, j = i+1, j-1 { ks[i], ks[j] = ks[j], ks[i] } return strings.Join(ks, ".") } // Retrieves list of entries under the key passed. // Note that this method fetches entries upto only two levels deep. func (c *CoreDNS) list(key string, domain bool) ([]SrvRecord, error) { ctx, cancel := context.WithTimeout(context.Background(), defaultContextTimeout)
Go - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Sun Jan 02 17:15:06 GMT 2022 - 8.3K bytes - Viewed (0) -
cmd/endpoint-ellipses.go
if len(totalSizes) == 0 || len(args) == 0 { return nil, errInvalidArgument } setIndexes = make([][]uint64, len(totalSizes)) for _, totalSize := range totalSizes { // Check if totalSize has minimum range upto setSize if totalSize < setSizes[0] || totalSize < setDriveCount { msg := fmt.Sprintf("Incorrect number of endpoints provided %s", args) return nil, config.ErrInvalidNumberOfErasureEndpoints(nil).Msg(msg) } }
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) -
guava-tests/test/com/google/common/collect/TreeRangeSetTest.java
queryBuilder.add(Range.<Integer>all()); for (int i = MIN_BOUND; i <= MAX_BOUND; i++) { for (BoundType boundType : BoundType.values()) { queryBuilder.add(Range.upTo(i, boundType)); queryBuilder.add(Range.downTo(i, boundType)); } queryBuilder.add(Range.singleton(i)); queryBuilder.add(Range.openClosed(i, i)); queryBuilder.add(Range.closedOpen(i, i));
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Dec 16 19:54:45 GMT 2020 - 24.3K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/collect/ImmutableRangeSetTest.java
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Tue Feb 20 17:00:05 GMT 2024 - 21.6K bytes - Viewed (0) -
guava-tests/test/com/google/common/collect/ImmutableRangeSetTest.java
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Tue Feb 20 17:00:05 GMT 2024 - 21.2K bytes - Viewed (0)