// Available returns how many bytes are unused in the buffer.
func (b *Buffer) Available() int { return cap(b.buf) - len(b.buf) }

// Truncate discards all but the first n unread bytes from the buffer
// but continues to use the same allocated storage.
// It panics if n is negative or greater than the length of the buffer.
func (b *Buffer) Truncate(n int) {
	if n == 0 {
		b.Reset()
		return
	}
	b.lastRead = opInvalid

 * collector by only using a constant number of internal objects.
 *
 * <p>If there are no removals, then iteration order for the {@link #entrySet}, {@link #keySet}, and
 * {@link #values} views is the same as insertion order. Any removal invalidates any ordering
 * guarantees.
 *
 * <p>This class should not be assumed to be universally superior to {@code java.util.HashMap}.

  }

  /**
   * Returns a new {@code Future} whose result is asynchronously derived from the result of this
   * {@code Future}. If the input {@code Future} fails, the returned {@code Future} fails with the
   * same exception (and the function is not invoked).
   *
   * <p>More precisely, the returned {@code Future} takes its result from a {@code Future} produced

The idea is for the **FastAPI** community to be kind and welcoming. At the same time, don't accept bullying or disrespectful behavior towards others. We have to take care of each other.

---

Here's how to help others with questions (in discussions or issues):

        // Set a test time using reflection
        long testTime = System.currentTimeMillis();
        setFieldValue(response, "lastWriteTime", testTime);

        // All time methods should return the same converted time
        long expectedTime = testTime + serverTimeZoneOffset;
        assertEquals(expectedTime, response.getCreateTime());
        assertEquals(expectedTime, response.getLastWriteTime());

        String[] roles2 = secured.value();

        // Different array instances should be returned
        assertNotSame(roles1, roles2);

        // But values should be the same
        assertEquals(roles1.length, roles2.length);
        for (int i = 0; i < roles1.length; i++) {
            assertEquals(roles1[i], roles2[i]);
        }
    }

    // Test annotation with duplicate roles

   *     operation
   * @since 21.0
   */
  void removeAll(Iterable<Range<C>> ranges);

  // Object methods

  /**
   * Returns {@code true} if {@code obj} is another {@code RangeSet} that contains the same ranges
   * according to {@link Range#equals(Object)}.
   */
  @Override
  boolean equals(@Nullable Object obj);

  /** Returns {@code asRanges().hashCode()}. */
  @Override
  int hashCode();

    void setup() {
        // Tree handle lifecycle and config
        lenient().when(tree.acquire()).thenReturn(tree);
        lenient().when(tree.isConnected()).thenReturn(true);

        // CIFS context returns same config to build responses during initResponse
        lenient().when(cifsContext.getConfig()).thenReturn(config);
    }

    @AfterEach
    void teardown() {
        // No global state to reset beyond mocks
    }

            // When
            int size = chunk.size();

            // Then
            assertEquals(EXPECTED_SIZE, size);
        }

        @ParameterizedTest
        @DisplayName("Should return same size regardless of values")
        @CsvSource({ "0, 0, 0", "1024, 2048, 4096", "9223372036854775807, 9223372036854775807, 2147483647", "-1, -1, -1" })
        void testSizeIsConstant(long sourceOffset, long targetOffset, int length) {

    assertThat(UnsignedLongs.compare(0x5a4316b8c153ac4dL, 0x6cf78a4b139a4e2aL)).isLessThan(0);
    assertThat(UnsignedLongs.compare(0x6cf78a4b139a4e2aL, 0x5a4316b8c153ac4dL)).isGreaterThan(0);

    // same value
    assertThat(UnsignedLongs.compare(0xff1a618b7f65ea12L, 0xff1a618b7f65ea12L)).isEqualTo(0);
  }

  public void testMax_noArgs() {
    assertThrows(IllegalArgumentException.class, () -> max());
  }