- Sort Score
- Result 10 results
- Languages All
Results 51 - 60 of 552 for recursion (0.21 sec)
-
src/go/internal/gcimporter/iimport.go
} // SetConstraint can't be called if the constraint type is not yet complete. // When type params are created in the 'P' case of (*importReader).obj(), // the associated constraint type may not be complete due to recursion. // Therefore, we defer calling SetConstraint there, and call it here instead // after all types are complete. for _, d := range p.later { d.t.SetConstraint(d.constraint) }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 01:00:11 UTC 2024 - 19.2K bytes - Viewed (0) -
src/sort/gen_sort_variants.go
// // symMerge assumes non-degenerate arguments: a < m && m < b. // Having the caller check this condition eliminates many leaf recursion calls, // which improves performance. func symMerge{{.FuncSuffix}}{{.TypeParam}}(data {{.DataType}}, a, m, b int {{.ExtraParam}}) { // Avoid unnecessary recursions of symMerge // by direct insertion of data[a] into data[m:b] // if data[a:m] only contains one element. if m-a == 1 {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Oct 19 23:33:27 UTC 2023 - 19.6K bytes - Viewed (0) -
src/cmd/compile/internal/ir/visit.go
// IR visitors for walking the IR tree. // // The lowest level helpers are DoChildren and EditChildren, which // nodes help implement and provide control over whether and when // recursion happens during the walk of the IR. // // Although these are both useful directly, two simpler patterns // are fairly common and also provided: Visit and Any. package ir
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Jun 23 14:29:16 UTC 2023 - 6K bytes - Viewed (0) -
src/cmd/vendor/golang.org/x/tools/internal/typeparams/normalize.go
if tset, ok := seen[t]; ok { if !tset.complete { return nil, fmt.Errorf("cycle detected in the declaration of %s", t) } return tset, nil } // Mark the current type as seen to avoid infinite recursion. tset := new(termSet) defer func() { tset.complete = true }() seen[t] = tset switch u := t.Underlying().(type) { case *types.Interface:
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Dec 18 21:28:13 UTC 2023 - 6.7K bytes - Viewed (0) -
src/fmt/doc.go
(%s %q %x %X), it is treated identically to a string, as a single item. To avoid recursion in cases such as type X string func (x X) String() string { return Sprintf("<%s>", x) } convert the value before recurring: func (x X) String() string { return Sprintf("<%s>", string(x)) } Infinite recursion can also be triggered by self-referential data
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Apr 02 21:56:20 UTC 2024 - 14.6K bytes - Viewed (0) -
src/internal/testenv/exec.go
// current executable, which must be a binary built by 'go test'. // We intentionally do not provide a HasExec function because of the risk of // inappropriate recursion in TestMain functions. // // To check for exec support outside of a test, just try to exec the command. // If exec is not supported, testenv.SyscallIsNotSupported will return true // for the resulting error.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Oct 27 17:53:23 UTC 2023 - 7.5K bytes - Viewed (0) -
maven-core/src/main/java/org/apache/maven/exception/DefaultExceptionHandler.java
String fullMessage = (message != null) ? message : ""; // To break out of possible endless loop when getCause returns "this", or dejaVu for n-level recursion (n>1) Set<Throwable> dejaVu = Collections.newSetFromMap(new IdentityHashMap<>()); for (Throwable t = exception; t != null && t != t.getCause(); t = t.getCause()) {
Registered: Wed Jun 12 09:55:16 UTC 2024 - Last Modified: Thu Jun 06 10:31:03 UTC 2024 - 10.7K bytes - Viewed (0) -
tensorflow/compiler/mlir/tensorflow/transforms/remove_unused_arguments.cc
unused_results.set(i); } // Now mark all args for deletion that don't have uses anymore. for (BlockArgument arg : func.getArguments()) { // TODO(b/246310765): This doesn't fully handle recursion. if (!use_count[arg.getArgNumber()]) unused_args.set(arg.getArgNumber()); } EraseReturnOperands(region, unused_results); func.eraseResults(unused_results); func.eraseArguments(unused_args);
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Thu Apr 25 16:01:03 UTC 2024 - 8.9K bytes - Viewed (0) -
android/guava-testlib/src/com/google/common/collect/testing/google/SortedMultisetTestSuiteBuilder.java
.withFeatures(computeElementSetFeatures(parentBuilder.getFeatures())) .suppressing(parentBuilder.getSuppressedTests()) .createTestSuite(); } /** * To avoid infinite recursion, test suites with these marker features won't have derived suites * created for them. */ enum NoRecurse implements Feature<Void> { SUBMULTISET, DESCENDING; @Override
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Feb 26 19:46:10 UTC 2024 - 11.9K bytes - Viewed (0) -
src/go/types/predicates.go
// m() interface{T} // } // // If two such (differently named) interfaces are compared, // endless recursion occurs if the cycle is not detected. // // If x and y were compared before, they must be equal // (if they were not, the recursion would have stopped); // search the ifacePair stack for the same pair. // // This is a quadratic algorithm, but in practice these stacks
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 03:01:18 UTC 2024 - 17.6K bytes - Viewed (0)