- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 47 for node12 (0.17 sec)
-
maven-compat/src/main/java/org/apache/maven/repository/legacy/resolver/conflict/NewestConflictResolver.java
*/ public ResolutionNode resolveConflict(ResolutionNode node1, ResolutionNode node2) { try { ArtifactVersion version1 = node1.getArtifact().getSelectedVersion(); ArtifactVersion version2 = node2.getArtifact().getSelectedVersion(); return version1.compareTo(version2) > 0 ? node1 : node2; } catch (OverConstrainedVersionException exception) {
Java - Registered: Sun May 05 03:35:11 GMT 2024 - Last Modified: Wed Sep 06 11:28:54 GMT 2023 - 2.2K bytes - Viewed (0) -
maven-compat/src/main/java/org/apache/maven/repository/MetadataGraphNode.java
import java.util.List; /** * MetadataGraph node - as it's a directed graph - holds adjacency lists for incident and exident nodes * * */ @Deprecated public class MetadataGraphNode { /** node payload */ MavenArtifactMetadata metadata; /** nodes, incident to this (depend on me) */ List<MetadataGraphNode> inNodes; /** nodes, exident to this (I depend on) */
Java - Registered: Sun May 05 03:35:11 GMT 2024 - Last Modified: Wed Sep 06 11:28:54 GMT 2023 - 2.4K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/CycleDetectingLockFactory.java
for (E key : keys) { LockGraphNode node = new LockGraphNode(getLockName(key)); nodes.add(node); map.put(key, node); } // Pre-populate all allowedPriorLocks with nodes of smaller ordinal. for (int i = 1; i < numKeys; i++) { nodes.get(i).checkAcquiredLocks(Policies.THROW, nodes.subList(0, i)); } // Pre-populate all disallowedPriorLocks with nodes of larger ordinal.
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri Dec 15 19:31:54 GMT 2023 - 35.9K bytes - Viewed (0) -
maven-compat/src/main/java/org/apache/maven/repository/legacy/resolver/conflict/OldestConflictResolver.java
*/ public ResolutionNode resolveConflict(ResolutionNode node1, ResolutionNode node2) { try { ArtifactVersion version1 = node1.getArtifact().getSelectedVersion(); ArtifactVersion version2 = node2.getArtifact().getSelectedVersion(); return version1.compareTo(version2) <= 0 ? node1 : node2; } catch (OverConstrainedVersionException exception) {
Java - Registered: Sun May 05 03:35:11 GMT 2024 - Last Modified: Wed Sep 06 11:28:54 GMT 2023 - 2.2K bytes - Viewed (0) -
maven-compat/src/main/java/org/apache/maven/repository/legacy/resolver/conflict/FarthestConflictResolver.java
* org.apache.maven.artifact.resolver.ResolutionNode) */ public ResolutionNode resolveConflict(ResolutionNode node1, ResolutionNode node2) { return node1.getDepth() >= node2.getDepth() ? node1 : node2; }
Java - Registered: Sun May 05 03:35:11 GMT 2024 - Last Modified: Wed Sep 06 11:28:54 GMT 2023 - 1.7K bytes - Viewed (0) -
maven-core/src/test/java/org/apache/maven/project/harness/Xpp3DomNodePointer.java
XmlNode node1 = (XmlNode) pointer1.getBaseValue(); XmlNode node2 = (XmlNode) pointer2.getBaseValue(); if (node1 == node2) { return 0; } for (XmlNode child : node.getChildren()) { if (child == node1) { return -1; } if (child == node2) { return 1; } }
Java - Registered: Sun Apr 28 03:35:10 GMT 2024 - Last Modified: Wed Sep 06 08:39:32 GMT 2023 - 3.3K bytes - Viewed (0) -
guava-tests/test/com/google/common/graph/TraverserTest.java
checkArgument( edge.length() == 2, "Expecting each edge to consist of 2 characters but got %s", edge); char node1 = edge.charAt(0); char node2 = edge.charAt(1); graphMapBuilder.put(node1, node2); if (!directed) { graphMapBuilder.put(node2, node1); } } final ImmutableMultimap<Character, Character> graphMap = graphMapBuilder.build();
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 47.5K bytes - Viewed (0) -
guava-tests/test/com/google/common/graph/ValueGraphTest.java
for (Integer node : graph.nodes()) { assertThat(graph.adjacentNodes(node)).isEqualTo(asGraph.adjacentNodes(node)); assertThat(graph.predecessors(node)).isEqualTo(asGraph.predecessors(node)); assertThat(graph.successors(node)).isEqualTo(asGraph.successors(node)); assertThat(graph.degree(node)).isEqualTo(asGraph.degree(node)); assertThat(graph.inDegree(node)).isEqualTo(asGraph.inDegree(node));
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Tue Feb 06 18:35:19 GMT 2024 - 20K bytes - Viewed (0) -
maven-compat/src/main/java/org/apache/maven/repository/metadata/MetadataGraph.java
* * @param tree "dirty" tree root * @param versionedVertices true if graph nodes should be versioned (different versions -> different nodes) * @param scopedVertices true if graph nodes should be versioned and scoped * (different versions and/or scopes -> different nodes) * */ public MetadataGraph(MetadataTreeNode tree, boolean versionedVertices, boolean scopedVertices)
Java - Registered: Sun May 05 03:35:11 GMT 2024 - Last Modified: Thu Oct 05 18:41:13 GMT 2023 - 13.1K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/AbstractBaseGraph.java
checkNotNull(nodeU); checkNotNull(nodeV); return nodes().contains(nodeU) && successors(nodeU).contains(nodeV); } @Override public boolean hasEdgeConnecting(EndpointPair<N> endpoints) { checkNotNull(endpoints); if (!isOrderingCompatible(endpoints)) { return false; } N nodeU = endpoints.nodeU(); N nodeV = endpoints.nodeV();
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 7.2K bytes - Viewed (0)