- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 121 for Revisiting (0.22 sec)
-
src/cmd/vendor/golang.org/x/mod/sumdb/tlog/tile.go
if j, ok := tileOrder[p]; ok { if k == 0 { indexTileOrder[i] = j } break } } // Walk back down recording child tiles after parents. // This loop ends by revisiting the tile for this index // (tileParent(tile, 0, r.tree.N)) unless k == 0, in which // case the previous loop did it. for k--; k >= 0; k-- { p := tileParent(tile, k, r.tree.N) if p.W != 1<<uint(p.H) {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri May 03 02:38:00 UTC 2024 - 13K bytes - Viewed (0) -
platforms/software/dependency-management/src/main/java/org/gradle/api/internal/artifacts/ivyservice/resolveengine/graph/builder/NodeState.java
return singleStrictVersionConstraints; } } void collectEndorsedStrictVersions(List<EdgeState> dependencies) { if (endorsesStrictVersionsFrom != null) { // we are revisiting this node endorsesStrictVersionsFrom.clear(); } for (EdgeState edgeState : dependencies) {
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Fri Jun 07 14:19:34 UTC 2024 - 58.9K bytes - Viewed (0) -
tensorflow/compiler/jit/deadness_analysis.cc
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Tue Mar 12 06:33:33 UTC 2024 - 60.4K bytes - Viewed (0) -
platforms/core-execution/snapshots/src/main/java/org/gradle/internal/snapshot/SnapshotVisitResult.java
/** * Ways to continue visiting a snapshot hierarchy after an entry has been visited. * * @see java.nio.file.FileVisitResult */ public enum SnapshotVisitResult { /** * Continue visiting. When returned after visiting a directory, * the entries in the directory will be visited next. */ CONTINUE, /** * Terminate visiting immediately. */ TERMINATE,
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Fri Sep 22 09:34:50 UTC 2023 - 1.2K bytes - Viewed (0) -
subprojects/composite-builds/src/main/java/org/gradle/composite/internal/DefaultBuildController.java
} } private static void checkForCyclesFor(TaskInternal task, Set<TaskInternal> visited, Set<TaskInternal> visiting) { if (visited.contains(task)) { // Already checked return; } if (!visiting.add(task)) { // Visiting dependencies -> have found a cycle
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Thu Jun 22 20:29:05 UTC 2023 - 7.7K bytes - Viewed (0) -
pkg/api/v1/pod/util.go
if len(name) == 0 { // continue visiting return true } // delegate to visitor return visitor(name) } } // VisitContainers invokes the visitor function with a pointer to every container // spec in the given pod spec with type set in mask. If visitor returns false, // visiting is short-circuited. VisitContainers returns true if visiting completes, // false if visiting was short-circuited.
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Fri Feb 24 17:18:04 UTC 2023 - 13.2K bytes - Viewed (0) -
maven-core/src/main/java/org/apache/maven/project/Graph.java
cycle.removeLast(); stateMap.put(v, DfsState.VISITED); } else if (state == DfsState.VISITING) { // we are already visiting this vertex, this mean we have a cycle int pos = cycle.lastIndexOf(v.label); List<String> ret = cycle.subList(pos, cycle.size()); ret.add(v.label); return ret; } }
Registered: Wed Jun 12 09:55:16 UTC 2024 - Last Modified: Fri Sep 22 06:02:04 UTC 2023 - 3.9K bytes - Viewed (0) -
platforms/core-configuration/file-collections/src/main/java/org/gradle/api/internal/file/FileCollectionStructureVisitor.java
/** * Called when starting to visit a file collection. Can return true to continue with visiting or false to skip this collection and its contents. * * <p>When a file collection represents a container of file collections, the children of the file collection are visited in order. Visiting a child works in the
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Thu Sep 28 09:51:04 UTC 2023 - 3.3K bytes - Viewed (0) -
maven-model-builder/src/main/java/org/apache/maven/model/building/Graph.java
Registered: Wed Jun 12 09:55:16 UTC 2024 - Last Modified: Mon Jan 22 17:27:48 UTC 2024 - 3.1K bytes - Viewed (0) -
maven-core/src/main/java/org/apache/maven/internal/impl/Graph.java
cycle.removeLast(); stateMap.put(v, DfsState.VISITED); } else if (state == DfsState.VISITING) { // we are already visiting this vertex, this mean we have a cycle int pos = cycle.lastIndexOf(v.label); List<String> ret = cycle.subList(pos, cycle.size()); ret.add(v.label); return ret; } }
Registered: Wed Jun 12 09:55:16 UTC 2024 - Last Modified: Fri Apr 12 10:50:18 UTC 2024 - 4.5K bytes - Viewed (0)