return this.addr.hashCode();
    }

    /**
     * Compare two addresses for equality. Two <code>UniAddress</code>s are equal
     * if they are both <code>UniAddress</code>' and refer to the same IP address.
     */
    @Override
    public boolean equals(final Object obj) {
        return obj instanceof UniAddress && this.addr.equals(((UniAddress) obj).addr);
    }

    /**

        URLStreamHandler handler1 = cifsContextWrapper.getUrlHandler();
        assertNotNull(handler1);
        assertTrue(handler1 instanceof Handler);

        // Second call should return the same instance
        URLStreamHandler handler2 = cifsContextWrapper.getUrlHandler();
        assertEquals(handler1, handler2);
    }

    @Test
    void testGetSIDResolver() {
        // Test getSIDResolver() method

                () -> assertEquals(2184, WinError.ERROR_SERVICE_NOT_INSTALLED),
                () -> assertEquals(6118, WinError.ERROR_NO_BROWSER_SERVERS_FOUND));
    }

    @Test
    @DisplayName("Arrays: non-null, same length, and exact contents")
    void arrays_are_well_formed_and_match() {
        // Validate arrays existence and alignment (edge and structure checks)
        assertNotNull(WinError.WINERR_CODES, "WINERR_CODES should not be null");

        byte[] buffer1 = BufferCache.getBuffer();
        buffer1[0] = (byte) 0xAB;
        buffer1[1] = (byte) 0xCD;
        BufferCache.releaseBuffer(buffer1);

        // When - Get another buffer (might be the same one from cache)
        byte[] buffer2 = BufferCache.getBuffer();

        // Then - Buffer should be valid
        assertNotNull(buffer2, "Reused buffer should not be null");

     * The returned list may contain a mix of Java class path, Java module path, and other types of path elements.
     * This collection has the same content as {@code getDependencies.values()} except that it does not contain
     * null elements.
     *
     * @return the paths of all dependencies
     */
    @Nonnull
    List<Path> getPaths();

    /**

    // Compute the hash table.
    char[] table = new char[chooseTableSize(size)];
    int mask = table.length - 1;
    for (int c = chars.nextSetBit(0); c != -1; c = chars.nextSetBit(c + 1)) {
      // Compute the filter at the same time.
      filter |= 1L << c;
      int index = smear(c) & mask;
      while (true) {
        // Check for empty.
        if (table[index] == 0) {
          table[index] = (char) c;
          break;
        }

  }

  public void testFutureCancellableBeforeFunctionCompletion() throws Exception {
    // Set the result in a separate thread since this test runs the function
    // (which will block) in the same thread.
    new Thread() {
      @Override
      public void run() {
        inputFuture.set(SLOW_FUNC_VALID_INPUT_DATA);
      }
    }.start();
    funcIsWaitingLatch.await();

  /**
   * Returns all nodes in this graph adjacent to {@code node} which can be reached by traversing
   * {@code node}'s outgoing edges in the direction (if any) of the edge.
   *
   * <p>This is <i>not</i> the same as "all nodes reachable from {@code node} by following outgoing
   * edges". For that functionality, see {@link Graphs#reachableNodes(Graph, Object)}.
   *

  }

  public void testFutureCancellableBeforeFunctionCompletion() throws Exception {
    // Set the result in a separate thread since this test runs the function
    // (which will block) in the same thread.
    new Thread() {
      @Override
      public void run() {
        inputFuture.set(SLOW_FUNC_VALID_INPUT_DATA);
      }
    }.start();
    funcIsWaitingLatch.await();

        SmbTreeHandleInternal t2 = handle.ensureTreeConnected();

        // Assert
        assertSame(tree, t1, "First acquire returns provided tree");
        assertSame(tree, t2, "Subsequent acquire returns same tree instance");
        verify(pipe, times(1)).ensureTreeConnected();
        verify(tree, times(2)).acquire();
    }

    @Test
    @DisplayName("getInput/getOutput return cached streams when open; throw when closed")