assertEquals("METADATA", SsoResponseType.METADATA.name());
        assertEquals("LOGOUT", SsoResponseType.LOGOUT.name());
    }

    public void test_ordinal() {
        // Test ordinal() method returns correct position
        assertEquals(0, SsoResponseType.METADATA.ordinal());
        assertEquals(1, SsoResponseType.LOGOUT.ordinal());
    }

    public void test_toString() {

        super();
    }

    /** The search query string. */
    @Size(max = 1000)
    public String q;

    /** The sort field and direction. */
    public String sort;

    /** The start position for search results. */
    @ValidateTypeFailure
    public Integer start;

    /** The offset for pagination. */
    @ValidateTypeFailure
    public Integer offset;

    /** The page number. */

        - name: start
          in: query
          description: Start position
          required: false
          schema:
            type: integer
            minimum: 0
            exclusiveMinimum: false
            default: 0
            example: 0
        - name: offset
          in: query
          description: Offset from a start position
          required: false
          schema:
            type: integer

     */
    public String[] lang;

    /**
     * Array of additional query strings to exclude from search.
     */
    public String[] ex_q;

    /**
     * The starting position for search results pagination.
     */
    @ValidateTypeFailure
    public Integer start;

    /**
     * The offset for search results.
     */
    @ValidateTypeFailure
    public Integer offset;

 * http://tools.ietf.org/html/draft-ietf-httpbis-header-compression-12
 *
 * This implementation uses an array for the dynamic table and a list for indexed entries. Dynamic
 * entries are added to the array, starting in the last position moving forward. When the array
 * fills, it is doubled.
 */
@Suppress("NAME_SHADOWING")
object Hpack {
  private const val PREFIX_4_BITS = 0x0f
  private const val PREFIX_5_BITS = 0x1f

      @Override
      public void remove() {
        throw new UnsupportedOperationException();
      }
    };
  }

  static <T extends @Nullable Object> T get(Iterator<T> iterator, int position) {
    for (int i = 0; i < position; i++) {
      iterator.next();
    }
    return iterator.next();
  }

  private static final class EntryComparator<K extends @Nullable Object, V extends @Nullable Object>

 *
 * <p><b>Warning:</b> As in all {@link SetMultimap}s, do not modify either a key <i>or a value</i>
 * of a {@code SortedSetMultimap} in a way that affects its {@link Object#equals} behavior (or its
 * position in the order of the values). Undefined behavior and bugs will result.
 *
 * <p>See the Guava User Guide article on <a href=
 * "https://github.com/google/guava/wiki/NewCollectionTypesExplained#multimap">{@code Multimap}</a>.
 *

                assertEquals(0, dst[i]);
            }

            // Verify encoded data at offset
            ByteBuffer bb = ByteBuffer.wrap(dst).order(ByteOrder.LITTLE_ENDIAN);
            bb.position(offset);
            assertEquals(maxReferralLevel, bb.getShort());
        }

        @Test
        @DisplayName("Should encode empty path correctly")
        void testEncodeEmptyPath() {

        // This means bytes 20-27 will be zero (8 bytes written by writeInt8)
        for (int i = 20; i < 28; i++) {
            assertEquals(0, buffer[i], "Padding byte at position " + i + " should be 0");
        }

        // The byte at position 28 should be unchanged
        assertEquals((byte) 0xFF, buffer[28], "Byte after padding should be unchanged");
    }

    @Test

            // Then
            assertEquals(stringBytes.length, terminationPos, "Should find termination at correct position");
        }

        @Test
        @DisplayName("findUNITermination should throw exception when termination not found")
        void testFindUNITerminationNotFound() {
            // Given