- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 32 for nodeIP (0.05 sec)
-
compat/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) */
Registered: Sun Nov 03 03:35:11 UTC 2024 - Last Modified: Fri Oct 25 12:31:46 UTC 2024 - 2.4K bytes - Viewed (0) -
compat/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) {
Registered: Sun Nov 03 03:35:11 UTC 2024 - Last Modified: Fri Oct 25 12:31:46 UTC 2024 - 2.2K bytes - Viewed (0) -
compat/maven-compat/src/main/java/org/apache/maven/repository/legacy/resolver/conflict/ConflictResolver.java
* * @param node1 the first artifact declaration * @param node2 the second artifact declaration * @return the artifact declaration to use: <code>node1</code>; <code>node2</code>; or <code>null</code>if * this conflict cannot be resolved * @since 3.0 */ ResolutionNode resolveConflict(ResolutionNode node1, ResolutionNode node2);
Registered: Sun Nov 03 03:35:11 UTC 2024 - Last Modified: Fri Oct 25 12:31:46 UTC 2024 - 1.6K bytes - Viewed (0) -
compat/maven-compat/src/main/java/org/apache/maven/repository/legacy/resolver/conflict/NearestConflictResolver.java
* org.apache.maven.artifact.resolver.ResolutionNode) */ public ResolutionNode resolveConflict(ResolutionNode node1, ResolutionNode node2) { return node1.getDepth() <= node2.getDepth() ? node1 : node2; }
Registered: Sun Nov 03 03:35:11 UTC 2024 - Last Modified: Fri Oct 25 12:31:46 UTC 2024 - 1.7K bytes - Viewed (0) -
compat/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; }
Registered: Sun Nov 03 03:35:11 UTC 2024 - Last Modified: Fri Oct 25 12:31:46 UTC 2024 - 1.7K bytes - Viewed (0) -
compat/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) {
Registered: Sun Nov 03 03:35:11 UTC 2024 - Last Modified: Fri Oct 25 12:31:46 UTC 2024 - 2.2K bytes - Viewed (0) -
compat/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)
Registered: Sun Nov 03 03:35:11 UTC 2024 - Last Modified: Fri Oct 25 12:31:46 UTC 2024 - 13.1K bytes - Viewed (0) -
guava/src/com/google/common/collect/TreeTraverser.java
/** Returns the children of the specified node. Must not contain null. */ public abstract Iterable<T> children(T root); /** * Returns an unmodifiable iterable over the nodes in a tree structure, using pre-order traversal. * That is, each node's subtrees are traversed after the node itself is returned. * * <p>No guarantees are made about the behavior of the traversal when nodes change while iteration
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Wed Oct 30 16:15:19 UTC 2024 - 8.9K bytes - Viewed (0) -
fess-crawler-opensearch/src/test/java/org/codelibs/fess/crawler/service/impl/OpenSearchUrlQueueServiceTest.java
// create runner instance runner = new OpenSearchRunner(); // create ES nodes final String clusterName = UUID.randomUUID().toString(); runner.onBuild((number, settingsBuilder) -> { settingsBuilder.put("http.cors.enabled", true); settingsBuilder.put("discovery.type", "single-node"); }).build(newConfigs().clusterName(clusterName).numOfNode(1));
Registered: Sun Nov 10 03:50:12 UTC 2024 - Last Modified: Thu Nov 07 04:44:10 UTC 2024 - 5.1K bytes - Viewed (0) -
impl/maven-core/src/main/java/org/apache/maven/RepositoryUtils.java
Collection<org.apache.maven.artifact.Artifact> artifacts, Collection<? extends DependencyNode> nodes, List<String> trail, DependencyFilter filter) { for (DependencyNode node : nodes) { org.apache.maven.artifact.Artifact artifact = toArtifact(node.getDependency()); List<String> nodeTrail = new ArrayList<>(trail.size() + 1);
Registered: Sun Nov 03 03:35:11 UTC 2024 - Last Modified: Fri Oct 25 12:31:46 UTC 2024 - 16K bytes - Viewed (0)