- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 550 for recursion (0.31 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) -
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) -
src/index/suffixarray/sais.go
// (from text_32), and saTmp will typically be much larger, so we'll use saTmp. // When deeper recursions come back to recurse_32, now oldTmp is // the saTmp from the top-most recursion, it is typically larger than // the current saTmp (because the current sa gets smaller and smaller // as the recursion gets deeper), and we keep reusing that top-most // large saTmp instead of the offered smaller ones. //
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Mar 18 23:57:18 UTC 2024 - 32.4K bytes - Viewed (0) -
src/cmd/vendor/golang.org/x/tools/go/analysis/passes/printf/types.go
ok = m.match(typ, true) return m.reason, ok } // argMatcher recursively matches types against the printfArgType t. // // To short-circuit recursion, it keeps track of types that have already been // matched (or are in the process of being matched) via the seen map. Recursion // arises from the compound types {map,chan,slice} which may be printed with %d // etc. if that is appropriate for their element types, as well as from type
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Apr 02 02:20:05 UTC 2024 - 8.6K bytes - Viewed (0) -
src/math/jn.go
// Note 2. About jn(n,x), yn(n,x) // For n=0, j0(x) is called, // for n=1, j1(x) is called, // for n<x, forward recursion is used starting // from values of j0(x) and j1(x). // for n>x, a continued fraction approximation to // j(n,x)/j(n-1,x) is evaluated and then backward // recursion is used starting from a supposed value // for j(n,x). The resulting value of j(0,x) is
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Apr 11 16:34:30 UTC 2022 - 7.2K bytes - Viewed (0)