Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 1 - 10 of 363 for readTo (0.04 seconds)

  1. internal/hash/reader.go

    )
    
    // A Reader wraps an io.Reader and computes the MD5 checksum
    // of the read content as ETag. Optionally, it also computes
    // the SHA256 checksum of the content.
    //
    // If the reference values for the ETag and content SHA26
    // are not empty then it will check whether the computed
    // match the reference values.
    type Reader struct {
    	src         io.Reader
    	bytesRead   int64
    	expectedMin int64
    Created: Sun Dec 28 19:28:13 GMT 2025
    - Last Modified: Wed Jun 25 15:08:54 GMT 2025
    - 11.8K bytes
    - Click Count (0)
  2. src/archive/zip/reader.go

    // the [ErrInsecurePath] error and use the returned reader.
    func NewReader(r io.ReaderAt, size int64) (*Reader, error) {
    	if size < 0 {
    		return nil, errors.New("zip: size cannot be negative")
    	}
    	zr := new(Reader)
    	var err error
    	if err = zr.init(r, size); err != nil && err != ErrInsecurePath {
    		return nil, err
    	}
    	return zr, err
    }
    
    func (r *Reader) init(rdr io.ReaderAt, size int64) error {
    Created: Tue Dec 30 11:13:12 GMT 2025
    - Last Modified: Tue Mar 11 22:19:38 GMT 2025
    - 28.4K bytes
    - Click Count (0)
  3. src/archive/tar/reader.go

    	"strconv"
    	"strings"
    	"time"
    )
    
    // Reader provides sequential access to the contents of a tar archive.
    // Reader.Next advances to the next file in the archive (including the first),
    // and then Reader can be treated as an io.Reader to access the file's data.
    type Reader struct {
    	r    io.Reader
    	pad  int64      // Amount of padding (ignored) after current file entry
    	curr fileReader // Reader for current file entry
    Created: Tue Dec 30 11:13:12 GMT 2025
    - Last Modified: Tue Oct 07 19:46:36 GMT 2025
    - 26.9K bytes
    - Click Count (0)
  4. docs/config/README.md

    By default, parity for objects with standard storage class is set to `N/2`, and parity for objects with reduced redundancy storage class objects is set to `2`. Read more about storage class support in MinIO server [here](https://github.com/minio/minio/blob/master/docs/erasure/storage-class/README.md).
    
    ```
    KEY:
    storage_class  define object level redundancy
    
    ARGS:
    Created: Sun Dec 28 19:28:13 GMT 2025
    - Last Modified: Tue Aug 12 18:20:36 GMT 2025
    - 18.1K bytes
    - Click Count (1)
  5. cmd/perf-tests.go

    	Error         string
    }
    
    func newRandomReader(size int) io.Reader {
    	return io.LimitReader(randreader.New(), int64(size))
    }
    
    type firstByteRecorder struct {
    	t *time.Time
    	r io.Reader
    }
    
    func (f *firstByteRecorder) Read(p []byte) (n int, err error) {
    	if f.t != nil || len(p) == 0 {
    		return f.r.Read(p)
    	}
    	// Read a single byte.
    	n, err = f.r.Read(p[:1])
    	if n > 0 {
    		t := time.Now()
    		f.t = &t
    	}
    Created: Sun Dec 28 19:28:13 GMT 2025
    - Last Modified: Sun Sep 28 20:59:21 GMT 2025
    - 11.8K bytes
    - Click Count (0)
  6. cmd/metacache-stream_test.go

    "src/compress/gzip/testdata/issue6550.gz.base64", "src/compress/lzw/", "src/compress/lzw/reader.go", "src/compress/lzw/reader_test.go", "src/compress/lzw/writer.go", "src/compress/lzw/writer_test.go", "src/compress/testdata/", "src/compress/testdata/e.txt", "src/compress/testdata/gettysburg.txt", "src/compress/testdata/pi.txt", "src/compress/zlib/", "src/compress/zlib/example_test.go", "src/compress/zlib/reader.go", "src/compress/zlib/reader_test.go", "src/compress/zlib/writer.go", "src/compress/z...
    Created: Sun Dec 28 19:28:13 GMT 2025
    - Last Modified: Wed Apr 09 14:28:39 GMT 2025
    - 15K bytes
    - Click Count (0)
  7. docs/bucket/versioning/README.md

    unintended overwrites, deletions, protect objects with retention policies.
    
    To control data retention and storage usage, use object versioning with [object lifecycle management](https://github.com/minio/minio/blob/master/docs/bucket/lifecycle/README.md).  If you have an object expiration lifecycle policy in your non-versioned bucket and you want to maintain the same permanent delete behavior when on versioning-enabled bucket, you must add a noncurrent expiration policy. The noncurrent expiration...
    Created: Sun Dec 28 19:28:13 GMT 2025
    - Last Modified: Tue Aug 12 18:20:36 GMT 2025
    - 12K bytes
    - Click Count (0)
  8. docs/bigdata/README.md

    fs.s3a.max.total.tasks=2048 # Maximum number of parallel tasks
    fs.s3a.multipart.size=512M # Size of each multipart chunk
    fs.s3a.multipart.threshold=512M # Size before using multipart uploads
    fs.s3a.socket.recv.buffer=65536 # Read socket buffer hint
    fs.s3a.socket.send.buffer=65536 # Write socket buffer hint
    fs.s3a.threads.max=2048 # Maximum number of threads for S3A
    ```
    
    The rest of the other optimization options are discussed in the links below
    
    Created: Sun Dec 28 19:28:13 GMT 2025
    - Last Modified: Tue Aug 12 18:20:36 GMT 2025
    - 14.7K bytes
    - Click Count (0)
  9. docs/security/README.md

    More details about supported KMS implementations and configuration can be found at the [KMS guide](https://github.com/minio/minio/blob/master/docs/kms/README.md).
    
    Created: Sun Dec 28 19:28:13 GMT 2025
    - Last Modified: Wed Feb 26 09:25:50 GMT 2025
    - 13.8K bytes
    - Click Count (0)
  10. src/bufio/bufio.go

    )
    
    // Buffered input.
    
    // Reader implements buffering for an io.Reader object.
    // A new Reader is created by calling [NewReader] or [NewReaderSize];
    // alternatively the zero value of a Reader may be used after calling [Reset]
    // on it.
    type Reader struct {
    	buf          []byte
    	rd           io.Reader // reader provided by the client
    	r, w         int       // buf read and write positions
    	err          error
    Created: Tue Dec 30 11:13:12 GMT 2025
    - Last Modified: Wed Sep 03 14:04:47 GMT 2025
    - 22K bytes
    - Click Count (0)
Back to Top