if (result == null) {
      result = readHeader()
      peekedHeader = result
    }

    if (result.isEndOfData) return null

    return result
  }

  /**
   * Consume the next header in the stream and return it. If there is no header to read because we
   * have reached a limit, this returns [END_OF_DATA].
   */
  internal fun readHeader(): DerHeader {
    require(peekedHeader == null)

    @Override
    public int size() {
      return keyIndex.size();
    }

    @Override
    public boolean isEmpty() {
      return keyIndex.isEmpty();
    }

    Entry<K, V> getEntry(int index) {
      checkElementIndex(index, size());
      return new AbstractMapEntry<K, V>() {
        @Override
        public K getKey() {
          return ArrayMap.this.getKey(index);
        }

) {
  fine("${queue.name} ${String.format("%-22s", message)}: ${task.name}")
}

/**
 * Returns a duration in the nearest whole-number units like "999 µs" or "  1 s ". This rounds 0.5
 * units away from 0 and 0.499 towards 0. The smallest unit this returns is "µs"; the largest unit
 * it returns is "s". For values in [-499..499] this returns "  0 µs".
 *

        this.name = name;
        this.values = values;
    }

    /**
     * Returns the name of this request parameter.
     *
     * @return the parameter name
     */
    public String getName() {
        return name;
    }

    /**
     * Returns the array of values associated with this request parameter.
     *
     * @return the parameter values array, may be null or empty
     */
    public String[] getValues() {

      total += read;
    }
    return total;
  }

  /**
   * Returns a new {@link ByteArrayDataInput} instance to read from the {@code bytes} array from the
   * beginning.
   */
  @J2ktIncompatible
  public static ByteArrayDataInput newDataInput(byte[] bytes) {
    return newDataInput(new ByteArrayInputStream(bytes));
  }

  /**

        return set2.containsAll(set1);
      }

      @Override
      public boolean contains(@Nullable Object element) {
        return set1.contains(element) && !set2.contains(element);
      }

      @Override
      int minSize() {
        return max(minSize(set1) - maxSize(set2), 0);
      }

      @Override
      int maxSize() {
        return maxSize(set1);
      }

    }

    /**
     * Returns the primary domain name of the server.
     *
     * @return the primaryDomain
     */
    public final String getPrimaryDomain() {
        return this.primaryDomain;
    }

    /**
     * Indicates whether the session was established as a guest.
     *
     * @return the isLoggedInAsGuest
     */
    public final boolean isLoggedInAsGuest() {

  SortedSet<V> createUnmodifiableEmptyCollection() {
    return unmodifiableCollectionSubclass(createCollection());
  }

  @Override
  <E extends @Nullable Object> SortedSet<E> unmodifiableCollectionSubclass(
      Collection<E> collection) {
    if (collection instanceof NavigableSet) {
      return unmodifiableNavigableSet((NavigableSet<E>) collection);
    } else {
      return unmodifiableSortedSet((SortedSet<E>) collection);
    }
  }

          stack.addLast(expand(child));
        } else {
          stack.removeLast();
          return top.root;
        }
      }
      return endOfData();
    }

    private PostOrderNode<T> expand(T t) {
      return new PostOrderNode<>(t, children(t).iterator());
    }
  }

  /**
   * Returns an unmodifiable iterable over the nodes in a tree structure, using breadth-first

    }

    /**
     * Returns the capacity of the buffer.
     *
     * @return the buffer capacity
     */
    public int getCapacity() {
        return buf.length - start;
    }

    /**
     * Returns the available space at the tail of the buffer.
     *
     * @return the available tail space
     */
    public int getTailSpace() {
        return buf.length - index;
    }