Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 1 - 10 of 536 for node2 (0.02 seconds)

The search processing time has exceeded the limit. The displayed results may be partial.

  1. compat/maven-compat/src/main/java/org/apache/maven/repository/legacy/resolver/conflict/NearestConflictResolver.java

         *      org.apache.maven.artifact.resolver.ResolutionNode)
         */
    
        @Override
        public ResolutionNode resolveConflict(ResolutionNode node1, ResolutionNode node2) {
            return node1.getDepth() <= node2.getDepth() ? node1 : node2;
        }
    Created: Sun Apr 05 03:35:12 GMT 2026
    - Last Modified: Fri Jun 06 14:28:57 GMT 2025
    - 1.8K bytes
    - Click Count (0)
  2. compat/maven-compat/src/main/java/org/apache/maven/repository/legacy/resolver/conflict/OldestConflictResolver.java

         */
    
        @Override
        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) {
    Created: Sun Apr 05 03:35:12 GMT 2026
    - Last Modified: Fri Jun 06 14:28:57 GMT 2025
    - 2.2K bytes
    - Click Count (0)
  3. impl/maven-core/src/main/java/org/apache/maven/lifecycle/internal/concurrent/BuildPlan.java

            add.forEach((name, node) -> org.merge(name, node, this::merge));
            return org;
        }
    
        private BuildStep merge(BuildStep node1, BuildStep node2) {
            node1.predecessors.addAll(node2.predecessors);
            node1.successors.addAll(node2.successors);
            node2.mojos.forEach((k, v) -> node1.mojos.merge(k, v, this::mergeMojos));
            return node1;
        }
    
    Created: Sun Apr 05 03:35:12 GMT 2026
    - Last Modified: Fri Mar 28 12:11:25 GMT 2025
    - 6.1K bytes
    - Click Count (0)
  4. 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);
    Created: Sun Apr 05 03:35:12 GMT 2026
    - Last Modified: Fri Oct 25 12:31:46 GMT 2024
    - 1.6K bytes
    - Click Count (0)
  5. 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) */
    Created: Sun Apr 05 03:35:12 GMT 2026
    - Last Modified: Fri Oct 25 12:31:46 GMT 2024
    - 2.4K bytes
    - Click Count (0)
  6. compat/maven-compat/src/main/java/org/apache/maven/repository/legacy/resolver/conflict/FarthestConflictResolver.java

         *      org.apache.maven.artifact.resolver.ResolutionNode)
         */
    
        @Override
        public ResolutionNode resolveConflict(ResolutionNode node1, ResolutionNode node2) {
            return node1.getDepth() >= node2.getDepth() ? node1 : node2;
        }
    Created: Sun Apr 05 03:35:12 GMT 2026
    - Last Modified: Fri Jun 06 14:28:57 GMT 2025
    - 1.8K bytes
    - Click Count (0)
  7. compat/maven-compat/src/main/java/org/apache/maven/repository/legacy/resolver/conflict/NewestConflictResolver.java

         */
    
        @Override
        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) {
    Created: Sun Apr 05 03:35:12 GMT 2026
    - Last Modified: Fri Jun 06 14:28:57 GMT 2025
    - 2.2K bytes
    - Click Count (0)
  8. src/test/java/org/codelibs/fess/helper/CoordinatorHelperTest.java

                    + "{\"_source\":{\"type\":\"heartbeat\",\"instanceId\":\"node1@host1\",\"hostname\":\"host1\",\"name\":\"node1\",\"createdTime\":1000}},"
                    + "{\"_source\":{\"type\":\"heartbeat\",\"instanceId\":\"node2@host2\",\"hostname\":\"host2\",\"name\":\"node2\",\"createdTime\":2000}}"
                    + "]}}";
            final CoordinatorHelper helper = createCapturingHelper("node1@host1", null, null, createMockResponse(200, searchResponse));
    
    Created: Tue Mar 31 13:07:34 GMT 2026
    - Last Modified: Sat Mar 28 06:59:19 GMT 2026
    - 58.6K bytes
    - Click Count (0)
  9. 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.
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Wed Apr 01 17:27:13 GMT 2026
    - 36K bytes
    - Click Count (0)
  10. android/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);
          }
        }
        ImmutableMultimap<Character, Character> graphMap = graphMapBuilder.build();
    
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Tue Sep 30 17:09:51 GMT 2025
    - 47.4K bytes
    - Click Count (0)
Back to Top