/**
   * Pointer to the predecessor of an entry in insertion order. ENDPOINT indicates a node is the
   * first node in insertion order; all values at indices ≥ {@link #size()} are UNSET.
   */
  private transient int @Nullable [] predecessor;

  /**
   * Pointer to the successor of an entry in insertion order. ENDPOINT indicates a node is the last
   * node in insertion order; all values at indices ≥ {@link #size()} are UNSET.
   */

  /**
   * Pointer to the predecessor of an entry in insertion order. ENDPOINT indicates a node is the
   * first node in insertion order; all values at indices ≥ {@link #size()} are UNSET.
   */
  private transient int @Nullable [] predecessor;

  /**
   * Pointer to the successor of an entry in insertion order. ENDPOINT indicates a node is the last
   * node in insertion order; all values at indices ≥ {@link #size()} are UNSET.
   */

     *
     * <p>Since the last element of the array is actually in the middle of the sorted structure, a
     * childless aunt node could be smaller, which would corrupt the invariant if this element
     * becomes the new parent of the aunt node. In that case, we first switch the last element with
     * its aunt node, before returning.
     */
    int swapWithConceptuallyLastElement(E actualLastElement) {

    - [Server Binaries](#server-binaries-9)
    - [Node Binaries](#node-binaries-9)
    - [Container Images](#container-images-9)
  - [Changelog since v1.31.4](#changelog-since-v1314)
  - [Important Security Information](#important-security-information-2)
    - [CVE-2024-9042: Command Injection affecting Windows nodes via nodes/*/logs/query API](#cve-2024-9042-command-injection-affecting-windows-nodes-via-nodeslogsquery-api)

   * all "null" (UNSET).
   *
   * <p>A node with "prev" pointer equal to {@code ENDPOINT} is the first node in the linked list,
   * and a node with "next" pointer equal to {@code ENDPOINT} is the last node.
   */
  @VisibleForTesting transient long @Nullable [] links;

  /** Pointer to the first node in the linked list, or {@code ENDPOINT} if there are no entries. */
  private transient int firstEntry;

    return Graphs.transitiveClosure(graph);
  }

  @SuppressWarnings("PreferredInterfaceType")
  public static <N> Set<N> reachableNodes(Graph<N> graph, N node) {
    return Graphs.reachableNodes(graph, node);
  }

	/* dce */

	typedef struct {
	    uint32_t time_low;
	    uint16_t time_mid;
	    uint16_t time_hi_and_version;
	    uint8_t clock_seq_hi_and_reserved;
	    uint8_t clock_seq_low;
	    uint8_t node[6];
	} uuid_t;

	/* win32 stuff */

	typedef struct {
		uint32_t type;
		uuid_t uuid;
	} policy_handle;

	/*
	 * typedef struct _UNICODE_STRING
	 *     USHORT Length;

	/* dce */

	typedef struct {
	    uint32_t time_low;
	    uint16_t time_mid;
	    uint16_t time_hi_and_version;
	    uint8_t clock_seq_hi_and_reserved;
	    uint8_t clock_seq_low;
	    uint8_t node[6];
	} uuid_t;

	/* win32 stuff */

	typedef struct {
		uint32_t type;
		uuid_t uuid;
	} policy_handle;

	/*
	 * typedef struct _UNICODE_STRING
	 *     USHORT Length;

        assertThrows(Exception.class, () -> {
            new NameServiceClientImpl(null);
        }, "Should throw exception for null context");
    }

    @Test
    @DisplayName("Should handle node status for mock address with timeout")
    @Timeout(value = 2, unit = TimeUnit.SECONDS) // Force test timeout
    void testGetNodeStatus() throws UnknownHostException {
        // Given

  PRIVATE(':', ','),
  /** Public suffix that is backed by an ICANN-style domain name registry */
  REGISTRY('!', '?');

  /** The character used for an inner node in the trie encoding */
  private final char innerNodeCode;

  /** The character used for a leaf node in the trie encoding */
  private final char leafNodeCode;

  PublicSuffixType(char innerNodeCode, char leafNodeCode) {
    this.innerNodeCode = innerNodeCode;