Search Options

Results per page
Sort
Preferred Languages
Advance

Results 71 - 80 of 533 for Visiting (0.57 sec)

  1. tensorflow/compiler/jit/deadness_analysis.cc

            // fine and we have a bug in deadness analysis.
            return errors::Internal("Could not find input ", in_edge->DebugString(),
                                    " to ", n->name(),
                                    " when visiting the graph in post-order.  Most "
                                    "likely indicates a bug in deadness analysis.");
          }
          result->push_back(it->second);
        }
      }
      return absl::OkStatus();
    }
    
    Registered: Sun Jun 16 05:45:23 UTC 2024
    - Last Modified: Tue Mar 12 06:33:33 UTC 2024
    - 60.4K bytes
    - Viewed (0)
  2. src/path/filepath/path.go

    				}
    			}
    		}
    	}
    	return nil
    }
    
    // WalkDir walks the file tree rooted at root, calling fn for each file or
    // directory in the tree, including root.
    //
    // All errors that arise visiting files and directories are filtered by fn:
    // see the [fs.WalkDirFunc] documentation for details.
    //
    // The files are walked in lexical order, which makes the output deterministic
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Thu May 23 01:00:11 UTC 2024
    - 15.5K bytes
    - Viewed (0)
  3. platforms/software/dependency-management/src/test/groovy/org/gradle/api/internal/artifacts/ivyservice/resolveengine/result/StreamingResolutionResultBuilderTest.groovy

            then:
            printGraph(result.rootSource.get()) == """org:root:1.0
      org:dep1:2.0(C) [root]
      org:dep2:3.0 -> org:dep2:3.0 - Could not resolve org:dep2:3.0.
    """
        }
    
        def "visiting resolved module version again has no effect"() {
            def root = rootNode(1, "org", "root", "1.0")
            def selector = selector(7, "org", "dep1", "2.0")
            root.outgoingEdges >> [dep(selector, 1, 2)]
    
    Registered: Wed Jun 12 18:38:38 UTC 2024
    - Last Modified: Thu May 23 17:29:40 UTC 2024
    - 11.5K bytes
    - Viewed (0)
  4. platforms/core-configuration/file-collections/src/test/groovy/org/gradle/api/internal/file/CompositeFileCollectionSpec.groovy

                }
            }
    
            expect:
            collection.buildDependencies.getDependencies(task) == [dependency1, dependency2] as LinkedHashSet
        }
    
        def "descendant can avoid visiting content when task dependencies are queried"() {
            def task = Stub(Task)
            def dependency1 = Stub(Task)
            def dependency2 = Stub(Task)
            def child1 = new TestCollection() {
                @Override
    Registered: Wed Jun 12 18:38:38 UTC 2024
    - Last Modified: Thu Sep 28 09:51:04 UTC 2023
    - 12K bytes
    - Viewed (0)
  5. src/cmd/internal/cov/readcovdata.go

    }
    
    // visitPod examines a coverage data 'pod', that is, a meta-data file and
    // zero or more counter data files that refer to that meta-data file.
    func (r *CovDataReader) visitPod(p pods.Pod) error {
    	r.verb(1, "visiting pod: metafile %s with %d counter files",
    		p.MetaFile, len(p.CounterDataFiles))
    	r.vis.BeginPod(p)
    
    	// Open meta-file
    	f, err := os.Open(p.MetaFile)
    	if err != nil {
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Wed Jun 14 00:03:57 UTC 2023
    - 8.4K bytes
    - Viewed (0)
  6. platforms/software/dependency-management/src/main/java/org/gradle/api/internal/artifacts/transform/DefaultTransform.java

                    // TODO - hoist this up into configuration file collection visiting (and not when visiting the upstream dependencies of a transform), and deprecate this in Gradle 7.x
                    //
    Registered: Wed Jun 12 18:38:38 UTC 2024
    - Last Modified: Thu Apr 18 08:26:19 UTC 2024
    - 34.8K bytes
    - Viewed (0)
  7. platforms/core-runtime/logging/src/main/java/org/gradle/internal/logging/text/TreeFormatter.java

            }
            return this;
        }
    
        @Override
        public TreeFormatter endChildren() {
            if (current.parent == null) {
                throw new IllegalStateException("Not visiting any node.");
            }
            if (current.state == State.CollectValue) {
                current.state = State.Done;
                current = current.parent;
            }
    Registered: Wed Jun 12 18:38:38 UTC 2024
    - Last Modified: Mon Apr 22 14:04:39 UTC 2024
    - 11.8K bytes
    - Viewed (0)
  8. platforms/native/language-native/src/main/java/org/gradle/language/nativeplatform/internal/incremental/IncrementalCompileFilesFactory.java

         */
        private static class FileDetails {
            final IncludeDirectives directives;
            // Non-null when the result of visiting this file can be reused
            @Nullable
            FileVisitResult results;
    
            FileDetails(IncludeDirectives directives) {
                this.directives = directives;
            }
        }
    
        /**
    Registered: Wed Jun 12 18:38:38 UTC 2024
    - Last Modified: Thu Nov 16 20:20:03 UTC 2023
    - 14.6K bytes
    - Viewed (0)
  9. pkg/registry/rbac/validation/rule.go

    	// VisitRulesFor invokes visitor() with each rule that applies to a given user in a given namespace, and each error encountered resolving those rules.
    	// If visitor() returns false, visiting is short-circuited.
    	VisitRulesFor(user user.Info, namespace string, visitor func(source fmt.Stringer, rule *rbacv1.PolicyRule, err error) bool)
    }
    
    Registered: Sat Jun 15 01:39:40 UTC 2024
    - Last Modified: Mon Nov 02 16:51:16 UTC 2020
    - 11.6K bytes
    - Viewed (0)
  10. src/go/types/mono.go

    	// that appears twice.
    	for !seen[v] {
    		stack = append(stack, v)
    		seen[v] = true
    		v = check.mono.edges[check.mono.vertices[v].pre].src
    	}
    
    	// Trim any vertices we visited before visiting v the first
    	// time. Since v is the first vertex we found within the cycle, any
    	// vertices we visited earlier cannot be part of the cycle.
    	for stack[0] != v {
    		stack = stack[1:]
    	}
    
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Wed Apr 03 18:48:38 UTC 2024
    - 9.2K bytes
    - Viewed (0)
Back to top