Search Options

Results per page
Sort
Preferred Languages
Advance

Results 301 - 310 of 1,222 for take (0.01 sec)

  1. src/archive/tar/reader.go

    	var paxHdrs map[string]string
    	var gnuLongName, gnuLongLink string
    
    	// Externally, Next iterates through the tar archive as if it is a series of
    	// files. Internally, the tar format often uses fake "files" to add meta
    	// data that describes the next file. These meta data "files" should not
    	// normally be visible to the outside. As such, this loop iterates through
    	// one or more "header files" until it finds a "normal file".
    Registered: Tue Sep 09 11:13:09 UTC 2025
    - Last Modified: Fri Mar 08 01:59:14 UTC 2024
    - 26.8K bytes
    - Viewed (0)
  2. cmd/iam-object-store.go

    func listIAMConfigItems(ctx context.Context, objAPI ObjectLayer, pathPrefix string) <-chan itemOrErr[string] {
    	ch := make(chan itemOrErr[string])
    
    	go func() {
    		defer xioutil.SafeClose(ch)
    
    		// Allocate new results channel to receive ObjectInfo.
    		objInfoCh := make(chan itemOrErr[ObjectInfo])
    
    		if err := objAPI.Walk(ctx, minioMetaBucket, pathPrefix, objInfoCh, WalkOptions{}); err != nil {
    			select {
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Fri Aug 29 02:39:48 UTC 2025
    - 26.6K bytes
    - Viewed (0)
  3. android/guava/src/com/google/common/util/concurrent/AbstractScheduledService.java

              return new FutureAsCancellable(immediateCancelledFuture());
            }
            // We reschedule ourselves with a lock held for two reasons. 1. we want to make sure that
            // cancel calls cancel on the correct future. 2. we want to make sure that the assignment
            // to currentFuture doesn't race with itself so that currentFuture is assigned in the
            // correct order.
            Throwable scheduleFailure = null;
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Sat Aug 09 01:14:59 UTC 2025
    - 27.7K bytes
    - Viewed (0)
  4. lib/fips140/Makefile

    # license that can be found in the LICENSE file.
    
    # Rules for building and testing new FIPS snapshots.
    # For example:
    #
    #	make v1.2.3.zip
    #	make v1.2.3.test
    #
    # and then if changes are needed, check them into master
    # and run 'make v1.2.3.rm' and repeat.
    #
    # Note that once published a snapshot zip file should never
    # be modified. We record the sha256 hashes of the zip files
    Registered: Tue Sep 09 11:13:09 UTC 2025
    - Last Modified: Wed Jan 29 15:10:35 UTC 2025
    - 1.4K bytes
    - Viewed (0)
  5. src/bufio/bufio.go

    func NewReaderSize(rd io.Reader, size int) *Reader {
    	// Is it already a Reader?
    	b, ok := rd.(*Reader)
    	if ok && len(b.buf) >= size {
    		return b
    	}
    	r := new(Reader)
    	r.reset(make([]byte, max(size, minReadBufferSize)), rd)
    	return r
    }
    
    // NewReader returns a new [Reader] whose buffer has the default size.
    func NewReader(rd io.Reader) *Reader {
    	return NewReaderSize(rd, defaultBufSize)
    }
    
    Registered: Tue Sep 09 11:13:09 UTC 2025
    - Last Modified: Wed Sep 03 14:04:47 UTC 2025
    - 22K bytes
    - Viewed (0)
  6. CONTRIBUTING.md

    ### Create your feature branch
    
    Before making code changes, make sure you create a separate branch for these changes
    
    ```
    git checkout -b my-new-feature
    ```
    
    ### Test MinIO server changes
    
    After your code changes, make sure
    
    - To add test cases for the new code. If you have questions about how to do it, please ask on our [Slack](https://slack.min.io) channel.
    - To run `make verifiers`
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Mon Aug 05 18:35:53 UTC 2024
    - 2.9K bytes
    - Viewed (0)
  7. cmd/peer-s3-client.go

    			return nil
    		}, idx)
    	}
    
    	errs := g.Wait()
    
    	// The list of buckets in a map to avoid duplication
    	resultMap := make(map[string]BucketInfo)
    
    	for poolIdx := 0; poolIdx < sys.poolsCount; poolIdx++ {
    		perPoolErrs := make([]error, 0, len(sys.peerClients))
    		for i, client := range sys.peerClients {
    			if slices.Contains(client.GetPools(), poolIdx) {
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Fri Aug 29 02:39:48 UTC 2025
    - 15.6K bytes
    - Viewed (0)
  8. callbacks/helper.go

    				if v, ok := selectColumns[k]; (ok && v) || (!ok && !restricted) {
    					result[k] = make([]interface{}, len(mapValues))
    					columns = append(columns, k)
    				} else {
    					continue
    				}
    			}
    
    			result[k][idx] = v
    		}
    	}
    
    	sort.Strings(columns)
    	values.Values = make([][]interface{}, len(mapValues))
    	values.Columns = make([]clause.Column, len(columns))
    	for idx, column := range columns {
    Registered: Sun Sep 07 09:35:13 UTC 2025
    - Last Modified: Thu Apr 14 12:32:57 UTC 2022
    - 3.7K bytes
    - Viewed (0)
  9. .github/workflows/replication.yaml

              sudo sysctl net.ipv6.conf.all.disable_ipv6=0
              sudo sysctl net.ipv6.conf.default.disable_ipv6=0
              make test-decom
    
          - name: Test ILM
            run: |
              sudo sysctl net.ipv6.conf.all.disable_ipv6=0
              sudo sysctl net.ipv6.conf.default.disable_ipv6=0
              make test-ilm
              make test-ilm-transition
    
          - name: Test PBAC
            run: |
              sudo sysctl net.ipv6.conf.all.disable_ipv6=0
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Wed Apr 09 14:28:39 UTC 2025
    - 2.2K bytes
    - Viewed (0)
  10. src/bytes/compare_test.go

    func TestCompareBytes(t *testing.T) {
    	lengths := make([]int, 0) // lengths to test in ascending order
    	for i := 0; i <= 128; i++ {
    		lengths = append(lengths, i)
    	}
    	lengths = append(lengths, 256, 512, 1024, 1333, 4095, 4096, 4097)
    
    	if !testing.Short() {
    		lengths = append(lengths, 65535, 65536, 65537, 99999)
    	}
    
    	n := lengths[len(lengths)-1]
    	a := make([]byte, n+1)
    	b := make([]byte, n+1)
    	for _, len := range lengths {
    Registered: Tue Sep 09 11:13:09 UTC 2025
    - Last Modified: Thu Jul 13 23:11:42 UTC 2023
    - 6.8K bytes
    - Viewed (0)
Back to top