assertEquals(expected, actual, "createDisposition should match");
        }
    }

    @Test
    @DisplayName("CreateOptions default padding")
    void createOptionsAddedWhenLow() {
        // createOptions less than 0x0001 (i.e., 0) should be padded with 0x0040
        SmbComNTCreateAndX req = createRequest(0, 0);
        int actual = (int) getPrivateField(req, "createOptions");

    void writeBytesWireFormat_throwsIfInsufficientSpace() {
        // Arrange
        Smb2LogoffRequest req = newRequest();
        byte[] tiny = new byte[3]; // less than 4 bytes available

        // Act/Assert
        assertThrows(ArrayIndexOutOfBoundsException.class, () -> req.writeBytesWireFormat(tiny, 0));
    }

    @Test

Також можна оголошувати числові перевірки:

* `gt`: `g`reater `t`han (більше ніж)
* `ge`: `g`reater than or `e`qual (більше або дорівнює)
* `lt`: `l`ess `t`han (менше ніж)
* `le`: `l`ess than or `e`qual (менше або дорівнює)

/// info | Інформація

`Query`, `Path` та інші класи, які Ви побачите пізніше, є підкласами спільного класу `Param`.

   * Math#min(float, float)}.
   *
   * @param array a <i>nonempty</i> array of {@code float} values
   * @return the value present in {@code array} that is less than or equal to every other value in
   *     the array
   * @throws IllegalArgumentException if {@code array} is empty
   */
  @GwtIncompatible(

	return getFileInfoVersions(e.metadata, bucket, e.name, true)
}

// metaCacheEntries is a slice of metacache entries.
type metaCacheEntries []metaCacheEntry

// less function for sorting.
func (m metaCacheEntries) less(i, j int) bool {
	return m[i].name < m[j].name
}

// sort entries by name.
// m is sorted and a sorted metadata object is returned.

                        maximal.remove();
                        break;

                    case LESS_SPECIFIC:
                        // This method is less specific than some of the
                        // currently known maximally specific methods, so we
                        // won't add it into the set of maximally specific
                        // methods

            // Simulate partial copy where not all requested bytes were copied
            byte[] buffer = createValidCopyChunkResponse(3, // Only 3 chunks written (maybe less than requested)
                    65536, // 64KB per chunk
                    196608 // 192KB total (3 * 64KB)
            );

            int bytesDecoded = response.decode(buffer, 0, buffer.length);

   * @param expectedInsertions the number of expected insertions to the constructed {@code
   *     BloomFilter}; must be positive
   * @param fpp the desired false positive probability (must be positive and less than 1.0)
   * @return a {@code Collector} generating a {@code BloomFilter} of the received elements
   * @since 33.4.0 (but since 23.0 in the JRE flavor)
   */

    return CollectCollectors.toImmutableSortedMap(
        comparator, keyFunction, valueFunction, mergeFunction);
  }

  /*
   * TODO(kevinb): Confirm that ImmutableSortedMap is faster to construct and
   * uses less memory than TreeMap; then say so in the class Javadoc.
   */
  private static final Comparator<?> NATURAL_ORDER = Ordering.natural();

  private static final ImmutableSortedMap<Comparable<?>, Object> NATURAL_EMPTY_MAP =

    opcode: Int,
    payload: ByteString,
  ) {
    if (writerClosed) throw IOException("closed")

    val length = payload.size
    require(length <= PAYLOAD_BYTE_MAX) {
      "Payload size must be less than or equal to $PAYLOAD_BYTE_MAX"
    }

    val b0 = B0_FLAG_FIN or opcode
    sinkBuffer.writeByte(b0)

    var b1 = length
    if (isClient) {
      b1 = b1 or B1_FLAG_MASK