Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 10 of 827 for Make (0.21 sec)

  1. internal/pubsub/pubsub_test.go

    		t.Fatalf("want %d subscribers, got %d", want, got)
    	}
    }
    
    func TestSubscribeExceedingLimit(t *testing.T) {
    	ps := New[Maskable, Maskable](2)
    	ch1 := make(chan Maskable, 1)
    	ch2 := make(chan Maskable, 1)
    	ch3 := make(chan Maskable, 1)
    	doneCh := make(chan struct{})
    	defer close(doneCh)
    	if err := ps.Subscribe(MaskAll, ch1, doneCh, nil); err != nil {
    		t.Fatalf("unexpected error: %v", err)
    	}
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Wed Aug 14 17:11:51 UTC 2024
    - 5.8K bytes
    - Viewed (0)
  2. .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 Nov 03 19:28:11 UTC 2024
    - Last Modified: Thu Oct 31 22:10:24 UTC 2024
    - 2.2K bytes
    - Viewed (0)
  3. 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 Nov 03 19:28:11 UTC 2024
    - Last Modified: Mon Aug 05 18:35:53 UTC 2024
    - 2.9K bytes
    - Viewed (0)
  4. 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 Nov 03 19:28:11 UTC 2024
    - Last Modified: Tue Aug 13 22:26:05 UTC 2024
    - 15.4K bytes
    - Viewed (0)
  5. src/bytes/buffer_test.go

    		}
    
    		rlen := rand.Intn(len(testString))
    		fub := make([]byte, rlen)
    		n, _ := buf.Read(fub)
    		s = s[n:]
    	}
    	empty(t, "TestMixedReadsAndWrites (2)", &buf, s, make([]byte, buf.Len()))
    }
    
    func TestCapWithPreallocatedSlice(t *testing.T) {
    	buf := NewBuffer(make([]byte, 10))
    	n := buf.Cap()
    	if n != 10 {
    		t.Errorf("expected 10, got %d", n)
    	}
    }
    
    Registered: Tue Nov 05 11:13:11 UTC 2024
    - Last Modified: Tue Sep 03 20:55:15 UTC 2024
    - 18.6K bytes
    - Viewed (0)
  6. cmd/erasure-metadata-utils.go

    func shuffleDisksAndPartsMetadataByIndex(disks []StorageAPI, metaArr []FileInfo, fi FileInfo) (shuffledDisks []StorageAPI, shuffledPartsMetadata []FileInfo) {
    	shuffledDisks = make([]StorageAPI, len(disks))
    	shuffledPartsMetadata = make([]FileInfo, len(disks))
    	distribution := fi.Erasure.Distribution
    
    	var inconsistent int
    	for i, meta := range metaArr {
    		if disks[i] == nil {
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Fri May 24 23:05:23 UTC 2024
    - 11.7K bytes
    - Viewed (0)
  7. internal/crypto/metadata_test.go

    			MetaIV: base64.StdEncoding.EncodeToString(append([]byte{1}, make([]byte, 31)...)), MetaAlgorithm: SealAlgorithm,
    			MetaSealedKeyS3: base64.StdEncoding.EncodeToString(append([]byte{1}, make([]byte, 63)...)), MetaKeyID: "key-1",
    			MetaDataEncryptionKey: base64.StdEncoding.EncodeToString(make([]byte, 48)),
    		},
    		DataKey: make([]byte, 48), KeyID: "key-1", SealedKey: SealedKey{Algorithm: SealAlgorithm, Key: [64]byte{1}, IV: [32]byte{1}},
    	}, // 10
    }
    
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Fri Jul 12 20:51:54 UTC 2024
    - 18.7K bytes
    - Viewed (0)
  8. Makefile

    #
    # The original version of this file is located in the https://github.com/istio/common-files repo.
    # If you're looking at this file in a different repo and want to make a change, please go to the
    # common-files repo, make the change there and check it in. Then come back to this repo and run
    # "make update-common".
    
    # Copyright Istio Authors
    #
    # Licensed under the Apache License, Version 2.0 (the "License");
    Registered: Wed Nov 06 22:53:10 UTC 2024
    - Last Modified: Tue Jul 23 15:00:31 UTC 2024
    - 2.3K bytes
    - Viewed (0)
  9. src/cmd/asm/internal/arch/arch.go

    	return false
    }
    
    func jumpWasm(word string) bool {
    	return word == "JMP" || word == "CALL" || word == "Call" || word == "Br" || word == "BrIf"
    }
    
    func archX86(linkArch *obj.LinkArch) *Arch {
    	register := make(map[string]int16)
    	// Create maps for easy lookup of instruction names etc.
    	for i, s := range x86.Register {
    		register[s] = int16(i + x86.REG_AL)
    	}
    	// Pseudo-registers.
    	register["SB"] = RSB
    Registered: Tue Nov 05 11:13:11 UTC 2024
    - Last Modified: Thu Oct 24 12:32:56 UTC 2024
    - 21.5K bytes
    - Viewed (0)
  10. cmd/peer-s3-server.go

    	globalLocalDrivesMu.RUnlock()
    
    	// Initialize sync waitgroup.
    	g := errgroup.WithNErrs(len(localDrives))
    
    	// Disk states slices
    	beforeState := make([]string, len(localDrives))
    	afterState := make([]string, len(localDrives))
    
    	// Make a volume entry on all underlying storage disks.
    	for index := range localDrives {
    		index := index
    		g.Go(func() (serr error) {
    			if localDrives[index] == nil {
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Thu Aug 22 21:57:20 UTC 2024
    - 8.1K bytes
    - Viewed (0)
Back to top