- Sort Score
- Result 10 results
- Languages All
Results 31 - 40 of 197 for Edges (0.04 sec)
-
.github/actions/people/app/main.py
) def get_individual_sponsors(settings: Settings): nodes: List[SponsorshipAsMaintainerNode] = [] edges = get_graphql_sponsor_edges(settings=settings) while edges: for edge in edges: nodes.append(edge.node) last_edge = edges[-1] edges = get_graphql_sponsor_edges(settings=settings, after=last_edge.cursor)
Registered: Mon Jun 17 08:32:26 UTC 2024 - Last Modified: Tue Mar 26 17:38:21 UTC 2024 - 19.2K bytes - Viewed (0) -
tensorflow/compiler/jit/resource_operation_safety_analysis.cc
// enforce arbitrary ordering dependencies (via control or data edges) between // resource operations. Since all resource reads happen before all resource // writes, edges constraining resource reads to happen before resource writes // are fine, but all other kinds of edges are problematic. This analysis // computes the set of pairs of resource operations that cannot be put in the
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Fri Feb 09 11:36:41 UTC 2024 - 11.2K bytes - Viewed (0) -
platforms/native/language-native/src/main/java/org/gradle/language/nativeplatform/internal/incremental/IncrementalCompileFilesFactory.java
this.included = included; this.edges = edges; this.includeFileDirectives = dependentIncludeDirectives; } FileVisitResult(File file) { this.file = file; result = IncludeFileResolutionResult.NoMacroIncludes; includeDirectives = null; included = Collections.emptyList(); edges = Collections.emptyList();
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Thu Nov 16 20:20:03 UTC 2023 - 14.6K bytes - Viewed (0) -
plugin/pkg/auth/authorizer/node/graph_test.go
g.getOrCreateVertex_locked(nodeVertexType, "", "node1") return g }(), }, { // two edges from the same configmap to distinct nodes, will delete one of the edges desc: "edges are deleted, non-orphans and destination orphans are preserved", fromType: configMapVertexType, toType: nodeVertexType, toNamespace: "", toName: "node2",
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Fri Sep 23 23:14:19 UTC 2022 - 12.3K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/AbstractBaseGraph.java
@ElementTypesAreNonnullByDefault abstract class AbstractBaseGraph<N> implements BaseGraph<N> { /** * Returns the number of edges in this graph; used to calculate the size of {@link Graph#edges()}. * This implementation requires O(|N|) time. Classes extending this one may manually keep track of * the number of edges as the graph is updated, and override this method for better performance. */ protected long edgeCount() {
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Jan 22 17:29:38 UTC 2024 - 7.2K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/AbstractValueGraph.java
return new AbstractGraph<N>() { @Override public Set<N> nodes() { return AbstractValueGraph.this.nodes(); } @Override public Set<EndpointPair<N>> edges() { return AbstractValueGraph.this.edges(); } @Override public boolean isDirected() { return AbstractValueGraph.this.isDirected(); } @Override public boolean allowsSelfLoops() {
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 17 13:59:28 UTC 2023 - 4K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/AbstractNetwork.java
return AbstractNetwork.this.nodes(); } @Override public Set<EndpointPair<N>> edges() { if (allowsParallelEdges()) { return super.edges(); // Defer to AbstractGraph implementation. } // Optimized implementation assumes no parallel edges (1:1 edge to EndpointPair mapping). return new AbstractSet<EndpointPair<N>>() { @Override
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Mar 13 18:17:09 UTC 2024 - 10.1K bytes - Viewed (0) -
guava/src/com/google/common/graph/AbstractNetwork.java
return AbstractNetwork.this.nodes(); } @Override public Set<EndpointPair<N>> edges() { if (allowsParallelEdges()) { return super.edges(); // Defer to AbstractGraph implementation. } // Optimized implementation assumes no parallel edges (1:1 edge to EndpointPair mapping). return new AbstractSet<EndpointPair<N>>() { @Override
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Mar 13 18:17:09 UTC 2024 - 10.4K bytes - Viewed (0) -
guava/src/com/google/common/graph/AbstractBaseGraph.java
@ElementTypesAreNonnullByDefault abstract class AbstractBaseGraph<N> implements BaseGraph<N> { /** * Returns the number of edges in this graph; used to calculate the size of {@link Graph#edges()}. * This implementation requires O(|N|) time. Classes extending this one may manually keep track of * the number of edges as the graph is updated, and override this method for better performance. */ protected long edgeCount() {
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Jan 22 17:29:38 UTC 2024 - 7.2K bytes - Viewed (0) -
src/cmd/internal/pgo/pprof.go
} return postProcessNamedEdgeMap(weight, totalWeight) } func sortByWeight(edges []NamedCallEdge, weight map[NamedCallEdge]int64) { sort.Slice(edges, func(i, j int) bool { ei, ej := edges[i], edges[j] if wi, wj := weight[ei], weight[ej]; wi != wj { return wi > wj // want larger weight first } // same weight, order by name/line number
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Mar 27 20:20:01 UTC 2024 - 4K bytes - Viewed (0)