- Sort Score
- Result 10 results
- Languages All
Results 11 - 15 of 15 for newConn (0.14 sec)
-
src/index/suffixarray/suffixarray_test.go
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 } case "go": err := filepath.WalkDir("../..", func(path string, info fs.DirEntry, err error) error {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 01:00:11 UTC 2024 - 14.1K bytes - Viewed (0) -
android/guava/src/com/google/common/math/BigIntegerMath.java
* * We start out with a double-precision approximation, which may be higher or lower than the * true value. Therefore, we perform at least one Newton iteration to get a guess that's * definitely >= floor(sqrt(x)), and then continue the iteration until we reach a fixed point. */ BigInteger sqrt0; int log2 = log2(x, FLOOR);
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Feb 07 17:50:39 UTC 2024 - 18.9K bytes - Viewed (0) -
guava/src/com/google/common/math/BigIntegerMath.java
* * We start out with a double-precision approximation, which may be higher or lower than the * true value. Therefore, we perform at least one Newton iteration to get a guess that's * definitely >= floor(sqrt(x)), and then continue the iteration until we reach a fixed point. */ BigInteger sqrt0; int log2 = log2(x, FLOOR);
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Feb 07 17:50:39 UTC 2024 - 18.9K bytes - Viewed (0) -
staging/src/k8s.io/apiserver/pkg/storage/cacher/watch_cache.go
groupResource: groupResource, waitingUntilFresh: progressRequester, } metrics.WatchCacheCapacity.WithLabelValues(groupResource.String()).Set(float64(wc.capacity)) wc.cond = sync.NewCond(wc.RLocker()) wc.indexValidator = wc.isIndexValidLocked return wc } // Add takes runtime.Object as an argument. func (w *watchCache) Add(obj interface{}) error {
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Tue Jun 11 10:20:57 UTC 2024 - 26.2K bytes - Viewed (0) -
src/math/big/nat.go
rr := make(nat, numWords) copy(rr, x) x = rr } // Ideally the precomputations would be performed outside, and reused // k0 = -m**-1 mod 2**_W. Algorithm from: Dumas, J.G. "On Newton–Raphson // Iteration for Multiplicative Inverses Modulo Prime Powers". k0 := 2 - m[0] t := m[0] - 1 for i := 1; i < _W; i <<= 1 { t *= t k0 *= (t + 1) } k0 = -k0
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon May 13 21:31:58 UTC 2024 - 31.7K bytes - Viewed (0)