Search Options

Results per page
Sort
Preferred Languages
Advance

Results 151 - 160 of 373 for Nodes (0.03 sec)

  1. android/guava-tests/test/com/google/common/util/concurrent/CycleDetectingLockFactoryTest.java

        lock02 = factory3.newReentrantLock(OtherOrder.SECOND);
        lock03 = factory3.newReentrantLock(OtherOrder.THIRD);
      }
    
      // In the unittest, create each ordered factory with its own set of lock
      // graph nodes (as opposed to using the static per-Enum map) to avoid
      // conflicts across different test runs.
      private <E extends Enum<E>>
          CycleDetectingLockFactory.WithExplicitOrdering<E> newInstanceWithExplicitOrdering(
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Thu Dec 19 18:03:30 UTC 2024
    - 16.2K bytes
    - Viewed (0)
  2. guava-tests/test/com/google/common/util/concurrent/CycleDetectingLockFactoryTest.java

        lock02 = factory3.newReentrantLock(OtherOrder.SECOND);
        lock03 = factory3.newReentrantLock(OtherOrder.THIRD);
      }
    
      // In the unittest, create each ordered factory with its own set of lock
      // graph nodes (as opposed to using the static per-Enum map) to avoid
      // conflicts across different test runs.
      private <E extends Enum<E>>
          CycleDetectingLockFactory.WithExplicitOrdering<E> newInstanceWithExplicitOrdering(
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Thu Dec 19 18:03:30 UTC 2024
    - 16.2K bytes
    - Viewed (0)
  3. android/guava-tests/test/com/google/common/graph/TraverserTest.java

      }
    
      /**
       * Checks that the elements of the iterable are calculated on the fly. Concretely, that means that
       * {@link SuccessorsFunction#successors(Object)} can only be called for a subset of all nodes.
       */
      @Test
      public void forGraph_breadthFirstIterable_emptyGraph() {
        assertEqualCharNodes(
            Traverser.forGraph(createDirectedGraph()).breadthFirst(charactersOf("")), "");
        assertThrows(
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Tue May 13 18:46:00 UTC 2025
    - 47.5K bytes
    - Viewed (0)
  4. guava-tests/test/com/google/common/graph/TraverserTest.java

      }
    
      /**
       * Checks that the elements of the iterable are calculated on the fly. Concretely, that means that
       * {@link SuccessorsFunction#successors(Object)} can only be called for a subset of all nodes.
       */
      @Test
      public void forGraph_breadthFirstIterable_emptyGraph() {
        assertEqualCharNodes(
            Traverser.forGraph(createDirectedGraph()).breadthFirst(charactersOf("")), "");
        assertThrows(
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Tue May 13 18:46:00 UTC 2025
    - 47.5K bytes
    - Viewed (0)
  5. cmd/server-main.go

      3. Start distributed MinIO server on an 32 node setup with 32 drives each, run following command on all the nodes
         {{.Prompt}} {{.HelpName}} http://node{1...32}.example.com/mnt/export{1...32}
    
      4. Start distributed MinIO server in an expanded setup, run the following command on all the nodes
         {{.Prompt}} {{.HelpName}} http://node{1...16}.example.com/mnt/export{1...32} \
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Tue May 27 15:18:36 UTC 2025
    - 35.9K bytes
    - Viewed (4)
  6. cmd/tier.go

    	r := rand.New(rand.NewSource(time.Now().UnixNano()))
    	randInterval := func() time.Duration {
    		return time.Duration(r.Float64() * 5 * float64(time.Second))
    	}
    
    	// To avoid all MinIO nodes reading the tier config object at the same
    	// time.
    	t := time.NewTimer(tierCfgRefresh + randInterval())
    	defer t.Stop()
    	for {
    		select {
    		case <-ctx.Done():
    			return
    		case <-t.C:
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Fri Aug 29 02:39:48 UTC 2025
    - 15.6K bytes
    - Viewed (0)
  7. CHANGELOG/CHANGELOG-1.4.md

        * Change eviction policies in NodeController:
          *  add a "partialDisruption" mode, when more than 33% of Nodes in the zone are not Ready
          *  add "fullDisruption" mode, when all Nodes in the zone are not Ready
        * Eviction behavior depends on the mode in which NodeController is operating:
    Registered: Fri Sep 05 09:05:11 UTC 2025
    - Last Modified: Thu Dec 24 02:28:26 UTC 2020
    - 133.5K bytes
    - Viewed (0)
  8. src/main/java/jcifs/smb1/netbios/NbtAddress.java

        /**
         * Determines the address of a host given it's host name. NetBIOS
         * names also have a <code>type</code>. Types(aka Hex Codes)
         * are used to distiquish the various services on a host. <a
         * href="../../../nbtcodes.html">Here</a> is
         * a fairly complete list of NetBIOS hex codes. Scope is not used but is
         * still functional in other NetBIOS products and so for completeness it has been
    Registered: Sun Sep 07 00:10:21 UTC 2025
    - Last Modified: Sat Aug 16 01:32:48 UTC 2025
    - 31.7K bytes
    - Viewed (0)
  9. README.md

    - For installations using Systemd MinIO service, upgrade via RPM/DEB packages **parallelly** on all servers or replace the binary lets say `/opt/bin/minio` on all nodes, apply executable permissions `chmod +x /opt/bin/minio` and process to perform `mc admin service restart alias/`.
    
    ### Upgrade Checklist
    
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Tue Aug 12 18:20:36 UTC 2025
    - 18.7K bytes
    - Viewed (0)
  10. src/main/webapp/js/admin/popper.min.js.map

    range.setEnd(end, 0);\n  const { commonAncestorContainer } = range;\n\n  // Both nodes are inside #document\n  if (\n    (element1 !== commonAncestorContainer &&\n      element2 !== commonAncestorContainer) ||\n    start.contains(end)\n  ) {\n    if (isOffsetContainer(commonAncestorContainer)) {\n      return commonAncestorContainer;\n    }\n\n    return getOffsetParent(commonAncestorContainer);\n  }\n\n  // one of the nodes is inside shadowDOM, find which one\n  const element1root = getRoot(element1);\n...
    Registered: Thu Sep 04 12:52:25 UTC 2025
    - Last Modified: Sat Oct 26 01:49:09 UTC 2024
    - 120.9K bytes
    - Viewed (0)
Back to top