* types (or if the type is a non-variable type, like {@code String}), then code should almost
   * never use this method, preferring instead to call {@code requireNonNull} so as to benefit from
   * its runtime check.
   *
   * <p>An example use case for this method is in implementing an {@code Iterator<T>} whose {@code

   * types (or if the type is a non-variable type, like {@code String}), then code should almost
   * never use this method, preferring instead to call {@code requireNonNull} so as to benefit from
   * its runtime check.
   *
   * <p>An example use case for this method is in implementing an {@code Iterator<T>} whose {@code

        mockPipeIn.lock = new Object();

        byte[] buffer = new byte[10];
        int bufferIndex = 0;
        int len = 10;

        // Call the method to be tested
        int result = response.readDataWireFormat(buffer, bufferIndex, len);

        // Verify the result
        assertEquals(len, result, "readDataWireFormat should return the length of data read.");

    address: Address,
    routeDatabase: RouteDatabase = this.routeDatabase,
    fastFallback: Boolean = false,
    call: RealCall = this.call,
  ): RouteSelector =
    RouteSelector(
      address = address,
      routeDatabase = routeDatabase,
      fastFallback = fastFallback,
      call = call,
    )

  companion object {
    private const val PROXY_A_PORT = 1001
    private const val PROXY_A_HOST = "proxya"

const maxInt = int(^uint(0) >> 1)

// Bytes returns a slice of length b.Len() holding the unread portion of the buffer.
// The slice is valid for use only until the next buffer modification (that is,
// only until the next call to a method like [Buffer.Read], [Buffer.Write], [Buffer.Reset], or [Buffer.Truncate]).
// The slice aliases the buffer content at least until the next buffer modification,

    return incidentEdges();
  }

  @Override
  public Set<E> outEdges() {
    return incidentEdges();
  }

  @Override
  public N adjacentNode(E edge) {
    // We're relying on callers to call this method only with an edge that's in the graph.
    return requireNonNull(incidentEdgeMap.get(edge));
  }

  @Override
  public @Nullable N removeInEdge(E edge, boolean isSelfLoop) {
    if (!isSelfLoop) {

     */
    List<FileNotifyInformation> watch() throws CIFSException;

    /**
     * {@inheritDoc}
     *
     * @see java.util.concurrent.Callable#call()
     */
    @Override
    List<FileNotifyInformation> call() throws CIFSException;

    /**
     * {@inheritDoc}
     *
     * @see java.lang.AutoCloseable#close()
     */
    @Override
    void close() throws CIFSException;

    }

    @Test
    void encode_shouldCallEncNdrLongWithCorrectValue() throws NdrException {
        int testValue = 98765;
        NdrLong ndrLong = new NdrLong(testValue);

        // Call the encode method
        ndrLong.encode(mockNdrBuffer);

        // Verify that enc_ndr_long was called exactly once with the correct value
        verify(mockNdrBuffer, times(1)).enc_ndr_long(testValue);

   * the {@link ByteSource} returned by {@link #asByteSource} is garbage collected. Prefer to {@link
   * #reset} the stream explicitly, rather than rely on garbage collection: If you call {@link
   * #reset} explicitly, you can call it more promptly, and you can appropriately handle any
   * exception that results.
   *
   * @param fileThreshold the number of bytes before the stream should switch to buffering to a file

  }

  public void testAwaitTimeoutMultiInterruptExpired() {
    /*
     * We don't "need" to schedule a countDown() call at all here, but by doing
     * so, we come the closest we can to testing that the wait time is
     * appropriately decreased on each progressive await() call.
     */
    TimedLatch latch = new TimedLatch(/* countdownInMillis= */ LONG_DELAY_MS);
    repeatedlyInterruptTestThread(tearDownStack);