Search Options

Results per page
Sort
Preferred Languages
Advance

Results 111 - 120 of 283 for 1000Mi (0.19 sec)

  1. cmd/mrf.go

    package cmd
    
    import (
    	"context"
    	"time"
    
    	"github.com/google/uuid"
    	"github.com/minio/madmin-go/v3"
    	"github.com/minio/pkg/v3/wildcard"
    )
    
    const (
    	mrfOpsQueueSize = 100000
    )
    
    // partialOperation is a successful upload/delete of an object
    // but not written in all disks (having quorum)
    type partialOperation struct {
    	bucket              string
    	object              string
    Registered: Sun Jun 16 00:44:34 UTC 2024
    - Last Modified: Fri May 24 23:05:23 UTC 2024
    - 3.2K bytes
    - Viewed (0)
  2. cmd/data-usage_test.go

    func TestDataUsageUpdate(t *testing.T) {
    	base := t.TempDir()
    	const bucket = "bucket"
    	files := []usageTestFile{
    		{name: "rootfile", size: 10000},
    		{name: "rootfile2", size: 10000},
    		{name: "dir1/d1file", size: 2000},
    		{name: "dir2/d2file", size: 300},
    		{name: "dir1/dira/dafile", size: 100000},
    		{name: "dir1/dira/dbfile", size: 200000},
    		{name: "dir1/dira/dirasub/dcfile", size: 1000000},
    Registered: Sun Jun 16 00:44:34 UTC 2024
    - Last Modified: Wed Mar 27 15:10:40 UTC 2024
    - 14.1K bytes
    - Viewed (0)
  3. security/pkg/nodeagent/sds/server.go

    import (
    	"net"
    	"time"
    
    	"go.uber.org/atomic"
    	"google.golang.org/grpc"
    
    	mesh "istio.io/api/mesh/v1alpha1"
    	"istio.io/istio/pkg/security"
    	"istio.io/istio/pkg/uds"
    )
    
    const (
    	maxStreams    = 100000
    	maxRetryTimes = 5
    )
    
    // Server is the gPRC server that exposes SDS through UDS.
    type Server struct {
    	workloadSds *sdsservice
    
    	grpcWorkloadListener net.Listener
    
    	grpcWorkloadServer *grpc.Server
    Registered: Fri Jun 14 15:00:06 UTC 2024
    - Last Modified: Fri Jun 07 17:44:41 UTC 2024
    - 3.3K bytes
    - Viewed (0)
  4. pkg/proxy/iptables/proxier_test.go

    		{
    			name:     "no match",
    			sourceIP: "10.0.0.2",
    			destIP:   "10.0.0.3",
    			destPort: 80,
    			output:   "",
    		},
    		{
    			name:     "single endpoint",
    			sourceIP: "10.0.0.2",
    			destIP:   "172.30.0.41",
    			destPort: 80,
    			output:   "10.180.0.1:80",
    		},
    		{
    			name:     "multiple endpoints",
    			sourceIP: "10.0.0.2",
    			destIP:   "172.30.0.44",
    			destPort: 80,
    Registered: Sat Jun 15 01:39:40 UTC 2024
    - Last Modified: Tue May 21 14:39:54 UTC 2024
    - 249.9K bytes
    - Viewed (1)
  5. src/test/java/org/codelibs/core/collection/CaseInsensitiveMapTest.java

        }
    
        /**
         * @throws Exception
         */
        @Test
        public void testPerformance() throws Exception {
            for (int j = 0; j < 3; ++j) {
                final int num = 100000;
                final Map<String, String> hmap = new HashMap<String, String>();
                final Map<String, String> cimap = new CaseInsensitiveMap<String>();
    
                long start = System.currentTimeMillis();
    Registered: Wed Jun 12 12:50:12 UTC 2024
    - Last Modified: Thu Mar 07 01:59:08 UTC 2024
    - 4K bytes
    - Viewed (0)
  6. src/math/arith_s390x_test.go

    		t.Skipf("no vector support")
    	}
    	large := float64(100000 * Pi)
    	for i := 0; i < len(vf); i++ {
    		f1 := cosLarge[i]
    		f2 := CosNoVec(vf[i] + large)
    		if !close(f1, f2) {
    			t.Errorf("Cos(%g) = %g, want %g", vf[i]+large, f2, f1)
    		}
    	}
    }
    
    func TestLargeSinNovec(t *testing.T) {
    	if !HasVX {
    		t.Skipf("no vector support")
    	}
    	large := float64(100000 * Pi)
    	for i := 0; i < len(vf); i++ {
    		f1 := sinLarge[i]
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Mon May 08 19:52:30 UTC 2017
    - 10.8K bytes
    - Viewed (0)
  7. subprojects/core-api/src/main/java/org/gradle/api/tasks/util/internal/CachingPatternSpecFactory.java

    import java.util.concurrent.Callable;
    import java.util.concurrent.ExecutionException;
    
    public class CachingPatternSpecFactory extends PatternSpecFactory {
        private static final int RESULTS_CACHE_MAX_SIZE = 100000;
        private static final int INSTANCES_MAX_SIZE = 30000;
        private final HeapProportionalCacheSizer cacheSizer;
        private final Cache<SpecKey, Spec<FileTreeElement>> specInstanceCache;
    
    Registered: Wed Jun 12 18:38:38 UTC 2024
    - Last Modified: Thu Sep 20 05:40:52 UTC 2018
    - 4.9K bytes
    - Viewed (0)
  8. android/guava-tests/benchmark/com/google/common/base/WhitespaceMatcherBenchmark.java

          result[i] = allMatchingChars.charAt(random.nextInt(allMatchingChars.length()));
        }
        // Replace some of chars by non-matching.
        int remaining = (int) ((100 - percentMatching) * result.length / 100.0 + 0.5);
        while (remaining > 0) {
          final char c = (char) random.nextInt();
          if (bitSet.get(c)) {
            final int pos = random.nextInt(result.length);
            if (bitSet.get(result[pos])) {
    Registered: Wed Jun 12 16:38:11 UTC 2024
    - Last Modified: Wed May 16 22:49:59 UTC 2018
    - 3.9K bytes
    - Viewed (0)
  9. guava-tests/benchmark/com/google/common/base/WhitespaceMatcherBenchmark.java

          result[i] = allMatchingChars.charAt(random.nextInt(allMatchingChars.length()));
        }
        // Replace some of chars by non-matching.
        int remaining = (int) ((100 - percentMatching) * result.length / 100.0 + 0.5);
        while (remaining > 0) {
          final char c = (char) random.nextInt();
          if (bitSet.get(c)) {
            final int pos = random.nextInt(result.length);
            if (bitSet.get(result[pos])) {
    Registered: Wed Jun 12 16:38:11 UTC 2024
    - Last Modified: Wed May 16 22:49:59 UTC 2018
    - 3.9K bytes
    - Viewed (0)
  10. src/math/big/prime_test.go

    		[]int{989, 3239, 5777, 10877, 27971, 29681, 30739, 31631, 39059, 72389, 73919, 75077})
    }
    
    func testPseudoprimes(t *testing.T, name string, cond func(nat) bool, want []int) {
    	n := nat{1}
    	for i := 3; i < 100000; i += 2 {
    		if testing.Short() {
    			if len(want) == 0 {
    				break
    			}
    			if i < want[0]-2 {
    				i = want[0] - 2
    			}
    		}
    		n[0] = Word(i)
    		pseudo := cond(n)
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Wed May 22 12:54:00 UTC 2019
    - 7.1K bytes
    - Viewed (0)
Back to top