assertThat(hpackReader!!.headerCount).isEqualTo(1)

    // [  1] (s =  57) :authority: www.example.com
    val entry = hpackReader!!.dynamicTable[readerHeaderTableLength() - 1]!!
    checkEntry(entry, ":authority", "www.example.com", 57)

    // Table size: 57
    assertThat(hpackReader!!.dynamicTableByteCount).isEqualTo(57)

    // Decoded header list:
    assertThat(hpackReader!!.getAndResetHeaderList()).isEqualTo(

module gorm.io/gorm/tests

go 1.18

require (
	github.com/google/uuid v1.6.0
	github.com/jinzhu/now v1.1.5
	github.com/lib/pq v1.10.9
	github.com/stretchr/testify v1.9.0
	gorm.io/driver/mysql v1.5.7
	gorm.io/driver/postgres v1.5.9
	gorm.io/driver/sqlite v1.5.6
	gorm.io/driver/sqlserver v1.5.3
	gorm.io/gorm v1.25.12
)

require (
	filippo.io/edwards25519 v1.1.0 // indirect
	github.com/davecgh/go-spew v1.1.1 // indirect

    // enclosed with same start
    assertEquals(Range.closed(4, 6), range.intersection(Range.closed(4, 6)));

    // enclosed, interior
    assertEquals(Range.closed(5, 7), range.intersection(Range.closed(5, 7)));

    // enclosed with same end
    assertEquals(Range.closed(6, 8), range.intersection(Range.closed(6, 8)));

    // equal
    assertEquals(range, range.intersection(range));

   * exists. The resulting range may be empty if the two ranges are adjacent but non-overlapping.
   *
   * <p>For example, the gap of {@code [1..5]} and {@code (7..10)} is {@code (5..7]}. The resulting
   * range may be empty; for example, the gap between {@code [1..5)} {@code [5..7)} yields the empty
   * range {@code [5..5)}.
   *
   * <p>The gap exists if and only if the two ranges are either disconnected or immediately adjacent

	_ = x[HandlerServerInfo-51]
	_ = x[HandlerGetSysConfig-52]
	_ = x[HandlerGetSysServices-53]
	_ = x[HandlerGetSysErrors-54]
	_ = x[HandlerGetAllBucketStats-55]
	_ = x[HandlerGetBucketStats-56]
	_ = x[HandlerGetSRMetrics-57]
	_ = x[HandlerGetPeerMetrics-58]
	_ = x[HandlerGetMetacacheListing-59]
	_ = x[HandlerUpdateMetacacheListing-60]
	_ = x[HandlerGetPeerBucketMetrics-61]
	_ = x[HandlerStorageInfo-62]
	_ = x[HandlerConsoleLog-63]

   * exists. The resulting range may be empty if the two ranges are adjacent but non-overlapping.
   *
   * <p>For example, the gap of {@code [1..5]} and {@code (7..10)} is {@code (5..7]}. The resulting
   * range may be empty; for example, the gap between {@code [1..5)} {@code [5..7)} yields the empty
   * range {@code [5..5)}.
   *
   * <p>The gap exists if and only if the two ranges are either disconnected or immediately adjacent

      when (source.select(options)) {
        in 0..2 -> {
          completeEvent(id, type, data)
          return true
        }

        in 3..4 -> {
          source.readData(data)
        }

        in 5..7 -> {
          data.writeByte('\n'.code) // 'data' on a line of its own.
        }

        in 8..9 -> {
          id = source.readUtf8LineStrict().takeIf { it.isNotEmpty() }
        }

        in 10..12 -> {

  val chrome33 = sslLabsClients.first { it.userAgent == "Chrome" && it.version == "33" }
  val chrome57 = sslLabsClients.first { it.userAgent == "Chrome" && it.version == "57" }
  val chrome80 = sslLabsClients.first { it.userAgent == "Chrome" && it.version == "80" }
  val firefox34 = sslLabsClients.first { it.userAgent == "Firefox" && it.version == "34" }

    assertFalse(rangeSet.contains(1));
  }

  public void testRangeContaining2() {
    RangeSet<Integer> rangeSet = TreeRangeSet.create();
    rangeSet.add(Range.closed(3, 10));
    rangeSet.remove(Range.open(5, 7));
    assertEquals(Range.closed(3, 5), rangeSet.rangeContaining(5));
    assertTrue(rangeSet.contains(5));
    assertEquals(Range.closed(7, 10), rangeSet.rangeContaining(8));
    assertTrue(rangeSet.contains(8));

		{bucketNames[0], objectNames[0], uploadIDs[0], 4, "mnop", "e132e96a5ddad6da8b07bba6f6131fef", int64(len("abcd")), "e132e96a5ddad6da8b07bba6f6131fef"},
		// Cases 5-7.
		// Create parts with 3 uploadID's for the same object.
		// Testing for listing of all the uploadID's for given object.
		// Insertion with 3 different uploadID's are done for same bucket and object.