- Sort Score
- Num 10 results
- Language All
Results 1 - 5 of 5 for rr (0.04 seconds)
The search processing time has exceeded the limit. The displayed results may be partial.
-
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(),Created: Sun Apr 05 03:35:12 GMT 2026 - Last Modified: Fri Jun 06 14:28:57 GMT 2025 - 8.9K bytes - Click Count (0) -
lib/fips140/v1.26.0.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...
Created: Tue Apr 07 11:13:11 GMT 2026 - Last Modified: Thu Jan 08 17:58:32 GMT 2026 - 660.3K bytes - Click Count (0) -
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)
Created: Tue Apr 07 11:13:11 GMT 2026 - Last Modified: Wed Mar 11 03:07:05 GMT 2026 - 62.9K bytes - Click Count (0) -
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...
Created: Tue Apr 07 11:13:11 GMT 2026 - Last Modified: Thu Sep 25 19:53:19 GMT 2025 - 642.7K bytes - Click Count (0) -
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
Created: Fri Apr 03 11:42:14 GMT 2026 - Last Modified: Tue May 27 22:00:49 GMT 2025 - 129.6K bytes - Click Count (3)