// Only proceed for local endpoints
				network[nodeName] = string(madmin.ItemOnline)
				continue
			}
			_, present := network[nodeName]
			if !present {
				if err := isServerResolvable(endpoint, 5*time.Second); err == nil {
					network[nodeName] = string(madmin.ItemOnline)
				} else {
					if xnet.IsNetworkOrHostDown(err, false) {
						network[nodeName] = string(madmin.ItemOffline)

    @Override
    public void clear() {
      backingMap.clear();
    }
  }

  /**
   * {@inheritDoc}
   *
   * <p>The set's iterator traverses the mappings for the first row, the mappings for the second
   * row, and so on.
   *
   * <p>Each cell is an immutable snapshot of a row key / column key / value mapping, taken at the
   * time the cell is returned by a method call to the set or its iterator.
   */

 *
 * Regular lines contain fields separated by semicolons.
 *
 * The first element on each line is a single hex code point (like 0041) or a hex code point range
 * (like 0030..0039).
 *
 * The second element on each line is a mapping type, like `valid` or `mapped`.
 *
 * For lines that contain a mapping target, the next thing is a sequence of hex code points (like
 * 0031 2044 0034).
 *
 * All other data is ignored.

   * </pre>
   *
   * @throws IllegalArgumentException if there is a loop in the causal chain
   */
  public static Throwable getRootCause(Throwable throwable) {
    // Keep a second pointer that slowly walks the causal chain. If the fast pointer ever catches
    // the slower pointer, then there's a loop.
    Throwable slowPointer = throwable;
    boolean advanceSlowPointer = false;

        } else if (mod == 2) {
            encode1pad(inData, num * 3, outData, num * 4);
        }
        return new String(outData);
    }

    /**
     * Decodes data encoded in Base64.
     *
     * @param inData
     *            The data to decode
     * @return The decoded data
     */
    public static byte[] decode(final String inData) {

## Version 2.5.0

_2015-08-25_

 *  **Timeouts now default to 10 seconds.** Previously we defaulted to never
    timing out, and that was a lousy policy. If establishing a connection,
    reading the next byte from a connection, or writing the next byte to a
    connection takes more than 10 seconds to complete, you’ll need to adjust
    the timeouts manually.

        assertEquals(3, dst[1] & 0xFF, "Data length low byte");
        assertEquals(0, dst[2] & 0xFF, "Data length high byte");
        assertEquals(2, dst[3], "First data byte");
        assertEquals(3, dst[4], "Second data byte");
        assertEquals(4, dst[5], "Third data byte");
    }

    /**
     * Test readParameterWordsWireFormat always returns 0
     */
    @Test

    //    were added to the queue. It's easily possible for one thread to take the head of the
    //    queue, immediately followed by another thread taking the next element in the queue. That
    //    second thread can then dispatch to the subscriber it took before the first thread does.
    //
    // All this makes me really wonder if there's any value in queueing here at all. A dispatcher

        request = new Smb2CreateRequest(mockConfig, "initial\\path.txt");
        assertEquals("\\initial\\path.txt", request.getPath());

        request.setPath("\\second\\path.txt");
        assertEquals("\\second\\path.txt", request.getPath());

        request.setPath("third\\path\\");
        assertEquals("\\third\\path", request.getPath());

        }

        @Test
        @DisplayName("Binary constructor with invalid sub_authority_count throws RuntimeCIFSException")
        void testBinaryConstructorInvalidCount() {
            // Arrange: second byte is sub_authority_count > 100
            byte[] bytes = new byte[1 + 1 + 6];
            bytes[0] = 1; // revision
            bytes[1] = (byte) 101; // invalid count

            // Act + Assert