while (idx < encodedLen) {
      idx += doParseTrieToBuilder(new ArrayDeque<>(), encoded, idx, builder);
    }

    return builder.buildOrThrow();
  }

  /**
   * Parses a trie node and returns the number of characters consumed.
   *
   * @param stack The prefixes that precede the characters represented by this node. Each entry of
   *     the stack is in reverse order.
   * @param encoded The serialized trie.

   */
  @IgnoreJRERequirement // Only programs that already have Instant will use this.
  fun getInstant(name: String): Instant? = getDate(name)?.toInstant()

  /** Returns the number of field values. */
  @get:JvmName("size")
  val size: Int
    get() = namesAndValues.size / 2

  @JvmName("-deprecated_size")
  @Deprecated(
    message = "moved to val",

			// consider the offline disks as consistent.
			continue
		}
		if !meta.Deleted {
			if len(meta.Erasure.Distribution) != len(onlineDisks) {
				// Erasure distribution seems to have lesser
				// number of items than number of online disks.
				inconsistent++
				continue
			}
			if meta.Erasure.Distribution[i] != meta.Erasure.Index {
				// Mismatch indexes with distribution order
				inconsistent++
			}
		}

    public static final int MAX_BUFFER_SIZE = 1000;

    /** List storing recent lines from the input stream */
    private final List<String> list = new LinkedList<>();

    /** Maximum number of lines to keep in the buffer */
    private final int bufferSize;

    /** Callback function to process each line as it's read */
    private final Consumer<String> outputCallback;

    /**

     */
    @Size(max = 1000)
    public String q;

    /**
     * The sort parameter for search results.
     */
    @Size(max = 1000)
    public String sort;

    /**
     * The number of search results to return per page.
     */
    @ValidateTypeFailure
    public Integer num;

    /**
     * Array of language codes to filter search results.
     */
    public String[] lang;

    /**

        this.maxVersion = maxVersion;
    }

    /**
     * Get the number of send credits requested
     *
     * @return credits requested
     */
    public int getCreditsRequested() {
        return creditsRequested;
    }

    /**
     * Set the number of send credits requested
     *
     * @param creditsRequested credits to request
     */

  public static MultimapBuilderWithKeys<@Nullable Object> hashKeys() {
    return hashKeys(DEFAULT_EXPECTED_KEYS);
  }

  /**
   * Uses a hash table to map keys to value collections, initialized to expect the specified number
   * of keys.
   *
   * @throws IllegalArgumentException if {@code expectedKeys < 0}
   */
  public static MultimapBuilderWithKeys<@Nullable Object> hashKeys(int expectedKeys) {

  public static MultimapBuilderWithKeys<@Nullable Object> hashKeys() {
    return hashKeys(DEFAULT_EXPECTED_KEYS);
  }

  /**
   * Uses a hash table to map keys to value collections, initialized to expect the specified number
   * of keys.
   *
   * @throws IllegalArgumentException if {@code expectedKeys < 0}
   */
  public static MultimapBuilderWithKeys<@Nullable Object> hashKeys(int expectedKeys) {

     * @return The converted {@link Boolean}
     */
    public static Boolean toBoolean(final Object o) {
        return switch (o) {
        case null -> null;
        case Boolean b -> b;
        case Number n -> n.intValue() != 0;
        case String s -> switch (s.toLowerCase()) {
        case "true" -> Boolean.TRUE;
        case "false", "0" -> Boolean.FALSE;
        default -> Boolean.TRUE;
        };

	// complement encoded number in big-endian byte order.
	if len(b) > 0 && b[0]&0x80 != 0 {
		// Handling negative numbers relies on the following identity:
		//	-a-1 == ^a
		//
		// If the number is negative, we use an inversion mask to invert the
		// data bytes and treat the value as an unsigned number.
		var inv byte // 0x00 if positive or zero, 0xff if negative