// linked list starting from `newTable`. In general, each element from the old linked list
      // belongs to a different linked list from `newTable`. We insert each element in turn at the
      // head of its appropriate `newTable` linked list.
      while (oldNext != UNSET) {
        int entryIndex = oldNext - 1;
        int oldEntry = entries[entryIndex];

   */
  private transient int @Nullable [] successor;

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

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

  CompactLinkedHashSet() {}

   */
  private transient int @Nullable [] successor;

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

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

  CompactLinkedHashSet() {}

/**
 * Base interface for service operation results in Maven. This interface defines the common contract
 * for operation results, providing access to the original request that generated this result.
 *
 * <p>Each result is linked to its originating {@link Request}, allowing for:
 * <ul>
 *   <li>Traceability between requests and their outcomes</li>
 *   <li>Access to the session context used during processing</li>

## Compiler {#compiler}

## Assembler {#assembler}

    }

    /**
     * Tests the append method of the DfsReferral class.
     * It verifies that a new DfsReferral object can be successfully appended to an existing one,
     * forming a linked list structure.
     */
    @Test
    void testAppend() {
        // Given
        DfsReferral initialReferral = new DfsReferral();
        DfsReferral appendedReferral = new DfsReferral();

        // When

	-o file
		Write output to file. The default is foo.o for /a/b/c/foo.s.
	-p pkgpath
		Set expected package import to pkgpath.
	-shared
		Generate code that can be linked into a shared library.
	-spectre list
		Enable spectre mitigations in list (all, ret).
	-trimpath prefix
		Remove prefix from recorded source file paths.
	-v
		Print debug output.

Input language:

            // Find the end of the issues list: the first non-list line after the intro
            val listEnd = findEndOfListSection(content, afterIntro)
            content.substring(0, introStart) + newSection + "\n" + content.substring(listEnd)
        } else {
            newSection + "\n" + content
        }

        notesFile.writeText(newContent)

    /**
     * Resets this response to its initial state.
     */
    void reset();

    /**
     * Gets the exception associated with this response.
     *
     * @return an exception linked to an error
     */
    Exception getException();

    /**
     * Sets an exception for this response.
     *
     * @param e the exception to set
     */
    void exception(Exception e);

    result.putAll(multimap);
    return result;
  }

  /**
   * LinkedHashMultimap entries are in no less than three coexisting linked lists: a bucket in the
   * hash table for a {@code Set<V>} associated with a key, the linked list of insertion-ordered
   * entries in that {@code Set<V>}, and the linked list of entries in the LinkedHashMultimap as a
   * whole.
   */
  @VisibleForTesting