- Sort Score
- Result 10 results
- Languages All
Results 31 - 40 of 311 for S1 (0.54 sec)
-
src/internal/types/testdata/check/decls3.go
_ = struct{}{}.Foo /* ERROR "no field or method" */ _ = S0{}.A _ = S0{}.D /* ERROR "no field or method" */ _ = S1{}.A _ = S1{}.B _ = S1{}.S0 _ = S1{}.C _ = S2{}.A _ = S2{}.S1 _ = S2{}.B _ = S2{}.C _ = S2{}.D /* ERROR "no field or method" */ _ = S3{}.S1 /* ERROR "ambiguous selector S3{}.S1" */ _ = S3{}.A _ = S3{}.B /* ERROR "ambiguous selector S3{}.B" */ _ = S3{}.D _ = S3{}.E _ = S4{}.A
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 24 23:16:04 UTC 2023 - 4.2K bytes - Viewed (0) -
pkg/test/framework/tools/featuresgen/cmd/root_test.go
Registered: Fri Jun 14 15:00:06 UTC 2024 - Last Modified: Mon Jul 25 19:30:47 UTC 2022 - 1.7K bytes - Viewed (0) -
ci/official/containers/linux_arm64/builder.devtoolset/stringop_trunc.patch
@@ -29,54 +25,16 @@ char * STRNCAT (char *s1, const char *s2, size_t n) { - char c; char *s = s1; /* Find the end of S1. */ - do - c = *s1++; - while (c != '\0'); - - /* Make S1 point before next character, so we can increment - it while memory is read (wins on pipelined cpus). */ - s1 -= 2; + s1 += strlen (s1); - if (n >= 4) - {
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Mon Sep 18 14:52:45 UTC 2023 - 42.9K bytes - Viewed (0) -
test/fixedbugs/bug515.go
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Sep 02 06:22:23 UTC 2022 - 392 bytes - Viewed (0) -
src/runtime/string_test.go
func BenchmarkCompareStringEqual(b *testing.B) { bytes := []byte("Hello Gophers!") s1, s2 := string(bytes), string(bytes) for i := 0; i < b.N; i++ { if s1 != s2 { b.Fatal("s1 != s2") } } } func BenchmarkCompareStringIdentical(b *testing.B) { s1 := "Hello Gophers!" s2 := s1 for i := 0; i < b.N; i++ { if s1 != s2 { b.Fatal("s1 != s2") } } } func BenchmarkCompareStringSameLength(b *testing.B) {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Dec 13 14:05:23 UTC 2022 - 13.3K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/fuse.go
s1, ss1 = b, s1 } else { ss1 = s1.Succs[0].b i1 = s1.Succs[0].i } if ss0 != ss1 { if s0.Kind == BlockPlain && isEmpty(s0) && s1.Kind == BlockPlain && isEmpty(s1) { // Two special cases where both s0, s1 and ss are empty blocks. if s0 == ss1 { s0, ss0 = b, ss1 } else if ss0 == s1 { s1, ss1 = b, ss0 } else { return false } } else {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Oct 31 20:45:54 UTC 2023 - 9K bytes - Viewed (0) -
tensorflow/compiler/jit/device_compilation_cluster_signature_test.cc
std::vector<DeviceCompilationClusterSignature> signatures = {s1, s2, s3}; for (int i = 0; i < signatures.size(); ++i) { for (int j = 0; j < signatures.size(); ++j) { EXPECT_EQ(i == j, signatures[i] == signatures[j]) << "s1: " << signatures[i].HumanString() << "\n" << "s2: " << signatures[j].HumanString(); EXPECT_EQ(i == j,
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Wed Sep 06 19:12:29 UTC 2023 - 4.7K bytes - Viewed (0) -
src/net/http/pattern.go
if s2.s == "/" { if s1.s != "" { b.WriteString(s1.s) } else { b.WriteString("x") } } return b.String() } if !s1.multi && s2.multi { writeSegment(&b, s1) } else if s1.wild && s2.wild { // Both patterns will match whatever we put here; use // the first wildcard name. writeSegment(&b, s1) } else if s1.wild && !s2.wild {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Feb 26 16:36:30 UTC 2024 - 15.3K bytes - Viewed (0) -
guava-tests/test/com/google/common/eventbus/DispatcherTest.java
assertThat(dispatchedSubscribers).containsExactly(i1, i2, i3, s1, s1, s1, s1, s2, s2, s2, s2); } public void testImmediateDispatcher() { dispatcher = Dispatcher.immediate(); dispatcher.dispatch(1, integerSubscribers.iterator()); assertThat(dispatchedSubscribers) .containsExactly( i1, s1, s2, // Each integer subscriber immediately dispatches to 2 string subscribers.
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Apr 27 15:41:25 UTC 2022 - 5.6K bytes - Viewed (0) -
test/fixedbugs/issue58325.go
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Feb 08 02:44:20 UTC 2023 - 339 bytes - Viewed (0)