- Sort Score
- Num 10 results
- Language All
Results 91 - 100 of 639 for larger (0.06 seconds)
-
src/main/java/jcifs/Configuration.java
* * @return RDMA provider name ("auto", "disni", "tcp", etc.) */ String getRdmaProvider(); /** * Get RDMA read/write threshold * * Operations larger than this size will use RDMA read/write * instead of send/receive. * * @return threshold in bytes */ int getRdmaReadWriteThreshold(); /** * Get maximum RDMA send sizeCreated: Sun Apr 05 00:10:12 GMT 2026 - Last Modified: Sun Aug 31 08:00:57 GMT 2025 - 25.4K bytes - Click Count (0) -
src/archive/tar/reader.go
} } return hdr, &tr.blk, p.err } // readOldGNUSparseMap reads the sparse map from the old GNU sparse format. // The sparse map is stored in the tar header if it's small enough. // If it's larger than four entries, then one or more extension headers are used // to store the rest of the sparse map. // // The Header.Size does not reflect the size of any extended headers used.
Created: Tue Apr 07 11:13:11 GMT 2026 - Last Modified: Tue Oct 07 19:46:36 GMT 2025 - 26.9K bytes - Click Count (0) -
src/bytes/buffer_test.go
package bytes_test import ( . "bytes" "fmt" "internal/testenv" "io" "math/rand" "strconv" "testing" "unicode/utf8" ) const N = 10000 // make this bigger for a larger (and slower) test var testString string // test data for write tests var testBytes []byte // test data; same as testString but as a slice. type negativeReader struct{}
Created: Tue Apr 07 11:13:11 GMT 2026 - Last Modified: Fri Nov 14 19:01:17 GMT 2025 - 19.4K bytes - Click Count (0) -
guava/src/com/google/common/collect/CompactHashMap.java
* * <p>Unlike {@code java.util.HashMap}, iteration is only proportional to the actual {@code size()}, * which is optimal, and <i>not</i> the size of the internal hashtable, which could be much larger * than {@code size()}. Furthermore, this structure places significantly reduced load on the garbage * collector by only using a constant number of internal objects. *Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Tue Jul 08 18:32:10 GMT 2025 - 39.6K bytes - Click Count (0) -
cmd/object-handlers_test.go
// Part with size larger than 5 MiB. {bucketName, objectName, uploadIDs[0], 5, string(validPart), validPartMD5, int64(len(validPart))}, {bucketName, objectName, uploadIDs[0], 6, string(validPart), validPartMD5, int64(len(validPart))}, // Part with size larger than 5 MiB. // Parts uploaded for anonymous/unsigned API handler test.Created: Sun Apr 05 19:28:12 GMT 2026 - Last Modified: Sun Sep 28 20:59:21 GMT 2025 - 163.1K bytes - Click Count (0) -
CREDITS
the recipients' rights in the Source Code Form under this License. 3.3. Distribution of a Larger Work You may create and distribute a Larger Work under terms of Your choice, provided that You also comply with the requirements of this License for the Covered Software. If the Larger Work is a combination of Covered Software with a work governed by one or more Secondary Licenses, and the
Created: Sun Apr 05 19:28:12 GMT 2026 - Last Modified: Thu Mar 13 05:29:51 GMT 2025 - 1.8M bytes - Click Count (0) -
cmd/object-multipart-handlers.go
"github.com/minio/minio/internal/logger" "github.com/minio/mux" "github.com/minio/pkg/v3/policy" "github.com/minio/sio" ) // Multipart objectAPIHandlers // NewMultipartUploadHandler - New multipart upload. // Notice: The S3 client can send secret keys in headers for encryption related jobs, // the handler should ensure to remove these keys before sending them to the object layer. // Currently these keys are:
Created: Sun Apr 05 19:28:12 GMT 2026 - Last Modified: Sun Sep 07 16:13:09 GMT 2025 - 39.5K bytes - Click Count (1) -
src/bufio/bufio.go
// into the buffer in order to make n bytes available. If Peek returns fewer // than n bytes, it also returns an error explaining why the read is short. // The error is [ErrBufferFull] if n is larger than b's buffer size. // // Calling Peek prevents a [Reader.UnreadByte] or [Reader.UnreadRune] call from succeeding // until the next read operation. func (b *Reader) Peek(n int) ([]byte, error) { if n < 0 {
Created: Tue Apr 07 11:13:11 GMT 2026 - Last Modified: Fri Feb 06 17:28:40 GMT 2026 - 22K bytes - Click Count (0) -
android/guava/src/com/google/common/collect/CompactHashMap.java
* * <p>Unlike {@code java.util.HashMap}, iteration is only proportional to the actual {@code size()}, * which is optimal, and <i>not</i> the size of the internal hashtable, which could be much larger * than {@code size()}. Furthermore, this structure places significantly reduced load on the garbage * collector by only using a constant number of internal objects. *Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Sat Aug 09 01:14:59 GMT 2025 - 35.7K bytes - Click Count (0) -
LICENSE
Each version is given a distinguishing version number. If the Program specifies that a certain numbered version of the GNU Affero General Public License "or any later version" applies to it, you have the option of following the terms and conditions either of that numbered version or of any later version published by the Free Software Foundation. If the Program does not specify a version number of the
Created: Sun Apr 05 19:28:12 GMT 2026 - Last Modified: Fri Apr 23 18:58:53 GMT 2021 - 33.7K bytes - Click Count (0)