- Sort Score
- Result 10 results
- Languages All
Results 101 - 110 of 218 for S1 (0.07 sec)
-
test/typeparam/issue53087.go
func CloneBad[M ~map[K]V, K comparable, V any](m M) M { r := make(M, len(m)) for k, v := range m { r[k] = v } return r } func main() { s1 := &S{"one"} s2 := &S{"two"} m := CloningMap[string, I]{inner: make(map[string]I)} m = m.With("a", s1) m = m.With("b", s2) it, found := m.inner["a"] if !found { panic("a not found") } if _, ok := it.(*S); !ok {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Mar 08 16:23:09 UTC 2023 - 930 bytes - Viewed (0) -
guava-tests/test/com/google/common/base/MoreObjectsTest.java
/** Tests for {@link MoreObjects}. */ @GwtCompatible(emulated = true) public class MoreObjectsTest extends TestCase { public void testFirstNonNull_withNonNull() { String s1 = "foo"; String s2 = MoreObjects.firstNonNull(s1, "bar"); assertSame(s1, s2); Long n1 = 42L; Long n2 = MoreObjects.firstNonNull(null, n1); assertSame(n1, n2); Boolean b1 = true;
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Feb 22 21:24:55 UTC 2024 - 2K bytes - Viewed (0) -
src/crypto/elliptic/params.go
h.Add(h, curve.P) } i := new(big.Int).Lsh(h, 1) i.Mul(i, i) j := new(big.Int).Mul(h, i) s1 := new(big.Int).Mul(y1, z2) s1.Mul(s1, z2z2) s1.Mod(s1, curve.P) s2 := new(big.Int).Mul(y2, z1) s2.Mul(s2, z1z1) s2.Mod(s2, curve.P) r := new(big.Int).Sub(s2, s1) if r.Sign() == -1 { r.Add(r, curve.P) } yEqual := r.Sign() == 0 if xEqual && yEqual {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Apr 16 17:46:09 UTC 2024 - 9.6K bytes - Viewed (0) -
statement_test.go
s.AddClause(clause.Where{ Exprs: s.BuildCondition(fmt.Sprintf("where%d", w)), }) } s1 := s.clone() s1.AddClause(clause.Where{ Exprs: s.BuildCondition("FINAL1"), }) s2 := s.clone() s2.AddClause(clause.Where{ Exprs: s.BuildCondition("FINAL2"), }) if reflect.DeepEqual(s1.Clauses["WHERE"], s2.Clauses["WHERE"]) { t.Errorf("Where conditions should be different") } }) }
Registered: Wed Jun 12 16:27:09 UTC 2024 - Last Modified: Sat Dec 23 13:19:41 UTC 2023 - 1.9K bytes - Viewed (0) -
src/go/ast/commentmap_test.go
z complex128 // complex value } // also associated with T // x var x = 0 // x = 0 // also associated with x // f1 func f1() { /* associated with s1 */ s1() // also associated with s1 // associated with s2 // also associated with s2 s2() // line comment for s2 } // associated with f1 // also associated with f1 // associated with f2 // f2
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Sep 09 15:35:30 UTC 2022 - 3.9K bytes - Viewed (0) -
src/internal/types/testdata/fixedbugs/issue48951.go
type ( A1[P any] [10]A1 /* ERROR "invalid recursive type" */ [P] A2[P any] [10]A2 /* ERROR "invalid recursive type" */ [*P] A3[P any] [10]*A3[P] L1[P any] []L1[P] S1[P any] struct{ f S1 /* ERROR "invalid recursive type" */ [P] } S2[P any] struct{ f S2 /* ERROR "invalid recursive type" */ [*P] } // like example in issue S3[P any] struct{ f *S3[P] }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Jan 17 19:54:25 UTC 2023 - 822 bytes - Viewed (0) -
test/abi/method_wrapper.go
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Sep 17 22:59:44 UTC 2021 - 637 bytes - Viewed (0) -
platforms/core-configuration/kotlin-dsl-tooling-builders/src/crossVersionTest/groovy/org/gradle/kotlin/dsl/tooling/builders/r54/AccessorsClassPathModelCrossVersionSpec.groovy
def s1 = setOfAutomaticAccessorsFor(["application"]) def s2 = setOfAutomaticAccessorsFor(["java"]) def s3 = setOfAutomaticAccessorsFor(["application"]) def s4 = setOfAutomaticAccessorsFor(["application", "java"]) def s5 = setOfAutomaticAccessorsFor(["java"]) expect: assertThat(s1, not(equalTo(s2))) // application ≠ java
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Wed Aug 02 08:06:49 UTC 2023 - 4.1K bytes - Viewed (0) -
test/fixedbugs/bug189.go
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Feb 17 04:49:30 UTC 2012 - 376 bytes - Viewed (0) -
src/runtime/rand.go
// http://simul.iro.umontreal.ca/testu01/tu01.html t := (*[2]uint32)(unsafe.Pointer(&mp.cheaprand)) s1, s0 := t[0], t[1] s1 ^= s1 << 17 s1 = s1 ^ s0 ^ s1>>7 ^ s0>>16 t[0], t[1] = s0, s1 return s0 + s1 } // cheaprand64 is a non-cryptographic-quality 63-bit random generator // suitable for calling at very high frequency (such as during sampling decisions).
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri May 31 14:32:47 UTC 2024 - 8K bytes - Viewed (0)