- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 11 for findpaths1 (0.23 sec)
-
src/cmd/compile/internal/ssa/poset.go
// part of the path (or is dst itself). func (po *poset) findpaths(cur, dst uint32) bitset { seen := newBitset(int(po.lastidx + 1)) path := newBitset(int(po.lastidx + 1)) path.Set(dst) po.findpaths1(cur, dst, seen, path) return path } func (po *poset) findpaths1(cur, dst uint32, seen bitset, path bitset) { if cur == dst { return } seen.Set(cur)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Sep 04 17:23:05 UTC 2023 - 37.2K bytes - Viewed (0) -
src/cmd/compile/internal/types2/initorder.go
for _, init := range check.Info.InitOrder { fmt.Printf("\t%s\n", init) } fmt.Println() } } // findPath returns the (reversed) list of objects []Object{to, ... from} // such that there is a path of object dependencies from 'from' to 'to'. // If there is no such path, the result is nil. func findPath(objMap map[Object]*declInfo, from, to Object, seen map[Object]bool) []Object { if seen[from] { return nil }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Mar 28 22:06:51 UTC 2024 - 9.8K bytes - Viewed (0) -
src/go/types/initorder.go
for _, init := range check.Info.InitOrder { fmt.Printf("\t%s\n", init) } fmt.Println() } } // findPath returns the (reversed) list of objects []Object{to, ... from} // such that there is a path of object dependencies from 'from' to 'to'. // If there is no such path, the result is nil. func findPath(objMap map[Object]*declInfo, from, to Object, seen map[Object]bool) []Object { if seen[from] { return nil }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Apr 03 18:48:38 UTC 2024 - 9.9K bytes - Viewed (0) -
src/cmd/go/internal/mvs/graph.go
queue = append(queue, r) enqueued[r] = true } } } } // FindPath reports a shortest requirement path starting at one of the roots of // the graph and ending at a module version m for which f(m) returns true, or // nil if no such path exists. func (g *Graph) FindPath(f func(module.Version) bool) []module.Version { // firstRequires[a] = b means that in a breadth-first traversal of the
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Jun 01 02:52:19 UTC 2023 - 6.3K bytes - Viewed (0) -
guava/src/com/google/common/util/concurrent/CycleDetectingLockFactory.java
// Otherwise, it's the first time seeing this lock relationship. Look for // a path from the acquiredLock to this. Set<LockGraphNode> seen = Sets.newIdentityHashSet(); ExampleStackTrace path = acquiredLock.findPathTo(this, seen); if (path == null) { // this can be safely acquired after the acquiredLock. // // Note that there is a race condition here which can result in missing
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri Dec 15 19:31:54 UTC 2023 - 35.9K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/CycleDetectingLockFactory.java
// Otherwise, it's the first time seeing this lock relationship. Look for // a path from the acquiredLock to this. Set<LockGraphNode> seen = Sets.newIdentityHashSet(); ExampleStackTrace path = acquiredLock.findPathTo(this, seen); if (path == null) { // this can be safely acquired after the acquiredLock. // // Note that there is a race condition here which can result in missing
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri Dec 15 19:31:54 UTC 2023 - 35.9K bytes - Viewed (0) -
tensorflow/compiler/jit/xla_cluster_util.cc
string DescribeCycle(const GraphCycles* cycles, const Graph& graph, int src, int dst) { int32_t max_path_size = graph.num_node_ids() + 1; std::vector<int32> path(max_path_size); int32_t path_size = cycles->FindPath(dst, src, max_path_size, path.data()); if (path_size == 0) { return ""; } auto node_name = [&graph](int node_id) { if (!FastBoundsCheck(node_id, graph.num_node_ids())) { return string("(null)");
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Thu Feb 29 08:39:39 UTC 2024 - 21.3K bytes - Viewed (0) -
src/cmd/go/internal/mvs/mvs.go
work.Add(r) } }) // If there was an error, find the shortest path from the target to the // node where the error occurred so we can report a useful error message. if len(errs) > 0 { errPath := g.FindPath(func(m module.Version) bool { return errs[m] != nil }) if len(errPath) == 0 { panic("internal error: could not reconstruct path to module with error") } err := errs[errPath[len(errPath)-1]]
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/go/internal/modload/buildlist.go
mg.buildListOnce.Do(func() { mg.buildList = slices.Clip(mg.g.BuildList()) }) return mg.buildList } func (mg *ModuleGraph) findError() error { errStack := mg.g.FindPath(func(m module.Version) bool { _, err := mg.loadCache.Get(m) return err != nil && err != par.ErrCacheEntryNotFound }) if len(errStack) > 0 { _, err := mg.loadCache.Get(errStack[len(errStack)-1])
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 15 16:04:44 UTC 2024 - 53.8K bytes - Viewed (0) -
src/cmd/go/internal/modload/load.go
if err != nil { ld.error(err) } if v := mg.Selected("go"); v == ld.TidyGoVersion { rs = tidy } else { conflict := Conflict{ Path: mg.g.FindPath(func(m module.Version) bool { return m.Path == "go" && m.Version == v })[1:], Constraint: module.Version{Path: "go", Version: ld.TidyGoVersion}, } msg := conflict.Summary()
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 30 14:56:56 UTC 2024 - 84K bytes - Viewed (0)