Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 6 of 6 for rr (0.15 sec)

  1. impl/maven-core/src/main/java/org/apache/maven/internal/impl/DefaultSession.java

                try {
                    return mavenRepositorySystem.createRepository(
                            rr.getUrl(),
                            rr.getId(),
                            rr.getPolicy(false).isEnabled(),
                            rr.getPolicy(false).getUpdatePolicy(),
                            rr.getPolicy(true).isEnabled(),
    Registered: Sun Dec 28 03:35:09 UTC 2025
    - Last Modified: Fri Jun 06 14:28:57 UTC 2025
    - 8.9K bytes
    - Viewed (0)
  2. src/bytes/bytes_test.go

    			}
    		}
    	}
    	// Shuffle the runes so that they are not in descending order.
    	// The sort is deterministic since this is used for benchmarks,
    	// which need to be repeatable.
    	rr := rand.New(rand.NewSource(1))
    	rr.Shuffle(len(rs), func(i, j int) {
    		rs[i], rs[j] = rs[j], rs[i]
    	})
    	uchars := string(rs)
    
    	return func(b *testing.B, n int) {
    		buf := bmbuf[0:n]
    		o := copy(buf, uchars)
    Registered: Tue Dec 30 11:13:12 UTC 2025
    - Last Modified: Tue Dec 23 23:54:14 UTC 2025
    - 62.9K bytes
    - Viewed (0)
  3. lib/fips140/v1.1.0-rc1.zip

    compute before crossing the threshold, and we do it with doublings. i := bits.UintSize 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. // // This operation is used to precompute a constant involved in Montgomery // multiplication. func...
    Registered: Tue Dec 30 11:13:12 UTC 2025
    - Last Modified: Thu Dec 11 16:27:41 UTC 2025
    - 663K bytes
    - Viewed (0)
  4. lib/fips140/v1.0.0-c2097c7c.zip

    compute before crossing the threshold, and we do it with doublings. i := bits.UintSize 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. // // This operation is used to precompute a constant involved in Montgomery // multiplication. func...
    Registered: Tue Dec 30 11:13:12 UTC 2025
    - Last Modified: Thu Sep 25 19:53:19 UTC 2025
    - 642.7K bytes
    - Viewed (0)
  5. okhttp/src/jvmMain/resources/okhttp3/internal/publicsuffix/PublicSuffixDatabase.list

    roros.no
    rost.no
    rotorcraft.aero
    router.management
    routingthecloud.com
    routingthecloud.net
    routingthecloud.org
    rovigo.it
    rovno.ua
    royal-commission.uk
    royken.no
    royrvik.no
    rr.gov.br
    rr.leg.br
    rs
    rs.ba
    rs.gov.br
    rs.leg.br
    rs.webaccel.jp
    rsc.cdn77.org
    rsc.contentproxy9.cz
    rss.my.id
    rsvp
    rt.ht
    ru
    ru.com
    ru.eu.org
    ru.net
    rugby
    Registered: Fri Dec 26 11:42:13 UTC 2025
    - Last Modified: Tue May 27 22:00:49 UTC 2025
    - 129.6K bytes
    - Viewed (3)
  6. android/guava/src/com/google/thirdparty/publicsuffix/PublicSuffixPatterns.java

    nartattelrab?ssela??epmi?ugil??tnelav&-obiv?obiv??vap?z&e&nev?ps&-al?al???irog???l&iuqa!l??leib??m&or?rap??n!acsot?e&dom?is?sec&-&ilrof?ìlrof??ilrof?ìlrof???g&amor&-ailime?ailime??edras?olob??i&ssem?tal??ne!var??o&cna?merc?rev?vas???oneg?p?r!a&csep?rr&ac&-assam?assam??ef??von??etam?tsailgo!-lled?lled???s!ip?sam&-ararrac?ararrac??u&caris?gar???t!a&cilisab?recam??resac?soa!-&d&-&ellav?lav??ellav?lav??ellav??d&-&ellav?lav??ellav?lav??ellav??te&lrab&-&airdna-inart?inart-airdna??airdnainart?inartaird...
    Registered: Fri Dec 26 12:43:10 UTC 2025
    - Last Modified: Tue Dec 16 20:00:28 UTC 2025
    - 76.5K bytes
    - Viewed (1)
Back to top