- Sort Score
- Result 10 results
- Languages All
Results 31 - 40 of 41 for vertical (0.37 sec)
-
src/go/types/mono.go
src := &check.mono.vertices[edge.src] dst := &check.mono.vertices[edge.dst] // N.B., we're looking for the greatest weight paths, unlike // typical Bellman-Ford. w := src.weight + edge.weight if w <= dst.weight { continue } dst.pre = i dst.len = src.len + 1 if dst.len == len(check.mono.vertices) { check.reportInstanceLoop(edge.dst) return
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Apr 03 18:48:38 UTC 2024 - 9.2K bytes - Viewed (0) -
src/cmd/compile/internal/types2/mono.go
for i, edge := range check.mono.edges { src := &check.mono.vertices[edge.src] dst := &check.mono.vertices[edge.dst] // N.B., we're looking for the greatest weight paths, unlike // typical Bellman-Ford. w := src.weight + edge.weight if w <= dst.weight { continue } dst.pre = i dst.len = src.len + 1 if dst.len == len(check.mono.vertices) { check.reportInstanceLoop(edge.dst) return
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Feb 28 00:05:29 UTC 2024 - 9.1K bytes - Viewed (0) -
maven-core/src/main/java/org/apache/maven/project/Graph.java
VISITING, VISITED } final Map<String, Vertex> vertices = new LinkedHashMap<>(); public Vertex getVertex(String id) { return vertices.get(id); } public Collection<Vertex> getVertices() { return vertices.values(); } Vertex addVertex(String label) { return vertices.computeIfAbsent(label, Vertex::new); }
Registered: Wed Jun 12 09:55:16 UTC 2024 - Last Modified: Fri Sep 22 06:02:04 UTC 2023 - 3.9K bytes - Viewed (0) -
maven-compat/src/main/java/org/apache/maven/repository/metadata/DefaultGraphConflictResolver.java
} if (graph.isEmptyEdges()) { return null; // no edges - nothing to worry about } final TreeSet<MetadataGraphVertex> vertices = graph.getVertices(); try { // edge case - single vertex graph if (vertices.size() == 1) { return new MetadataGraph(entry);
Registered: Wed Jun 12 09:55:16 UTC 2024 - Last Modified: Wed Sep 06 11:28:54 UTC 2023 - 8.2K bytes - Viewed (0) -
maven-core/src/main/java/org/apache/maven/internal/impl/Graph.java
VISITING, VISITED } final Map<String, Vertex> vertices = new LinkedHashMap<>(); public Vertex getVertex(String id) { return vertices.get(id); } public Collection<Vertex> getVertices() { return vertices.values(); } Vertex addVertex(String label) { return vertices.computeIfAbsent(label, Vertex::new); }
Registered: Wed Jun 12 09:55:16 UTC 2024 - Last Modified: Fri Apr 12 10:50:18 UTC 2024 - 4.5K bytes - Viewed (0) -
maven-compat/src/test/java/org/apache/maven/repository/metadata/DefaultGraphConflictResolverTest.java
assertNotNull(res, "null graph after resolver"); assertNotNull(res.getVertices(), "no vertices in the resulting graph after resolver"); assertNotNull(res.getExcidentEdges(v1), "no edges in the resulting graph after resolver"); assertEquals(4, res.getVertices().size(), "wrong # of vertices in the resulting graph after resolver"); assertEquals( 2,
Registered: Wed Jun 12 09:55:16 UTC 2024 - Last Modified: Thu Apr 25 05:46:50 UTC 2024 - 8.1K bytes - Viewed (0) -
maven-compat/src/main/java/org/apache/maven/repository/metadata/ClasspathTransformation.java
* @param resolve - whether to resolve artifacts. * @return Collection of metadata objects in the linked subgraph of the graph which * contains the graph.getEntry() vertice */ ClasspathContainer transform(MetadataGraph dirtyGraph, ArtifactScopeEnum scope, boolean resolve) throws MetadataGraphTransformationException;
Registered: Wed Jun 12 09:55:16 UTC 2024 - Last Modified: Wed Sep 06 11:28:54 UTC 2023 - 1.7K bytes - Viewed (0) -
maven-compat/src/main/java/org/apache/maven/repository/metadata/MetadataGraphVertex.java
* specific language governing permissions and limitations * under the License. */ package org.apache.maven.repository.metadata; import org.apache.maven.artifact.ArtifactScopeEnum; /** * metadata graph vertice - just a wrapper around artifact's metadata * */ @Deprecated public class MetadataGraphVertex implements Comparable<MetadataGraphVertex> { ArtifactMetadata md; // indications to use these in comparison
Registered: Wed Jun 12 09:55:16 UTC 2024 - Last Modified: Wed Sep 06 11:28:54 UTC 2023 - 5.3K bytes - Viewed (0) -
src/image/ycbcr.go
// YCbCr is an in-memory image of Y'CbCr colors. There is one Y sample per // pixel, but each Cb and Cr sample can span one or more pixels. // YStride is the Y slice index delta between vertically adjacent pixels. // CStride is the Cb and Cr slice index delta between vertically adjacent pixels // that map to separate chroma samples. // It is not an absolute requirement, but YStride and len(Y) are typically // multiples of 8, and: //
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Oct 19 12:02:45 UTC 2023 - 8.7K bytes - Viewed (0) -
pkg/controller/garbagecollector/dump.go
} func toDOTNodesAndEdges(uidToNode map[types.UID]*node) ([]*dotVertex, []dotEdge) { nodes := []*dotVertex{} edges := []dotEdge{} uidToVertex := map[types.UID]*dotVertex{} // add the vertices first, then edges. That avoids having to deal with missing refs. for _, node := range uidToNode { // skip adding objects that don't have owner references and aren't referred to.
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Fri Sep 23 17:12:33 UTC 2022 - 9.5K bytes - Viewed (0)