- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 597 for recursion (0.13 sec)
-
test/fixedbugs/issue56103.go
package p // Self recursion. type i interface{ m() interface{ i } } // ERROR "invalid recursive type" type _ interface{ i } // no redundant error // Mutual recursion. type j interface{ m() interface{ k } } // ERROR "invalid recursive type" type k interface{ m() interface{ j } } // Both self and mutual recursion. type ( a interface { // ERROR "invalid recursive type"
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Nov 21 20:15:23 UTC 2022 - 1.5K bytes - Viewed (0) -
src/internal/types/testdata/fixedbugs/issue51158.go
// license that can be found in the LICENSE file. package p // Type checking the following code should not cause an infinite recursion. func f[M map[K]int, K comparable](m M) { f(m) } // Equivalent code using mutual recursion. func f1[M map[K]int, K comparable](m M) { f2(m) } func f2[M map[K]int, K comparable](m M) { f1(m)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Sep 02 02:58:32 UTC 2022 - 463 bytes - Viewed (0) -
src/testing/sub_test.go
^V--- SKIP: chatty with recursion and json/#00/#01 (N.NNs) ^V=== NAME chatty with recursion and json/#00 ^V=== RUN chatty with recursion and json/#00/#02 sub_test.go:NNN: fail ^V--- FAIL: chatty with recursion and json/#00/#02 (N.NNs) ^V=== NAME chatty with recursion and json/#00 ^V--- FAIL: chatty with recursion and json/#00 (N.NNs) ^V=== NAME chatty with recursion and json ^V--- FAIL: chatty with recursion and json (N.NNs)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Dec 01 21:27:08 UTC 2023 - 23.8K bytes - Viewed (0) -
tensorflow/compiler/mlir/tensorflow/tests/guarantee-all-funcs-one-use.mlir
} // ----- // Handle error case of infinite recursion. // expected-error @+1 {{recursive call graph cannot be transformed}} module { func.func private @f() { func.call @f() : () -> () func.call @f() : () -> () func.return } } // ----- // Handle error case of infinite recursion with mutually recursive ops. // expected-error @+1 {{recursive call graph cannot be transformed}} module {
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Mon Oct 30 06:52:55 UTC 2023 - 2.1K bytes - Viewed (0) -
src/internal/types/testdata/fixedbugs/issue48703.go
package p import "unsafe" // The actual example from the issue. type List[P any] struct{} func (_ List[P]) m() (_ List[List[P]]) { return } // Other types of recursion through methods. type R[P any] int func (*R[R /* ERROR "must be an identifier" */ [int]]) m0() {} func (R[P]) m1(R[R[P]]) {} func (R[P]) m2(R[*P]) {}
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Jan 17 19:54:25 UTC 2023 - 769 bytes - Viewed (0) -
guava/src/com/google/common/reflect/TypeVisitor.java
import org.checkerframework.checker.nullness.qual.Nullable; /** * Based on what a {@link Type} is, dispatch it to the corresponding {@code visit*} method. By * default, no recursion is done for type arguments or type bounds. But subclasses can opt to do * recursion by calling {@link #visit} for any {@code Type} while visitation is in progress. For * example, this can be used to reject wildcards or type variables contained in a type as in: *
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri Apr 16 21:10:04 UTC 2021 - 3.7K bytes - Viewed (0) -
android/guava/src/com/google/common/reflect/TypeVisitor.java
import org.checkerframework.checker.nullness.qual.Nullable; /** * Based on what a {@link Type} is, dispatch it to the corresponding {@code visit*} method. By * default, no recursion is done for type arguments or type bounds. But subclasses can opt to do * recursion by calling {@link #visit} for any {@code Type} while visitation is in progress. For * example, this can be used to reject wildcards or type variables contained in a type as in: *
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri Apr 16 21:10:04 UTC 2021 - 3.7K bytes - Viewed (0) -
test/fixedbugs/issue16249.go
return } // B does a little bit of recursion dribbling not-zero onto the stack. //go:noinline func B(n int64) (res int64) { if n <= 1 { // Prefer to leave a 1 on the stack. return n } return 1 + B(n-1) } func main() { x, e := A(0, 0) for j := 0; j < 4; j++ { // j controls amount of B's stack dribble for i := 0; i < 1000; i++ { // try more and more recursion until stack growth occurs in newobject in prologue
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Sat Jul 02 00:40:40 UTC 2016 - 1.3K bytes - Viewed (0) -
test/fixedbugs/issue8507.go
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Sep 29 14:21:33 UTC 2022 - 374 bytes - Viewed (0) -
src/internal/types/testdata/fixedbugs/issue48819.go
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Jan 17 19:54:25 UTC 2023 - 351 bytes - Viewed (0)