- Sort Score
- Num 10 results
- Language All
Results 151 - 160 of 284 for 15 (0.01 seconds)
-
LICENSE
add to a covered work, you may (if authorized by the copyright holders of that material) supplement the terms of this License with terms: a) Disclaiming warranty or limiting liability differently from the terms of sections 15 and 16 of this License; or b) Requiring preservation of specified reasonable legal notices or author attributions in that material or in the Appropriate Legal Notices displayed by works containing it; or
Created: Sun Dec 28 19:28:13 GMT 2025 - Last Modified: Fri Apr 23 18:58:53 GMT 2021 - 33.7K bytes - Click Count (0) -
cmd/apierrorcode_string.go
_ = x[ErrAccessKeyDisabled-9] _ = x[ErrInvalidArgument-10] _ = x[ErrInvalidBucketName-11] _ = x[ErrInvalidDigest-12] _ = x[ErrInvalidRange-13] _ = x[ErrInvalidRangePartNumber-14] _ = x[ErrInvalidCopyPartRange-15] _ = x[ErrInvalidCopyPartRangeSource-16] _ = x[ErrInvalidMaxKeys-17] _ = x[ErrInvalidEncodingMethod-18] _ = x[ErrInvalidMaxUploads-19] _ = x[ErrInvalidMaxParts-20] _ = x[ErrInvalidPartNumberMarker-21]
Created: Sun Dec 28 19:28:13 GMT 2025 - Last Modified: Wed Apr 16 07:34:24 GMT 2025 - 21.6K bytes - Click Count (0) -
internal/event/target/kafka.go
config.Net.DialTimeout = (5 * time.Second) config.Net.WriteTimeout = (5 * time.Second) config.Metadata.Retry.Max = 1 config.Metadata.Retry.Backoff = (1 * time.Second) config.Metadata.RefreshFrequency = (15 * time.Minute) target.config = config brokers := []string{} for _, broker := range args.Brokers { brokers = append(brokers, broker.String()) } client, err := sarama.NewClient(brokers, config)Created: Sun Dec 28 19:28:13 GMT 2025 - Last Modified: Fri Sep 06 23:06:30 GMT 2024 - 13.6K bytes - Click Count (0) -
api/go1.4.txt
pkg debug/elf, const R_AARCH64_P32_LDST16_ABS_LO12_NC = 14 pkg debug/elf, const R_AARCH64_P32_LDST16_ABS_LO12_NC R_AARCH64 pkg debug/elf, const R_AARCH64_P32_LDST32_ABS_LO12_NC = 15 pkg debug/elf, const R_AARCH64_P32_LDST32_ABS_LO12_NC R_AARCH64 pkg debug/elf, const R_AARCH64_P32_LDST64_ABS_LO12_NC = 16 pkg debug/elf, const R_AARCH64_P32_LDST64_ABS_LO12_NC R_AARCH64
Created: Tue Dec 30 11:13:12 GMT 2025 - Last Modified: Fri Dec 12 03:01:01 GMT 2014 - 34K bytes - Click Count (0) -
guava/src/com/google/common/collect/RangeMap.java
*/ Map<Range<K>, V> asDescendingMapOfRanges(); /** * Returns a view of the part of this range map that intersects with {@code range}. * * <p>For example, if {@code rangeMap} had the entries {@code [1, 5] => "foo", (6, 8) => "bar", * (10, ∞) => "baz"} then {@code rangeMap.subRangeMap(Range.open(3, 12))} would return a range map * with the entries {@code (3, 5] => "foo", (6, 8) => "bar", (10, 12) => "baz"}. *
Created: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Sun Dec 22 03:38:46 GMT 2024 - 7.6K bytes - Click Count (0) -
guava/src/com/google/common/util/concurrent/AtomicDoubleArray.java
* http://creativecommons.org/publicdomain/zero/1.0/ */ /* * Source: * http://gee.cs.oswego.edu/cgi-bin/viewcvs.cgi/jsr166/src/jsr166e/extra/AtomicDoubleArray.java?revision=1.5 * (Modified to adapt to guava coding conventions and * to use AtomicLongArray instead of sun.misc.Unsafe) */ package com.google.common.util.concurrent;
Created: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Mon Mar 17 20:26:29 GMT 2025 - 10.2K bytes - Click Count (0) -
cmd/data-scanner_test.go
// Prepare object versions obj := "obj-1" // Simulate objects uploaded 30 hours ago modTime := now.Add(-48 * time.Hour) uuids := make([]uuid.UUID, 5) for i := range uuids { uuids[i] = uuid.UUID([16]byte{15: uint8(i + 1)}) } fivs := make([]FileInfo, 5) objInfos := make([]ObjectInfo, 5) objRetentionMeta := make(map[string]string) objRetentionMeta[strings.ToLower(xhttp.AmzObjectLockMode)] = string(objectlock.RetCompliance)
Created: Sun Dec 28 19:28:13 GMT 2025 - Last Modified: Fri Aug 29 02:39:48 GMT 2025 - 12K bytes - Click Count (0) -
docs/distributed/DESIGN.md
algorithm provides affinity towards odd number erasure sets to provide for uniform distribution across nodes*. This is to ensure that same number of drives are pariticipating in any erasure set. For example if you have 2 nodes with 180 drives then GCD is 15 but this would lead to uneven distribution, one of the nodes would participate more drives. To avoid this the affinity is given towards nodes which leads to next best GCD factor of 12 which provides uniform distribution. - In this algorithm,...
Created: Sun Dec 28 19:28:13 GMT 2025 - Last Modified: Wed Feb 26 09:25:50 GMT 2025 - 8K bytes - Click Count (2) -
docs/distributed/README.md
- The IP addresses and drive paths below are for demonstration purposes only, you need to replace these with the actual IP addresses and drive paths/folders. - Servers running distributed MinIO instances should be less than 15 minutes apart. You can enable [NTP](http://www.ntp.org/) service as a best practice to ensure same times across servers. - `MINIO_DOMAIN` environment variable should be defined and exported for bucket DNS style support.
Created: Sun Dec 28 19:28:13 GMT 2025 - Last Modified: Tue Aug 12 18:20:36 GMT 2025 - 8.9K bytes - Click Count (0) -
internal/dsync/lock-args_gen.go
return } } } o = bts return } // Msgsize returns an upper bound estimate of the number of bytes occupied by the serialized message func (z LockResp) Msgsize() (s int) { s = 1 + 5 + msgp.Uint8Size + 4 + msgp.StringPrefixSize + len(z.Err) return } // DecodeMsg implements msgp.Decodable func (z *ResponseCode) DecodeMsg(dc *msgp.Reader) (err error) { { var zb0001 uint8
Created: Sun Dec 28 19:28:13 GMT 2025 - Last Modified: Sun Sep 28 20:59:21 GMT 2025 - 10.2K bytes - Click Count (0)