Search Options

Results per page
Sort
Preferred Languages
Advance

Results 11 - 20 of 90 for Rr (0.02 sec)

  1. pkg/test/echo/responses.go

    	}
    	return count
    }
    
    // Match returns a subset of Responses that match the given predicate.
    func (r Responses) Match(f func(r Response) bool) Responses {
    	var matched []Response
    	for _, rr := range r {
    		if f(rr) {
    			matched = append(matched, rr)
    		}
    	}
    	return matched
    }
    
    func (r Responses) String() string {
    	out := ""
    	for i, resp := range r {
    		out += fmt.Sprintf("Response[%d]:\n%s", i, resp.String())
    	}
    Registered: Fri Jun 14 15:00:06 UTC 2024
    - Last Modified: Wed Feb 23 22:25:46 UTC 2022
    - 1.4K bytes
    - Viewed (0)
  2. src/crypto/internal/nistec/p256_ordinv.go

    	// form a×R and p256OrdMul calculates (a × b × R⁻¹) mod n. RR is R in the
    	// domain, or R×R mod n, thus p256OrdMul(x, RR) gives x×R, i.e. converts x
    	// into the Montgomery domain.
    	RR := &p256OrdElement{0x83244c95be79eea2, 0x4699799c49bd6fa6,
    		0x2845b2392b6bec59, 0x66e12d94f3d95620}
    
    	p256OrdMul(_1, x, RR)      // _1
    	p256OrdSqr(x, _1, 1)       // _10
    	p256OrdMul(_11, x, _1)     // _11
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Mon Mar 04 17:29:44 UTC 2024
    - 3K bytes
    - Viewed (0)
  3. src/crypto/internal/bigmod/nat.go

    	for logR>>i <= threshold {
    		i--
    	}
    	for k := uint(0); k < logR>>i; k++ {
    		rr.Add(rr, m)
    	}
    
    	// Then we process the remaining bits of the exponent with a
    	// square-and-double chain.
    	for i > 0 {
    		rr.montgomeryMul(rr, rr, m)
    		i--
    		if logR>>i&1 != 0 {
    			rr.Add(rr, m)
    		}
    	}
    
    	return rr
    }
    
    // minusInverseModW computes -x⁻¹ mod _W with x odd.
    //
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Mon May 13 18:57:38 UTC 2024
    - 24K bytes
    - Viewed (0)
  4. staging/src/k8s.io/apiserver/pkg/util/flowcontrol/rule.go

    	return strings.HasPrefix(username, ServiceAccountUsernameSeparator)
    }
    
    func matchesAResourceRule(ri *request.RequestInfo, rules []flowcontrol.ResourcePolicyRule) bool {
    	for _, rr := range rules {
    		if matchesResourcePolicyRule(ri, rr) {
    			return true
    		}
    	}
    	return false
    }
    
    func matchesResourcePolicyRule(ri *request.RequestInfo, policyRule flowcontrol.ResourcePolicyRule) bool {
    Registered: Sat Jun 15 01:39:40 UTC 2024
    - Last Modified: Mon Oct 30 12:18:35 UTC 2023
    - 6.3K bytes
    - Viewed (0)
  5. src/cmd/vendor/golang.org/x/text/unicode/norm/readwriter.go

    // by reading data from r and returning f(data).
    func (f Form) Reader(r io.Reader) io.Reader {
    	const chunk = 4000
    	buf := make([]byte, chunk)
    	rr := &normReader{rb: reorderBuffer{}, r: r, inbuf: buf}
    	rr.rb.init(f, buf)
    	return rr
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Wed Jan 24 13:01:26 UTC 2024
    - 2.9K bytes
    - Viewed (0)
  6. staging/src/k8s.io/apiserver/pkg/util/flowcontrol/gen_test.go

    		rnamespaces = namespaces[1:]
    	}
    	rr := flowcontrol.ResourcePolicyRule{
    		Verbs:        []string{pfx + "-v1", pfx + "-v2", pfx + "-v3"},
    		APIGroups:    []string{pfx + ".g1", pfx + ".g2", pfx + ".g3"},
    		Resources:    []string{pfx + "-r1s", pfx + "-r2s", pfx + "-r3s"},
    		ClusterScope: namespaces[0] == "",
    		Namespaces:   rnamespaces}
    	matchingRIs := genRRIs(rng, 3, rr.Verbs, rr.APIGroups, rr.Resources, namespaces)
    Registered: Sat Jun 15 01:39:40 UTC 2024
    - Last Modified: Mon Oct 30 12:18:40 UTC 2023
    - 24.8K bytes
    - Viewed (0)
  7. src/strconv/quote.go

    	if 0 <= r && r < 1<<16 {
    		rr, isPrint, isNotPrint := uint16(r), isPrint16, isNotPrint16
    		i, _ := bsearch(isPrint, rr)
    		if i >= len(isPrint) || rr < isPrint[i&^1] || isPrint[i|1] < rr {
    			return false
    		}
    		_, found := bsearch(isNotPrint, rr)
    		return !found
    	}
    
    	rr, isPrint, isNotPrint := uint32(r), isPrint32, isNotPrint32
    	i, _ := bsearch(isPrint, rr)
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Thu Apr 04 14:21:28 UTC 2024
    - 16.5K bytes
    - Viewed (0)
  8. src/cmd/go/internal/modfetch/repo.go

    		return nil, err
    	}
    	return newCodeRepo(code, rr.Root, path)
    }
    
    func lookupCodeRepo(ctx context.Context, rr *vcs.RepoRoot) (codehost.Repo, error) {
    	code, err := codehost.NewRepo(ctx, rr.VCS.Cmd, rr.Repo)
    	if err != nil {
    		if _, ok := err.(*codehost.VCSError); ok {
    			return nil, err
    		}
    		return nil, fmt.Errorf("lookup %s: %v", rr.Root, err)
    	}
    	return code, nil
    }
    
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Tue May 23 16:36:19 UTC 2023
    - 15.2K bytes
    - Viewed (0)
  9. src/time/export_test.go

    	Kind RuleKind
    	Day  int
    	Week int
    	Mon  int
    	Time int
    }
    
    func TzsetRule(s string) (Rule, string, bool) {
    	r, rs, ok := tzsetRule(s)
    	rr := Rule{
    		Kind: RuleKind(r.kind),
    		Day:  r.day,
    		Week: r.week,
    		Mon:  r.mon,
    		Time: r.time,
    	}
    	return rr, rs, ok
    }
    
    // StdChunkNames maps from nextStdChunk results to the matched strings.
    var StdChunkNames = map[int]string{
    	0:                               "",
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Mon Oct 24 19:23:32 UTC 2022
    - 4K bytes
    - Viewed (0)
  10. pkg/proxy/ipvs/proxier_test.go

    						Protocol:  "TCP",
    						Port:      uint16(80),
    						Scheduler: "rr",
    					},
    					{
    						IP:       "100.101.102.103",
    						Port:     3001,
    						Protocol: "TCP",
    					}: {
    						Address:   netutils.ParseIPSloppy("100.101.102.103"),
    						Protocol:  "TCP",
    						Port:      uint16(3001),
    						Scheduler: "rr",
    					},
    				},
    				Destinations: map[ipvstest.ServiceKey][]*utilipvs.RealServer{
    Registered: Sat Jun 15 01:39:40 UTC 2024
    - Last Modified: Sat Apr 27 01:31:57 UTC 2024
    - 186.8K bytes
    - Viewed (0)
Back to top