Search Options

Results per page
Sort
Preferred Languages
Advance

Results 131 - 140 of 346 for slice (0.03 sec)

  1. istioctl/pkg/checkinject/checkinject.go

    		results = append(results, webhookAnalysis{
    			Name:     mwc.Name,
    			Revision: rev,
    			Injected: injected,
    			Reason:   reason,
    		})
    	}
    	sort.Slice(results, func(i, j int) bool {
    		return results[i].Name < results[j].Name
    	})
    	return results
    }
    
    Registered: Wed Nov 06 22:53:10 UTC 2024
    - Last Modified: Sat Apr 13 05:23:38 UTC 2024
    - 9.3K bytes
    - Viewed (0)
  2. guava/src/com/google/common/util/concurrent/Striped.java

          return array.length;
        }
      }
    
      /**
       * Implementation of Striped where up to 2^k stripes can be represented, using an
       * AtomicReferenceArray of size 2^k. To map a user key into a stripe, we take a k-bit slice of the
       * user key's (smeared) hashCode(). The stripes are lazily initialized and are weakly referenced.
       */
      @VisibleForTesting
      static class SmallLazyStriped<L> extends PowerOfTwoStriped<L> {
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Wed Jun 26 12:58:35 UTC 2024
    - 20.6K bytes
    - Viewed (0)
  3. cmd/erasure-healing-common_test.go

    func TestCommonTime(t *testing.T) {
    	// List of test cases for common modTime.
    	testCases := []struct {
    		times  []time.Time
    		time   time.Time
    		quorum int
    	}{
    		{
    			// 1. Tests common times when slice has varying time elements.
    			[]time.Time{
    				time.Unix(0, 1).UTC(),
    				time.Unix(0, 2).UTC(),
    				time.Unix(0, 3).UTC(),
    				time.Unix(0, 3).UTC(),
    				time.Unix(0, 2).UTC(),
    				time.Unix(0, 3).UTC(),
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Tue Oct 01 15:19:10 UTC 2024
    - 23.1K bytes
    - Viewed (0)
  4. istioctl/pkg/writer/envoy/clusters/clusters.go

    			return err
    		}
    	}
    	fmt.Fprintln(c.Stdout, string(out))
    	return nil
    }
    
    func retrieveSortedEndpointClusterSlice(ec []EndpointCluster) []EndpointCluster {
    	sort.Slice(ec, func(i, j int) bool {
    		if ec[i].address == ec[j].address {
    			if ec[i].port == ec[j].port {
    				return ec[i].cluster < ec[j].cluster
    			}
    			return ec[i].port < ec[j].port
    		}
    Registered: Wed Nov 06 22:53:10 UTC 2024
    - Last Modified: Thu Nov 03 08:41:32 UTC 2022
    - 5.8K bytes
    - Viewed (0)
  5. cmd/notification.go

    // returns the slice of errors from all function calls.
    func (g *NotificationGroup) Wait() []NotificationPeerErr {
    	g.workers.Wait()
    	return g.errs
    }
    
    // Go calls the given function in a new goroutine.
    //
    // The first call to return a non-nil error will be
    // collected in errs slice and returned by Wait().
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Mon Sep 09 16:58:30 UTC 2024
    - 46.2K bytes
    - Viewed (0)
  6. cmd/erasure-healing.go

    }
    
    func isAllVolumeNotFound(errs []error) bool {
    	return countErrs(errs, errVolumeNotFound) == len(errs)
    }
    
    // isAllNotFound will return if any element of the error slice is not
    // errFileNotFound, errFileVersionNotFound or errVolumeNotFound.
    // A 0 length slice will always return false.
    func isAllNotFound(errs []error) bool {
    	for _, err := range errs {
    		if err != nil {
    			switch err.Error() {
    			case errFileNotFound.Error():
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Wed Oct 02 17:50:41 UTC 2024
    - 34.4K bytes
    - Viewed (0)
  7. istioctl/pkg/writer/envoy/configdump/cluster.go

    			if err != nil {
    				return nil, err
    			}
    			clusters = append(clusters, clusterTyped)
    		}
    	}
    	if len(clusters) == 0 {
    		return nil, fmt.Errorf("no clusters found")
    	}
    	sort.Slice(clusters, func(i, j int) bool {
    		iDirection, iSubset, iName, iPort := safelyParseSubsetKey(clusters[i].Name)
    		jDirection, jSubset, jName, jPort := safelyParseSubsetKey(clusters[j].Name)
    		if iName == jName {
    Registered: Wed Nov 06 22:53:10 UTC 2024
    - Last Modified: Thu May 11 05:38:17 UTC 2023
    - 5.9K bytes
    - Viewed (0)
  8. cmd/object-api-utils.go

    	return bucketName == minioReservedBucket
    }
    
    // returns a slice of hosts by reading a slice of DNS records
    func getHostsSlice(records []dns.SrvRecord) []string {
    	hosts := make([]string, len(records))
    	for i, r := range records {
    		hosts[i] = net.JoinHostPort(r.Host, string(r.Port))
    	}
    	return hosts
    }
    
    // returns an online host (and corresponding port) from a slice of DNS records
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Thu Aug 08 15:29:58 UTC 2024
    - 37.1K bytes
    - Viewed (0)
  9. common-protos/k8s.io/api/admissionregistration/v1/generated.proto

      // APIGroups is the API groups the resources belong to. '*' is all groups.
      // If '*' is present, the length of the slice must be one.
      // Required.
      // +listType=atomic
      repeated string apiGroups = 1;
    
      // APIVersions is the API versions the resources belong to. '*' is all versions.
      // If '*' is present, the length of the slice must be one.
      // Required.
      // +listType=atomic
      repeated string apiVersions = 2;
    
    Registered: Wed Nov 06 22:53:10 UTC 2024
    - Last Modified: Mon Mar 11 18:43:24 UTC 2024
    - 24.4K bytes
    - Viewed (0)
  10. cmd/bucket-replication-utils_test.go

    	expectedReplicationStatus         replication.StatusType
    	expectedOpType                    replication.Type
    	expectedAction                    replicationAction
    }{
    	{ // 1. empty tgtInfos slice
    		name:                              "no replicated targets",
    		tgtInfos:                          []replicatedTargetInfo{},
    		expectedCompletedSize:             0,
    		expectedReplicationStatusInternal: "",
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Tue Aug 08 20:27:40 UTC 2023
    - 9.3K bytes
    - Viewed (0)
Back to top