this.clock_seq_low = uuid.clock_seq_low;
        this.node = new byte[6];
        this.node[0] = uuid.node[0];
        this.node[1] = uuid.node[1];
        this.node[2] = uuid.node[2];
        this.node[3] = uuid.node[3];
        this.node[4] = uuid.node[4];
        this.node[5] = uuid.node[5];
    }

    /**
     * Construct a UUID from string
     *
     * @param str

        clock_seq_hi_and_reserved = uuid.clock_seq_hi_and_reserved;
        clock_seq_low = uuid.clock_seq_low;
        node = new byte[6];
        node[0] = uuid.node[0];
        node[1] = uuid.node[1];
        node[2] = uuid.node[2];
        node[3] = uuid.node[3];
        node[4] = uuid.node[4];
        node[5] = uuid.node[5];
    }

    /**
     * Constructs a UUID from a string representation
     *

            // Node array will be partially filled
            assertEquals((byte) 0xAA, uuid.node[0]);
            assertEquals((byte) 0xBB, uuid.node[1]);
            assertEquals((byte) 0xCC, uuid.node[2]);
            assertEquals((byte) 0xDD, uuid.node[3]);
            assertEquals((byte) 0xEE, uuid.node[4]);
            assertEquals((byte) 0x00, uuid.node[5]); // Missing data defaults to 0
        }

        bb.position(54);
        String altPath = "\\\\alt\\path";
        bb.put(altPath.getBytes(StandardCharsets.UTF_16LE));
        bb.putShort((short) 0);

        // Node string at offset 76
        bb.position(76);
        String node = "NODE01";
        bb.put(node.getBytes(StandardCharsets.UTF_16LE));
        bb.putShort((short) 0);

        // Decode
        int decodedSize = referral.decode(testBuffer, 0, testBuffer.length);

        }

        /**
         * Get the source node for move operations
         *
         * @return source node name
         */
        public String getSourceNode() {
            return sourceNode;
        }

        /**
         * Sets the source node for move operations.
         *
         * @param sourceNode the name of the source node in a share move operation
         */

   */
  private void removeNode(Node<K, V> node) {
    if (node.previous != null) {
      node.previous.next = node.next;
    } else { // node was head
      head = node.next;
    }
    if (node.next != null) {
      node.next.previous = node.previous;
    } else { // node was tail
      tail = node.previous;
    }
    if (node.previousSibling == null && node.nextSibling == null) {
      /*

| `minio_node_mem_available`     | Available memory on the node.             |
| `minio_node_mem_available_avg` | Available memory on the node (avg).       |
| `minio_node_mem_available_max` | Available memory on the node (max).       |
| `minio_node_mem_buffers`       | Buffers memory on the node.               |
| `minio_node_mem_buffers_avg`   | Buffers memory on the node (avg).         |

   *
   * <p>For directed networks, this is equal to {@code inDegree(node) + outDegree(node)}.
   *
   * <p>For undirected networks, this is equal to {@code incidentEdges(node).size()} + (number of
   * self-loops incident to {@code node}).
   *
   * <p>If the count is greater than {@code Integer.MAX_VALUE}, returns {@code Integer.MAX_VALUE}.
   *

### Node Binaries

filename | sha512 hash
-------- | -----------
[kubernetes-node-linux-amd64.tar.gz](https://dl.k8s.io/v1.33.4/kubernetes-node-linux-amd64.tar.gz) | f8735d12b7f95bd400834d0d90e76e08f47db117b963073566766e1c530810a8f032b6c771b243f0c538f34a30fe9da5f3ba77e6396f0b00a254a37b1c3ea6c1

### Node Binaries

filename | sha512 hash
-------- | -----------
[kubernetes-node-linux-amd64.tar.gz](https://dl.k8s.io/v1.31.12/kubernetes-node-linux-amd64.tar.gz) | 17e6290eb983b623fb61e7707cfde4ad57d181372e10a400001bacceb07c35739c5e7d51d521f5bf5776d4fe15786b09ad0a7d37b26197fdaf4cea293f20b88f