joiner.appendTo(sb1FromIterator, parts.iterator());
    assertThat(sb1FromIterator.toString()).isEqualTo("x" + expected);

    // The use of iterator() works around J2KT b/381065164.
    @Nullable Integer[] partsArray =
        newArrayList(parts.iterator()).toArray(new @Nullable Integer[0]);
    assertThat(joiner.join(partsArray)).isEqualTo(expected);

        for (int invalidSize : invalidSizes) {
            byte[] buffer = new byte[256];

            // Handle negative values (will wrap around in writeInt2)
            if (invalidSize >= 0) {
                SMBUtil.writeInt2(invalidSize, buffer, 0);

                // When & Then

   * intentionally, so there is no other way to clean up these threads. (The better solution,
   * though, would be to run the tests that use TestThread in separate VMs so that their threads
   * don't hang around during other tests.)
   */
  @Override
  public void tearDown() throws Exception {
    try {
      Thread.class.getMethod("stop").invoke(this);
      join();
    } catch (ReflectiveOperationException e) {

    try {
      super.runBare();
    } catch (AssertionError e) {
      if (e.getMessage() != null && e.getMessage().contains("Dude, where's my interrupt?")) {
        // Rerun test to work around Marshamallow class-loading issue b/456222735.
        super.runBare();
        return;
      }
      throw e;
    }
  }

  public void testNull() throws Exception {
    new NullPointerTester()

    try {
      super.runBare();
    } catch (AssertionError e) {
      if (e.getMessage() != null && e.getMessage().contains("Dude, where's my interrupt?")) {
        // Rerun test to work around Marshamallow class-loading issue b/456222735.
        super.runBare();
        return;
      }
      throw e;
    }
  }

  public void testNull() throws Exception {
    new NullPointerTester()

          > 0) {
        threshold = buffer[i];
      }
    }
  }

  /**
   * Partitions the contents of buffer in the range [left, right] around the pivot element
   * previously stored in buffer[pivotValue]. Returns the new index of the pivot element,
   * pivotNewIndex, so that everything in [left, pivotNewIndex] is ≤ pivotValue and everything in

          > 0) {
        threshold = buffer[i];
      }
    }
  }

  /**
   * Partitions the contents of buffer in the range [left, right] around the pivot element
   * previously stored in buffer[pivotValue]. Returns the new index of the pivot element,
   * pivotNewIndex, so that everything in [left, pivotNewIndex] is ≤ pivotValue and everything in

   * Returns the bucket (in either the K-to-V or V-to-K tables) where elements with the specified
   * hash could be found, if present, or could be inserted.
   */
  private int bucket(int hash) {
    return hash & (hashTableKToV.length - 1);
  }

  /** Given a key, returns the index of the entry in the tables, or ABSENT if not found. */
  private int findEntryByKey(@Nullable Object key) {
    return findEntryByKey(key, smearedHash(key));

      V v4,
      K k5,
      V v5,
      K k6,
      V v6,
      K k7,
      V v7,
      K k8,
      V v8,
      K k9,
      V v9) {
    /*
     * This explicit type parameter works around what seems to be a javac bug in certain
     * configurations: b/339186525#comment6
     */
    return ImmutableSortedMap.fromEntries(
        entryOf(k1, v1),
        entryOf(k2, v2),
        entryOf(k3, v3),

        private boolean done = false;
        private boolean throwOnFetch;
        private boolean throwOnCloseInternal;

        // Use static factory method to work around constructor ordering
        static TestIterator create(SmbTreeHandleImpl th, SmbResource parent, String wildcard, ResourceNameFilter filter,