- Sort Score
- Result 10 results
- Languages All
Results 101 - 110 of 120 for visitEnd (0.16 sec)
-
src/cmd/compile/internal/ssagen/phi.go
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Nov 18 17:59:44 UTC 2022 - 15.2K bytes - Viewed (0) -
src/sync/map.go
// If f returns false, range stops the iteration. // // Range does not necessarily correspond to any consistent snapshot of the Map's // contents: no key will be visited more than once, but if the value for any key // is stored or deleted concurrently (including by f), Range may reflect any // mapping for that key from any point during the Range call. Range does not
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Jun 07 21:14:51 UTC 2024 - 15.6K bytes - Viewed (0) -
pkg/util/iptree/iptree.go
break } // update the new bit position with the new node mask bitPosition = n.prefix.Bits() } recursiveWalk[T](n, fn) } // WalkPath is used to walk the tree, but only visiting nodes // from the root down to a given IP prefix. Where WalkPrefix walks // all the entries *under* the given prefix, this walks the // entries *above* the given prefix.
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Tue Oct 31 21:05:04 UTC 2023 - 17.7K bytes - Viewed (0) -
src/cmd/compile/internal/rangefunc/rewrite.go
loop := &forLoop{nfor: nfor, depth: 1 + len(r.forStack)} r.forStack = append(r.forStack, loop) r.startLoop(loop) } case nil: // n == nil signals that we are done visiting // the top-of-stack node's children. Find it. n = r.stack[len(r.stack)-1] // If we are inside a range-over-func, // take this moment to replace any break/continue/goto/return
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 01:05:44 UTC 2024 - 41.6K bytes - Viewed (0) -
guava/src/com/google/common/graph/Graphs.java
return true; } return hasCycle(network.asGraph()); } /** * Performs a traversal of the nodes reachable from {@code node}. If we ever reach a node we've * already visited (following only outgoing edges and without reusing edges), we know there's a * cycle in the graph. */ private static <N> boolean subgraphHasCycle( Graph<N> graph,
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 01 16:15:01 UTC 2024 - 21.7K bytes - Viewed (0) -
src/go/types/predicates.go
// are extremely short (bounded by the nesting depth of interface // type declarations that recur via parameter types, an extremely // rare occurrence). An alternative implementation might use a // "visited" map, but that is probably less efficient overall. q := &ifacePair{x, y, p} for p != nil { if p.identical(q) { return true // same pair was compared before } p = p.prev }
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/memcombine.go
// Mark all stores which are not last in a store sequence. mark.clear() for _, v := range b.Values { if v.Op == OpStore { mark.add(v.MemoryArg().ID) } } // pick an order for visiting stores such that // later stores come earlier in the ordering. order = order[:0] for _, v := range b.Values { if v.Op != OpStore { continue } if mark.contains(v.ID) {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Mar 21 19:45:41 UTC 2024 - 18.4K bytes - Viewed (0) -
src/cmd/compile/internal/types2/predicates.go
// are extremely short (bounded by the nesting depth of interface // type declarations that recur via parameter types, an extremely // rare occurrence). An alternative implementation might use a // "visited" map, but that is probably less efficient overall. q := &ifacePair{x, y, p} for p != nil { if p.identical(q) { return true // same pair was compared before } p = p.prev }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 03:01:18 UTC 2024 - 17.5K bytes - Viewed (0) -
guava/src/com/google/common/reflect/ClassPath.java
* @param packagePrefix resource path prefix inside {@code classloader} for any files found * under {@code directory} * @param currentPath canonical files already visited in the current directory tree path, for * cycle elimination */ private void scanDirectory( File directory, String packagePrefix, Set<File> currentPath,
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Jan 05 17:43:40 UTC 2022 - 24.9K bytes - Viewed (0) -
src/text/template/doc.go
otherwise, dot is set to the successive elements of the array, slice, or map and T1 is executed. If the value is a map and the keys are of basic type with a defined order, the elements will be visited in sorted key order. {{range pipeline}} T1 {{else}} T0 {{end}} The value of the pipeline must be an array, slice, map, or channel. If the value of the pipeline has length zero, dot is unaffected and
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Sat Feb 24 21:59:12 UTC 2024 - 17.9K bytes - Viewed (0)