Search Options

Results per page
Sort
Preferred Languages
Advance

Results 181 - 190 of 3,103 for node (0.01 sec)

  1. api/maven-api-core/src/main/java/org/apache/maven/api/Session.java

         *
         * @see org.apache.maven.api.services.DependencyResolver#flatten(Session, Node, PathScope)
         */
        @Nonnull
        List<Node> flattenDependencies(@Nonnull Node node, @Nonnull PathScope scope);
    
        /**
         * Shortcut for {@code getService(DependencyResolver.class).resolve(...).getPaths()}.
         *
    Registered: Sun Sep 07 03:35:12 UTC 2025
    - Last Modified: Thu Jul 03 14:18:26 UTC 2025
    - 36.5K bytes
    - Viewed (0)
  2. cmd/notification.go

    	g := errgroup.WithNErrs(len(sys.peerClients))
    	peerChannels := make([]<-chan madmin.ReplicationMRF, len(sys.peerClients))
    	for index, client := range sys.peerClients {
    		if client == nil {
    			continue
    		}
    		host := client.host.String()
    		if host != node && node != "all" {
    			continue
    		}
    		index := index
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Fri Aug 29 02:39:48 UTC 2025
    - 45.9K bytes
    - Viewed (0)
  3. android/guava-tests/test/com/google/common/graph/AbstractStandardUndirectedGraphTest.java

        for (Integer node : graph.nodes()) {
          new EqualsTester()
              .addEqualityGroup(
                  graph.predecessors(node), graph.successors(node), graph.adjacentNodes(node))
              .testEquals();
        }
      }
    
      @Override
      @Test
      public void nodes_checkReturnedSetMutability() {
        assume().that(graphIsMutable()).isTrue();
    
        Set<Integer> nodes = graph.nodes();
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Thu Dec 19 18:03:30 UTC 2024
    - 12.7K bytes
    - Viewed (0)
  4. android/guava/src/com/google/thirdparty/publicsuffix/PublicSuffixType.java

      /** Returns a PublicSuffixType of the right type according to the given code */
      static PublicSuffixType fromCode(char code) {
        for (PublicSuffixType value : values()) {
          if (value.getInnerNodeCode() == code || value.getLeafNodeCode() == code) {
            return value;
          }
        }
        throw new IllegalArgumentException("No enum corresponding to given code: " + code);
      }
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Wed Dec 16 19:54:45 UTC 2020
    - 2K bytes
    - Viewed (0)
  5. fess-crawler-opensearch/src/test/java/org/codelibs/fess/crawler/service/impl/OpenSearchDataServiceTest.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 Sep 21 03:50:09 UTC 2025
    - Last Modified: Sat Mar 15 06:52:00 UTC 2025
    - 6.8K bytes
    - Viewed (0)
  6. 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 Sep 21 03:50:09 UTC 2025
    - Last Modified: Thu Aug 07 02:55:08 UTC 2025
    - 5.8K bytes
    - Viewed (0)
  7. docs/erasure/README.md

    # MinIO Erasure Code Quickstart Guide [![Slack](https://slack.min.io/slack?type=svg)](https://slack.min.io)
    
    MinIO protects data against hardware failures and silent data corruption using erasure code and checksums. With the highest level of redundancy, you may lose up to half (N/2) of the total drives and still be able to recover the data.
    
    ## What is Erasure Code?
    
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Tue Aug 12 18:20:36 UTC 2025
    - 4.2K bytes
    - Viewed (0)
  8. android/guava-tests/test/com/google/common/graph/TraverserTest.java

          @Override
          public Iterable<? extends Character> successors(Character node) {
            checkArgument(
                graphMap.containsKey(node) || graphMap.containsValue(node),
                "Node %s is not an element of this graph",
                node);
            return Ordering.natural().immutableSortedCopy(graphMap.get(node));
          }
        };
      }
    
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Tue May 13 18:46:00 UTC 2025
    - 47.5K bytes
    - Viewed (0)
  9. guava-tests/test/com/google/common/graph/TraverserTest.java

          @Override
          public Iterable<? extends Character> successors(Character node) {
            checkArgument(
                graphMap.containsKey(node) || graphMap.containsValue(node),
                "Node %s is not an element of this graph",
                node);
            return Ordering.natural().immutableSortedCopy(graphMap.get(node));
          }
        };
      }
    
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Tue May 13 18:46:00 UTC 2025
    - 47.5K bytes
    - Viewed (0)
  10. android/guava-tests/test/com/google/common/graph/GraphMutationTest.java

          AbstractGraphTest.validateGraph(graph);
    
          Collections.shuffle(nodeList, gen);
          for (Integer node : nodeList) {
            assertThat(graph.addNode(node)).isTrue();
          }
          Collections.shuffle(edgeList, gen);
          for (EndpointPair<Integer> edge : edgeList) {
            assertThat(graph.putEdge(edge.nodeU(), edge.nodeV())).isTrue();
          }
    
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Thu Dec 19 18:03:30 UTC 2024
    - 4.2K bytes
    - Viewed (0)
Back to top