- Sort Score
- Result 10 results
- Languages All
Results 1 - 9 of 9 for Inv (0.02 sec)
-
src/internal/trace/mud_test.go
for j := 0.0; j < mass; j += mass * 0.099 { mud.setTrackMass(j) l, u, ok := mud.approxInvCumulativeSum() inv, ok2 := mud.invCumulativeSum(j) if !ok || !ok2 { t.Fatalf("inverse cumulative sum failed: approx %v, exact %v", ok, ok2) } if !(l <= inv && inv < u) { t.Fatalf("inverse(%g) = %g, not ∈ [%g, %g)", j, inv, l, u) } } } } func TestMUDTracking(t *testing.T) {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri May 17 18:48:18 UTC 2024 - 2.5K bytes - Viewed (0) -
android/guava-testlib/src/com/google/common/collect/testing/google/BiMapClearTester.java
BiMap<V, K> inv = getMap().inverse(); inv.keySet().clear(); assertTrue(getMap().isEmpty()); assertTrue(inv.isEmpty()); } @MapFeature.Require(SUPPORTS_REMOVE) public void testClearInverseValuesClears() { BiMap<V, K> inv = getMap().inverse(); inv.values().clear(); assertTrue(getMap().isEmpty()); assertTrue(inv.isEmpty()); }
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Tue Jan 09 20:10:38 UTC 2018 - 2.5K bytes - Viewed (0) -
guava-testlib/src/com/google/common/collect/testing/google/BiMapClearTester.java
BiMap<V, K> inv = getMap().inverse(); inv.keySet().clear(); assertTrue(getMap().isEmpty()); assertTrue(inv.isEmpty()); } @MapFeature.Require(SUPPORTS_REMOVE) public void testClearInverseValuesClears() { BiMap<V, K> inv = getMap().inverse(); inv.values().clear(); assertTrue(getMap().isEmpty()); assertTrue(inv.isEmpty()); }
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Tue Jan 09 20:10:38 UTC 2018 - 2.5K bytes - Viewed (0) -
src/crypto/internal/nistec/p256_ordinv_test.go
t.Error("unexpected output for inv(1)") } new(big.Int).Add(N, big.NewInt(1)).FillBytes(input) out, err = nistec.P256OrdInverse(input) if err != nil { t.Fatal(err) } if !bytes.Equal(out, exp) { t.Error("unexpected output for inv(N+1)") } // Check inv(20) and inv(N+20) against math/big exp = new(big.Int).ModInverse(big.NewInt(20), N).FillBytes(make([]byte, 32)) big.NewInt(20).FillBytes(input)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Mar 04 17:29:44 UTC 2024 - 2.3K bytes - Viewed (0) -
android/guava-testlib/src/com/google/common/collect/testing/google/AbstractBiMapTester.java
for (Entry<K, V> entry : entries) { Entry<V, K> reversed = reverseEntry(entry); BiMap<V, K> inv = getMap().inverse(); assertFalse( "Inverse should not contain entry " + reversed, inv.entrySet().contains(reversed)); assertFalse( "Inverse should not contain key " + reversed.getKey(), inv.containsKey(reversed.getKey())); assertFalse(
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Feb 21 16:49:06 UTC 2024 - 3.1K bytes - Viewed (0) -
guava-testlib/src/com/google/common/collect/testing/google/AbstractBiMapTester.java
for (Entry<K, V> entry : entries) { Entry<V, K> reversed = reverseEntry(entry); BiMap<V, K> inv = getMap().inverse(); assertFalse( "Inverse should not contain entry " + reversed, inv.entrySet().contains(reversed)); assertFalse( "Inverse should not contain key " + reversed.getKey(), inv.containsKey(reversed.getKey())); assertFalse(
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Feb 21 16:49:06 UTC 2024 - 3.1K bytes - Viewed (0) -
src/internal/diff/diff.go
// yi[i] = increasing indexes of unique strings in y. // inv[i] = index j such that x[xi[i]] = y[yi[j]]. var xi, yi, inv []int for i, s := range y { if m[s] == -1+-4 { m[s] = len(yi) yi = append(yi, i) } } for i, s := range x { if j, ok := m[s]; ok && j >= 0 { xi = append(xi, i) inv = append(inv, j) } } // Apply Algorithm A from Szymanski's paper.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Nov 08 14:13:04 UTC 2023 - 7.5K bytes - Viewed (0) -
src/archive/tar/strconv.go
// If the number is negative, we use an inversion mask to invert the // data bytes and treat the value as an unsigned number. var inv byte // 0x00 if positive or zero, 0xff if negative if b[0]&0x40 != 0 { inv = 0xff } var x uint64 for i, c := range b { c ^= inv // Inverts c only if inv is 0xff, otherwise does nothing if i == 0 { c &= 0x7f // Ignore signal bit in first byte } if (x >> 56) > 0 {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Aug 01 14:28:42 UTC 2023 - 9K bytes - Viewed (0) -
src/math/big/example_rat_test.go
term.SetInt64(1) } else { term.SetInt64((n - 1) / 3 * 2) } if n > lim { return term } // Directly initialize frac as the fractional // inverse of the result of recur. frac := new(big.Rat).Inv(recur(n+1, lim)) return term.Add(term, frac) } // This example demonstrates how to use big.Rat to compute the // first 15 terms in the sequence of rational convergents for
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Apr 11 16:34:30 UTC 2022 - 1.7K bytes - Viewed (0)