/**
   * 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,

    /**
     *
     */
    private static final long serialVersionUID = 7621650016319792189L;
    /**
     * Error message for null reference pointers.
     */
    public static final String NO_NULL_REF = "ref pointer cannot be null";

    /**
     * Error message for invalid array conformance.
     */
    public static final String INVALID_CONFORMANCE = "invalid array conformance";

    /**

 * RegularImmutableBiMap}, which don't have to recopy the entries created by their {@code Builder}
 * implementations.
 *
 * <p>This base implementation has no key or value pointers, so instances of ImmutableMapEntry (but
 * not its subclasses) can be reused when copied from one ImmutableMap to another.
 *
 * @author Louis Wasserman
 */
@GwtIncompatible // unnecessary

 * Exception thrown when an error occurs during NDR encoding or decoding operations.
 */
public class NdrException extends IOException {

    /**
     * Error message for null reference pointers.
     */
    public static final String NO_NULL_REF = "ref pointer cannot be null";

    /**
     * Error message for invalid array conformance.
     */
    public static final String INVALID_CONFORMANCE = "invalid array conformance";

    /**

          // Skip the elements larger than the partition.
          do {
            high--;
          } while (array[high] > partition);
          if (high < low) {
            break; // Pointers crossed. Partitioning complete.
          }
          swap(array, low, high); // End of innermost loop.
        }
        array[from + 1] = array[high]; // Insert partitioning element.
        array[high] = partition;

    // drop the contract on the method that enforces this queue like behavior since depending on it
    // is likely to be a bug anyway.

    // N.B. All writes to the list and the next pointers must have happened before the above
    // synchronized block, so we can iterate the list without the lock held here.
    RunnableExecutorPair reversedList = null;
    while (list != null) {

    /**
     * Get the server this referral points to
     *
     * @return the server this referral points to
     */
    String getServer();

    /**
     * Get the domain this referral is for
     *
     * @return the domain this referral is for
     */
    String getDomain();

    /**
     * Get the share this referral points to
     *
     * @return the share this referral points to

        assertArrayEquals(new byte[] { 10, 20, 30, 40, 50 }, buffer);
        // Note: There appears to be a bug in the implementation where readFully
        // incorrectly updates the file pointer twice
        assertEquals(10, smbRandomAccessFile.getFilePointer());
    }

     * @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

    @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.");