Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 4 of 4 for rambling (0.8 sec)

  1. src/cmd/covdata/covdata.go

    var memprofileflag = flag.String("memprofile", "", "Write memory profile to specified file")
    var memprofilerateflag = flag.Int("memprofilerate", 0, "Set memprofile sampling rate to value")
    
    var matchpkg func(name string) bool
    
    var atExitFuncs []func()
    
    func atExit(f func()) {
    	atExitFuncs = append(atExitFuncs, f)
    }
    
    func Exit(code int) {
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Tue May 14 19:41:17 UTC 2024
    - 5.7K bytes
    - Viewed (0)
  2. src/cmd/vendor/github.com/google/pprof/profile/legacy_java_profile.go

    				}
    			case "contention/resolution":
    				p.SampleType = []*ValueType{
    					{Type: "contentions", Unit: "count"},
    					{Type: "delay", Unit: value},
    				}
    			case "contention/sampling period":
    				p.PeriodType = &ValueType{
    					Type: "contentions", Unit: "count",
    				}
    				if p.Period, err = strconv.ParseInt(value, 0, 64); err != nil {
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Fri Feb 16 15:19:53 UTC 2024
    - 8.8K bytes
    - Viewed (0)
  3. src/crypto/ecdsa/ecdsa.go

    	if err != nil {
    		return nil, err
    	}
    	return priv, nil
    }
    
    // randomPoint returns a random scalar and the corresponding point using the
    // procedure given in FIPS 186-4, Appendix B.5.2 (rejection sampling).
    func randomPoint[Point nistPoint[Point]](c *nistCurve[Point], rand io.Reader) (k *bigmod.Nat, p Point, err error) {
    	k = bigmod.NewNat()
    	for {
    		b := make([]byte, c.N.Size())
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Thu May 23 00:11:18 UTC 2024
    - 20.4K bytes
    - Viewed (0)
  4. src/crypto/ecdh/ecdh_test.go

    	testAllCurves(t, func(t *testing.T, curve ecdh.Curve) {
    		r := &countingReader{r: rand.Reader}
    		k, err := curve.GenerateKey(r)
    		if err != nil {
    			t.Fatal(err)
    		}
    
    		// GenerateKey does rejection sampling. If the masking works correctly,
    		// the probability of a rejection is 1-ord(G)/2^ceil(log2(ord(G))),
    		// which for all curves is small enough (at most 2^-32, for P-256) that
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Wed Mar 27 18:23:49 UTC 2024
    - 18K bytes
    - Viewed (0)
Back to top