*
         * @return the link kind
         */
        Kind kind();

        /**
         * Returns the pointer to the target phase.
         *
         * @return the phase pointer
         */
        Pointer pointer();
    }

    interface Pointer {
        enum Type {
            PROJECT,
            DEPENDENCIES,
            CHILDREN
        }

        /**

     * @param maxLength the maximum allocated length for the string in bytes
     * @param pointer the pointer/offset to the string data
     */
    public PacUnicodeString(final short length, final short maxLength, final int pointer) {
        this.length = length;
        this.maxLength = maxLength;
        this.pointer = pointer;
    }

    /**
     * Gets the actual length of the string in bytes.
     *
     * @return the string length

        }

        // NetName (wide string pointer)
        encodeWideStringPointer(buf, netName);

        // ShareName (wide string pointer, optional)
        encodeWideStringPointer(buf, shareName);

        // IpAddress (wide string pointer, optional)
        encodeWideStringPointer(buf, ipAddress);

        // ClientComputerName (wide string pointer)
        encodeWideStringPointer(buf, clientComputerName);

  /**
   * Contains the link pointers corresponding with the entries, in the range of [0, size()). The
   * high 32 bits of each long is the "prev" pointer, whereas the low 32 bits is the "succ" pointer
   * (pointing to the next entry in the linked list). The pointers in [size(), entries.length) are
   * all "null" (UNSET).
   *
   * <p>A node with "prev" pointer equal to {@code ENDPOINT} is the first node in the linked list,

    @Test
    void testConstructorAndGetters() {
        // Create a new instance with some test data
        short length = 10;
        short maxLength = 20;
        int pointer = 100;
        PacUnicodeString pacString = new PacUnicodeString(length, maxLength, pointer);

        // Verify that the object was created
        assertNotNull(pacString, "The PacUnicodeString object should not be null.");

the toolchain, such as a frame pointer.
The set of pseudo-registers is the same for all architectures:
</p>

<ul>

<li>
<code>FP</code>: Frame pointer: arguments and locals.
</li>

<li>
<code>PC</code>: Program counter:
jumps and branches.
</li>

<li>
<code>SB</code>: Static base pointer: global symbols.
</li>

<li>

                return "after(" + pointer() + ")";
            }
        };
    }

    static Lifecycle.Link children(String phase) {
        return new Lifecycle.Link() {
            @Override
            public Kind kind() {
                return Kind.AFTER;
            }

            @Override
            public Lifecycle.Pointer pointer() {

  /**
   * Contains the link pointers corresponding with the entries, in the range of [0, size()). The
   * high 32 bits of each long is the "prev" pointer, whereas the low 32 bits is the "succ" pointer
   * (pointing to the next entry in the linked list). The pointers in [size(), entries.length) are
   * all "null" (UNSET).
   *
   * <p>A node with "prev" pointer equal to {@code ENDPOINT} is the first node in the linked list,

        when(mockNdrBuffer.dec_ndr_long()).thenReturn(0); // null pointer

        shareInfo0.decode(mockNdrBuffer);

        assertNull(shareInfo0.netname);
        verify(mockNdrBuffer).align(4);
        verify(mockNdrBuffer).dec_ndr_long();
        // Should not decode string if pointer is null
        verify(mockDeferredBuffer, never()).dec_ndr_string();
    }

    @Test

   *
   * <p>Currently, the UNSET value means "null pointer", and any non negative value x is the actual
   * index.
   *
   * <p>Its size must be a power of two.
   */
  private transient int[] table;

  /**
   * Contains the logical entries, in the range of [0, size()). The high 32 bits of each long is the
   * smeared hash of the element, whereas the low 32 bits is the "next" pointer (pointing to the