- Sort Score
- Result 10 results
- Languages All
Results 61 - 70 of 550 for recursion (0.18 sec)
-
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) -
src/testing/fstest/mapfs.go
file = &MapFile{Mode: fs.ModeDir | 0555} } return &mapDir{name, mapFileInfo{elem, file}, list, 0}, nil } // fsOnly is a wrapper that hides all but the fs.FS methods, // to avoid an infinite recursion when implementing special // methods in terms of helpers that would use them. // (In general, implementing these methods using the package fs helpers // is redundant and unnecessary, but having the methods may make
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 01:00:11 UTC 2024 - 7.1K bytes - Viewed (0) -
src/cmd/compile/internal/types2/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.5K bytes - Viewed (0) -
src/go/internal/gcimporter/gcimporter_test.go
// verifyInterfaceMethodRecvs verifies that method receiver types // are named if the methods belong to a named interface type. func verifyInterfaceMethodRecvs(t *testing.T, named *types.Named, level int) { // avoid endless recursion in case of an embedding bug that lead to a cycle if level > 10 { t.Errorf("%s: embeds itself", named) return } iface, _ := named.Underlying().(*types.Interface) if iface == nil {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri May 17 16:22:59 UTC 2024 - 21.9K bytes - Viewed (0) -
src/internal/pkgbits/encoder.go
if !w.p.SyncMarkers() { return } // Writing out stack frame string references requires working // relocations, but writing out the relocations themselves involves // sync markers. To prevent infinite recursion, we simply trim the // stack frame for sync markers within the relocation header. var frames []string if !w.encodingRelocHeader && w.p.syncFrames > 0 { pcs := make([]uintptr, w.p.syncFrames)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Aug 10 23:26:58 UTC 2022 - 9.6K bytes - Viewed (0) -
platforms/core-configuration/model-core/src/main/java/org/gradle/api/internal/provider/EvaluationContext.java
private static String safeToString(Object owner) { try { return owner.toString(); } catch (Throwable e) { // Calling e.getMessage() here can cause infinite recursion. // It happens if e is CircularEvaluationException itself, because getMessage calls formatEvaluationChain.
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Wed Mar 06 16:54:51 UTC 2024 - 12.2K bytes - Viewed (0) -
common/config/.golangci.yml
- name: atomic - name: call-to-gc - name: duplicated-imports - name: string-of-int - name: defer arguments: - - "call-chain" - name: unconditional-recursion - name: identical-branches # the following rules can be enabled in the future # - name: empty-lines # - name: confusing-results # - name: empty-block
Registered: Fri Jun 14 15:00:06 UTC 2024 - Last Modified: Tue Jun 04 20:03:06 UTC 2024 - 11.3K bytes - Viewed (0) -
src/path/filepath/match.go
volumeLen, dir = cleanGlobPathWindows(dir) } else { dir = cleanGlobPath(dir) } if !hasMeta(dir[volumeLen:]) { return glob(dir, file, nil) } // Prevent infinite recursion. See issue 15879. if dir == pattern { return nil, ErrBadPattern } var m []string m, err = globWithLimit(dir, depth+1) if err != nil { return } for _, d := range m {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 01:00:11 UTC 2024 - 8.7K bytes - Viewed (0) -
src/cmd/vendor/github.com/google/pprof/internal/measurement/measurement.go
// the scaled value and the target unit. The returned target unit // will be empty if uninteresting (could be skipped). func Scale(value int64, fromUnit, toUnit string) (float64, string) { // Avoid infinite recursion on overflow. if value < 0 && -value > 0 { v, u := Scale(-value, fromUnit, toUnit) return -v, u } for _, ut := range UnitTypes { if v, u, ok := ut.convertUnit(value, fromUnit, toUnit); ok {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri May 31 19:48:28 UTC 2024 - 8.8K bytes - Viewed (0)