import org.jspecify.annotations.Nullable;

/**
 * Executor ensuring that all Runnables submitted are executed in order, using the provided
 * Executor, and sequentially such that no two will ever be running at the same time.
 *
 * <p>Tasks submitted to {@link #execute(Runnable)} are executed in FIFO order.
 *
 * <p>The execution of tasks is done by one thread as long as there are tasks left in the queue.

    // Because we happen to use the same formula. If that changes, just don't override this.
    @Override
    public int hashCode() {
      return parent.hashCode();
    }

    @Override
    public String toString() {
      return parent.toString();
    }
  }

  /**
   * Returns {@code true} if {@code object} is an {@code ImmutableDoubleArray} containing the same

    }

    // Because we happen to use the same formula. If that changes, just don't override this.
    @Override
    public int hashCode() {
      return parent.hashCode();
    }

    @Override
    public String toString() {
      return parent.toString();
    }
  }

  /**
   * Returns {@code true} if {@code object} is an {@code ImmutableIntArray} containing the same
   * values as this one, in the same order.

        // Given - Use same key for both encryption and decryption in test
        // In production, client would use clientEncKey/serverDecKey and server would use serverEncKey/clientDecKey
        Smb2EncryptionContext context = new Smb2EncryptionContext(EncryptionNegotiateContext.CIPHER_AES128_GCM, DialectVersion.SMB311,
                testEncryptionKey, testEncryptionKey); // Use same key for test

   *   {@code List<ListenableFuture<T>> futures = (List) executor.invokeAll(tasks);}
   * </pre>
   *
   * @return A list of {@code ListenableFuture} instances representing the tasks, in the same
   *     sequential order as produced by the iterator for the given task list, each of which has
   *     completed.
   * @throws RejectedExecutionException {@inheritDoc}
   * @throws NullPointerException if any task is null

    @Weak @Nullable Node<K, V> previous; // the previous node (with any key)
    @Nullable Node<K, V> nextSibling; // the next node with the same key
    @Weak @Nullable Node<K, V> previousSibling; // the previous node with the same key

    Node(@ParametricNullness K key, @ParametricNullness V value) {
      super(key, value);
    }
  }

        assertNotNull(result, "Unwrapped tree should not be null");
        assertSame(customTree, result, "Should return the same custom tree instance");
        verify(smbTree).unwrap(CustomSmbTree.class);
    }

    /**
     * Test for unwrap() method with the same type.
     * Verifies that unwrap can return itself when the type matches.
     */
    @Test
    void testUnwrap_withSameType() {

     * If either or both arrays are {@literal null}, the other array is returned as is.
     * If either or both arrays have a length of {@literal 0}, the other array is returned as is.
     * In any case, the returned array is the same instance as the argument array and is not copied.
     * </p>
     *
     * @param <T>
     *            the type of the array elements
     * @param a
     *            first array
     * @param b

 * multiple threads.
 *
 * <p>Because, in general, escaping operates on the code points of a string and not on its
 * individual {@code char} values, it is not safe to assume that {@code escape(s)} is equivalent to
 * {@code escape(s.substring(0, n)) + escape(s.substring(n))} for arbitrary {@code n}. This is
 * because of the possibility of splitting a surrogate pair. The only case in which it is safe to

   - Don’t modify the PR directly (e.g., fixing bugs). Request changes from the submitter or create a follow-up PR.
   - If you edit, you’re a collaborator, not a reviewer, and cannot merge.

6. **Testing**:
   - Assume the submitter tested the code. If testing is unclear, ask for details (e.g., “How was this tested?”).
   - Reject untested PRs unless testing is infeasible, then assist with test setup.

## Tips for Success