* @param th the tree handle
     * @param first the first request to execute
     * @param others additional requests to chain
     * @return the response from the first request
     * @throws CIFSException if an error occurs
     */
    protected <T extends ServerMessageBlock2Response> T withOpen(final SmbTreeHandleImpl th, final ServerMessageBlock2Request<T> first,

   * are all "null" (UNSET).
   *
   * <p>A node with "prev" pointer equal to {@code ENDPOINT} is the first node in the linked list,
   * and a node with "nextEntry" pointer equal to {@code ENDPOINT} is the last node.
   */
  @VisibleForTesting transient long[] links;

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

        UniAddress ua = new UniAddress(addr);
        // Act: first call should set to SMBSERVER_NAME
        String initial = ua.firstCalledName();
        // verify that subsequent call gives SMBSERVER_NAME
        String next = ua.nextCalledName();
        // Assert
        assertEquals(NbtAddress.SMBSERVER_NAME, next, "nextCalledName should return SMBSERVER_NAME after first call");
    }

    @Test

                return true;
            }
        }
        return false;
    }

    /**
     * Gets the first AV pair of the specified type from the list
     *
     * @param pairs the list of AV pairs to search
     * @param type the AV pair type to retrieve
     * @return first occurance of the given type
     */
    public static AvPair get(final List<AvPair> pairs, final int type) {

# Development - Contributing

First, you might want to see the basic ways to [help FastAPI and get help](help-fastapi.md){.internal-link target=_blank}.

## Developing

If you already cloned the <a href="https://github.com/fastapi/fastapi" class="external-link" target="_blank">fastapi repository</a> and you want to deep dive in the code, here are some guidelines to set up your environment.

### Virtual environment

   * - Both request discover no existing connection. They both make a connection.
   * - The first request "wins the race".
   * - The second request discovers it "lost the race" and closes the connection it just opened.
   * - The second request uses the coalesced connection from request1.
   * - The coalesced connection is violently closed after servicing the first request.

        // Pick the first known protocol the peer advertises.
        for (i in 0..peerProtocols.size) {
          val protocol = peerProtocols[i] as String
          if (protocol in protocols) {
            selected = protocol
            return selected
          }
        }
        selected = protocols[0] // On no intersection, try peer's first protocol.
        return selected

    bufferHelper("no newlines at all", "no newlines at all");
    bufferHelper("two lines\nbut no newline at end", "two lines\n", "but no newline at end");
    bufferHelper(
        "\nempty first line\nno newline at end", "\n", "empty first line\n", "no newline at end");
    bufferHelper("three\rlines\rno newline at end", "three\r", "lines\r", "no newline at end");
    bufferHelper("mixed\nline\rendings\r\n", "mixed\n", "line\r", "endings\r\n");

    bufferHelper("no newlines at all", "no newlines at all");
    bufferHelper("two lines\nbut no newline at end", "two lines\n", "but no newline at end");
    bufferHelper(
        "\nempty first line\nno newline at end", "\n", "empty first line\n", "no newline at end");
    bufferHelper("three\rlines\rno newline at end", "three\r", "lines\r", "no newline at end");
    bufferHelper("mixed\nline\rendings\r\n", "mixed\n", "line\r", "endings\r\n");

    }

    @Test
    @DisplayName("Messages: array is present and contains expected first entries")
    void dosErrorMessagesContainsExpectedTexts() {
        // Arrange & Act
        String[] msgs = DosError.DOS_ERROR_MESSAGES;

        // Assert
        assertNotNull(msgs);
        assertTrue(msgs.length >= 3, "Expect at least the first 3 entries present");
        assertEquals("The operation completed successfully.", msgs[0]);