- Sort Score
- Result 10 results
- Languages All
Results 11 - 20 of 228 for recursion (0.48 sec)
-
src/debug/dwarf/type.go
} addressSize := r.AddressSize() if e == nil || e.Offset != off { return nil, DecodeError{name, off, "no type at offset"} } // If this is the root of the recursion, prepare to resolve // typedef sizes and perform other fixups once the recursion is // done. This must be done after the type graph is constructed // because it may need to resolve cycles in a different order than // readType encounters them.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Oct 18 19:33:30 UTC 2023 - 21.9K bytes - Viewed (0) -
src/go/types/typeset.go
} // An infinitely expanding interface (due to a cycle) is detected // elsewhere (Checker.validType), so here we simply assume we only // have valid interfaces. Mark the interface as complete to avoid // infinite recursion if the validType check occurs later for some // reason. ityp.tset = &_TypeSet{terms: allTermlist} // TODO(gri) is this sufficient? var unionSets map[*Union]*_TypeSet if check != nil {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 30 19:19:55 UTC 2024 - 13.7K bytes - Viewed (0) -
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/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) -
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) -
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) -
src/cmd/compile/internal/ssa/loopreschedchecks.go
} } newphis[h] = change } for c := sdom[b.ID].child; c != nil; c = sdom[c.ID].sibling { rewriteNewPhis(h, c, f, defsForUses, newphis, dfPhiTargets, sdom) // TODO: convert to explicit stack from recursion. } } // addDFphis creates new trivial phis that are necessary to correctly reflect (within SSA) // a new definition for variable "x" inserted at h (usually but not necessarily a phi).
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Aug 22 21:17:10 UTC 2023 - 16K bytes - Viewed (0) -
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)