- Sort Score
- Result 10 results
- Languages All
Results 41 - 50 of 197 for Edges (0.05 sec)
-
src/cmd/internal/pgo/pgo.go
// TotalWeight is the aggregated edge weights across the profile. This // helps us determine the percentage threshold for hot/cold // partitioning. TotalWeight int64 // NamedEdgeMap contains all unique call edges in the profile and their // edge weight. NamedEdgeMap NamedEdgeMap } // NamedCallEdge identifies a call edge by linker symbol names and call site // offset. type NamedCallEdge struct { CallerName string
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Mar 27 20:20:01 UTC 2024 - 1.6K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/critical.go
// Copyright 2015 The Go Authors. All rights reserved. // Use of this source code is governed by a BSD-style // license that can be found in the LICENSE file. package ssa // critical splits critical edges (those that go from a block with // more than one outedge to a block with more than one inedge). // Regalloc wants a critical-edge-free CFG so it can implement phi values. func critical(f *Func) {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue May 16 21:40:11 UTC 2023 - 3.1K bytes - Viewed (0) -
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 - 4.3K bytes - Viewed (0) -
.github/actions/notify-translations/app/main.py
repository(name: "fastapi", owner: "tiangolo") { discussions(categoryId: $category_id, first: 100) { nodes { title id number labels(first: 10) { edges { node { id name } } } } } } } """ translation_discussion_query = """
Registered: Mon Jun 17 08:32:26 UTC 2024 - Last Modified: Wed Sep 27 23:01:46 UTC 2023 - 12.4K bytes - Viewed (0) -
platforms/native/language-native/src/main/java/org/gradle/language/nativeplatform/internal/incremental/SourceFileState.java
} public HashCode getHash() { return hash; } /** * Were any edges in the include file graph unable to be resolved? */ public boolean isHasUnresolved() { return hasUnresolved; } /** * The set of successfully resolved edges in the include file graph. */ public ImmutableSet<IncludeFileEdge> getEdges() { return resolvedIncludes;
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Thu Nov 16 20:20:03 UTC 2023 - 1.6K bytes - Viewed (0) -
platforms/core-configuration/kotlin-dsl/src/main/kotlin/org/gradle/kotlin/dsl/resolver/CompactTree.kt
override fun toString() = "ΓΈ" } data class Label(val label: String) : CompactTree() { override fun toString() = label } data class Branch(val edges: List<CompactTree>) : CompactTree() { override fun toString() = edges.joinToString(separator = ", ", prefix = "{", postfix = "}") } data class Edge(val label: Label, val tree: CompactTree) : CompactTree() {
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Wed Aug 02 08:06:49 UTC 2023 - 2.5K bytes - Viewed (0) -
src/internal/dag/parse_test.go
func mustParse(t *testing.T, dag string) *Graph { t.Helper() g, err := Parse(dag) if err != nil { t.Fatal(err) } return g } func wantEdges(t *testing.T, g *Graph, edges string) { t.Helper() wantEdges := strings.Fields(edges) wantEdgeMap := make(map[string]bool) for _, e := range wantEdges { wantEdgeMap[e] = true } for _, n1 := range g.Nodes { for _, n2 := range g.Nodes {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Aug 04 15:31:42 UTC 2022 - 1.3K bytes - Viewed (0) -
src/cmd/vendor/github.com/google/pprof/internal/graph/graph.go
} // edgeEntropyScore computes the entropy value for a set of edges // coming in or out of a node. Entropy (as defined in information // theory) refers to the amount of information encoded by the set of // edges. A set of edges that have a more interesting distribution of // samples gets a higher score. func edgeEntropyScore(n *Node, edges EdgeMap, self int64) float64 { score := float64(0) total := self
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri May 31 19:48:28 UTC 2024 - 31K bytes - Viewed (0) -
maven-compat/src/main/java/org/apache/maven/repository/metadata/MetadataGraph.java
List<MetadataGraphEdge> edges = getIncidentEdges(vTo); if (edges == null || edges.isEmpty()) { return null; } List<MetadataGraphEdge> res = new ArrayList<>(edges.size()); for (MetadataGraphEdge e : edges) { if (e.getSource().equals(vFrom)) { res.add(e); }
Registered: Wed Jun 12 09:55:16 UTC 2024 - Last Modified: Thu Oct 05 18:41:13 UTC 2023 - 13.1K bytes - Viewed (0) -
tensorflow/compiler/jit/xla_cluster_util.cc
// * replace edges to "Enter" nodes, and edges from "Exit" nodes with edges // to/from the corresponding frame node. In essence, we collapse the loop // into a single node for the purpose of cycle detection in the enclosing // graph. // * the body of the loop should now be disconnected from the rest of the // graph; we make it acyclic by breaking loop backedges (edges outgoing from // "NextIteration" nodes.
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Thu Feb 29 08:39:39 UTC 2024 - 21.3K bytes - Viewed (0)