Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 7 of 7 for makeText (0.17 sec)

  1. src/regexp/exec_test.go

    			}
    		}
    		x = append(x, v)
    		s = s[i+1:]
    	}
    	if len(x)%2 != 0 {
    		ok = false
    		return
    	}
    	ok = true
    	matched = true
    	pos = x
    	return
    }
    
    var text []byte
    
    func makeText(n int) []byte {
    	if len(text) >= n {
    		return text[:n]
    	}
    	text = make([]byte, n)
    	x := ^uint32(0)
    	for i := range text {
    		x += x
    		x ^= 1
    		if int32(x) < 0 {
    			x ^= 0x88888eef
    		}
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Mon Mar 25 19:36:03 UTC 2024
    - 20.7K bytes
    - Viewed (0)
  2. src/index/suffixarray/suffixarray_test.go

    			for i := range data {
    				data[i] = byte(rand.Intn(256))
    			}
    		}
    	}
    	b.StartTimer()
    	b.SetBytes(int64(len(data)))
    	for i := 0; i < b.N; i++ {
    		New(data)
    	}
    }
    
    func makeText(name string) ([]byte, error) {
    	var data []byte
    	switch name {
    	case "opticks":
    		var err error
    		data, err = os.ReadFile("../../testdata/Isaac.Newton-Opticks.txt")
    		if err != nil {
    			return nil, err
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Thu May 23 01:00:11 UTC 2024
    - 14.1K bytes
    - Viewed (0)
  3. staging/src/k8s.io/apimachinery/pkg/util/sets/set_test.go

    		{1000, 20, 60},
    	}
    
    	for i := range cases {
    		here := cases[i]
    		makeSet := func() String {
    			s := NewString()
    			for j := 0; j < here.size; j++ {
    				s.Insert(randomStringMaker.makeString(here.minStringLen, here.maxStringLen))
    			}
    			return s
    		}
    		operands := make([]String, 500)
    		for i := range operands {
    			operands[i] = makeSet()
    		}
    Registered: Sat Jun 15 01:39:40 UTC 2024
    - Last Modified: Thu Oct 20 03:47:18 UTC 2022
    - 8K bytes
    - Viewed (0)
  4. src/cmd/vendor/github.com/google/pprof/internal/driver/html/stacks.js

        function makeRect(cl, x, y, w, h) {
          const r = document.createElement('div');
          r.style.left = x+'px';
          r.style.top = y+'px';
          r.style.width = w+'px';
          r.style.height = h+'px';
          r.classList.add(cl);
          return r;
        }
    
        // Background
        const w = box.width - 1; // Leave 1px gap
        const r = makeRect('boxbg', box.x, box.y, w, ROW);
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Fri May 31 19:48:28 UTC 2024
    - 18.5K bytes
    - Viewed (0)
  5. pkg/scheduler/internal/queue/scheduling_queue_test.go

    	if err != nil {
    		t.Fatalf("unexpected error from AddUnschedulableIfNotPresent: %v", err)
    	}
    
    	expectedSet := makeSet([]*v1.Pod{medPriorityPodInfo.Pod, unschedulablePodInfo.Pod, highPriorityPodInfo.Pod})
    	gotPods, gotSummary := q.PendingPods()
    	if diff := cmp.Diff(expectedSet, makeSet(gotPods)); diff != "" {
    		t.Errorf("Unexpected list of pending Pods (-want, +got):\n%s", diff)
    	}
    Registered: Sat Jun 15 01:39:40 UTC 2024
    - Last Modified: Wed Jun 12 13:26:09 UTC 2024
    - 146.9K bytes
    - Viewed (0)
  6. src/crypto/x509/x509.go

    	oidMGF1 = asn1.ObjectIdentifier{1, 2, 840, 113549, 1, 1, 8}
    
    	// oidISOSignatureSHA1WithRSA means the same as oidSignatureSHA1WithRSA
    	// but it's specified by ISO. Microsoft's makecert.exe has been known
    	// to produce certificates with this OID.
    	oidISOSignatureSHA1WithRSA = asn1.ObjectIdentifier{1, 3, 14, 3, 2, 29}
    )
    
    var signatureAlgorithmDetails = []struct {
    	algo       SignatureAlgorithm
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Wed May 22 09:20:15 UTC 2024
    - 82K bytes
    - Viewed (0)
  7. src/internal/trace/traceviewer/static/trace_viewer_full.html

    function escapeData(s){return s.replace(escapeDataRegExp,escapeReplace);}
    function makeSet(arr){var set={};for(var i=0;i<arr.length;i++){set[arr[i]]=true;}
    return set;}
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Tue Nov 21 20:45:06 UTC 2023
    - 2.5M bytes
    - Viewed (0)
Back to top