*
   * <p>Unlike {@link Character#codePointAt(CharSequence, int)} or {@link String#codePointAt(int)}
   * this method will never fail silently when encountering an invalid surrogate pair.
   *
   * <p>The behaviour of this method is as follows:
   *
   * <ol>
   *   <li>If {@code index >= end}, {@link IndexOutOfBoundsException} is thrown.

 * because of the possibility of splitting a surrogate pair. The only case in which it is safe to
 * escape strings and concatenate the results is if you can rule out this possibility, either by
 * splitting an existing long string into short strings adaptively around {@linkplain
 * Character#isHighSurrogate surrogate} {@linkplain Character#isLowSurrogate pairs}, or by starting

@NullMarked
public abstract class IteratorTester<E extends @Nullable Object>
    extends AbstractIteratorTester<E, Iterator<E>> {
  /**
   * Creates an IteratorTester.
   *
   * @param steps how many operations to test for each tested pair of iterators
   * @param features the features supported by the iterator
   */
  protected IteratorTester(
      int steps,
      Iterable<? extends IteratorFeature> features,
      Iterable<E> expectedElements,

 * Provides lookup tables for converting between DOS and NT error representations.
 */
public interface DosError {

    /**
     * Mapping table from DOS error codes to NT status codes.
     * Each entry contains a pair of [DOS error code, NT status code].
     */
    int[][] DOS_ERROR_CODES = { { 0x00000000, 0x00000000 }, { 0x00010001, 0xc0000002 }, { 0x00010002, 0xc0000002 },

 * Provides lookup tables for converting between DOS and NT error representations.
 */
public interface DosError {

    /**
     * Mapping table from DOS error codes to NT status codes.
     * Each entry contains a pair of [DOS error code, NT status code].
     */
    int[][] DOS_ERROR_CODES =
            { { 0x00000000, 0x00000000 }, { 0x00010001, 0xc0000002 }, { 0x00010002, 0xc0000002 }, { 0x00020001, 0xc000000f },

    // - computation ends first: the removal listener is called, and the cache does not contain the
    //   key/value pair
    // - clear() happens first: the removal listener is not called, and the cache contains the pair
    AtomicBoolean computationShouldWait = new AtomicBoolean();
    CountDownLatch computationLatch = new CountDownLatch(1);

    // - computation ends first: the removal listener is called, and the cache does not contain the
    //   key/value pair
    // - clear() happens first: the removal listener is not called, and the cache contains the pair
    AtomicBoolean computationShouldWait = new AtomicBoolean();
    CountDownLatch computationLatch = new CountDownLatch(1);

                            for (Object item : list) {
                                if (item instanceof List<?> pair) {
                                    if (pair.size() == 2 && pair.get(0) instanceof String name
                                            && pair.get(1) instanceof List<?> valueList) {
                                        final String[] values =

   */
  public val connectionIndex: Int,
  /**
   * The index of this exchange on its HTTP connection. A request is uniquely identified by the
   * (connection index, exchange index) pair.
   */
  public val exchangeIndex: Int,
  /**
   * The TLS handshake of the connection that carried this request, or null if the request was
   * received without TLS.
   */
  public val handshake: Handshake?,

		nsecs = -(nsecs - 1e9) // Take that second away from nsecs
	}
	return strings.TrimRight(fmt.Sprintf("%s%d.%09d", sign, secs, nsecs), "0")
}

// parsePAXRecord parses the input PAX record string into a key-value pair.
// If parsing is successful, it will slice off the currently read record and
// return the remainder as r.
func parsePAXRecord(s string) (k, v, r string, err error) {
	// The size field ends at the first space.