- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 139 for Postorder (0.19 sec)
-
src/cmd/go/internal/mvs/mvs.go
continue } m := module.Version{Path: path, Version: max[path]} min = append(min, m) walk(m) haveBase[path] = true } // Now the reverse postorder to bring in anything else. for i := len(postorder) - 1; i >= 0; i-- { m := postorder[i] if max[m.Path] != m.Version { // Older version. continue } if !have[m] { min = append(min, m) walk(m) } }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Mar 27 21:58:12 UTC 2024 - 14.5K bytes - Viewed (0) -
src/cmd/vendor/golang.org/x/mod/modfile/read.go
// Comment assignment. // We build two lists of all subexpressions, preorder and postorder. // The preorder list is ordered by start location, with outer expressions first. // The postorder list is ordered by end location, with outer expressions last. // We use the preorder list to assign each whole-line comment to the syntax // immediately following it, and we use the postorder list to assign each // end-of-line comment to the syntax immediately preceding it.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri May 03 02:38:00 UTC 2024 - 23.1K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/func.go
} f.fe.Fatalf(f.Entry.Pos, msg, args...) } // postorder returns the reachable blocks in f in a postorder traversal. func (f *Func) postorder() []*Block { if f.cachedPostorder == nil { f.cachedPostorder = postorder(f) } return f.cachedPostorder } func (f *Func) Postorder() []*Block { return f.postorder() }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Jun 10 19:44:43 UTC 2024 - 25.8K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/TreeTraverser.java
* * <pre>{@code * h * / | \ * / e \ * d g * /|\ | * / | \ f * a b c * }</pre> * * <p>can be iterated over in preorder (hdabcegf), postorder (abcdefgh), or breadth-first order * (hdegabcf). * * <p>Null nodes are strictly forbidden. * * <p>Because this is an abstract class, not an interface, you can't use a lambda expression to * implement it: *
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 01 16:15:01 UTC 2024 - 8.2K bytes - Viewed (0) -
guava/src/com/google/common/collect/TreeTraverser.java
* * <pre>{@code * h * / | \ * / e \ * d g * /|\ | * / | \ f * a b c * }</pre> * * <p>can be iterated over in preorder (hdabcegf), postorder (abcdefgh), or breadth-first order * (hdegabcf). * * <p>Null nodes are strictly forbidden. * * <p>Because this is an abstract class, not an interface, you can't use a lambda expression to * implement it: *
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 01 16:15:01 UTC 2024 - 8.8K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/stackalloc.go
// Instead of iterating over f.Blocks, iterate over their postordering. // Liveness information flows backward, so starting at the end // increases the probability that we will stabilize quickly. po := s.f.postorder() for { changed := false for _, b := range po { // Start with known live values at the end of the block live.clear() live.addAll(s.live[b.ID])
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Feb 29 21:29:41 UTC 2024 - 12.6K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/check.go
} } } } // Check loop construction if f.RegAlloc == nil && f.pass != nil { // non-nil pass allows better-targeted debug printing ln := f.loopnest() if !ln.hasIrreducible { po := f.postorder() // use po to avoid unreachable blocks. for _, b := range po { for _, s := range b.Succs { bb := s.Block() if ln.b2l[b.ID] == nil && ln.b2l[bb.ID] != nil && bb != ln.b2l[bb.ID].header {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Apr 09 16:41:23 UTC 2024 - 17.6K bytes - Viewed (0) -
src/cmd/compile/internal/liveness/plive.go
// frees within the loop. nvars := int32(len(lv.vars)) newlivein := bitvec.New(nvars) newliveout := bitvec.New(nvars) // Walk blocks in postorder ordering. This improves convergence. po := lv.f.Postorder() // Iterate through the blocks in reverse round-robin fashion. A work // queue might be slightly faster. As is, the number of iterations is
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Jun 07 15:22:22 UTC 2024 - 45.2K bytes - Viewed (0) -
src/cmd/link/internal/ld/lib.go
if err != io.EOF { log.Fatalf("reading input: %v", err) } return -1 } return int(c) } type markKind uint8 // for postorder traversal const ( _ markKind = iota visiting visited ) func postorder(libs []*sym.Library) []*sym.Library { order := make([]*sym.Library, 0, len(libs)) // hold the result mark := make(map[*sym.Library]markKind, len(libs))
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue May 21 18:45:27 UTC 2024 - 88.6K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/debug.go
func (state *debugState) liveness() []*BlockDebug { blockLocs := make([]*BlockDebug, state.f.NumBlocks()) counterTime := int32(1) // Reverse postorder: visit a block after as many as possible of its // predecessors have been visited. po := state.f.Postorder() converged := false // The iteration rule is that by default, run until converged, but // if a particular iteration count is specified, run that many
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Jun 10 19:44:43 UTC 2024 - 58.4K bytes - Viewed (0)