} else {
      addPendingString(builder); // delegates to addDoneString if future completes midway
    }
    return builder.append("]").toString();
  }

  /**
   * Provide a human-readable explanation of why this future has not yet completed.
   *
   * @return null if an explanation cannot be provided (e.g. because the future is done).
   * @since 23.0
   */
  @CheckForNull

    assertAssignable(
        new TypeToken<NumberList<? super Integer>>() {}, new TypeToken<NumberList<?>>() {});
  }

  public <T extends Readable & Appendable> void testMultiBound() {
    assertAssignable(new TypeToken<List<T>>() {}, new TypeToken<List<? extends Readable>>() {});
    assertAssignable(new TypeToken<List<T>>() {}, new TypeToken<List<? extends Appendable>>() {});
  }

  public void testToGenericType() {

    extends AbstractMap<K, V> implements ConcurrentMap<K, V>, Serializable {

  /*
   * The basic strategy is to subdivide the table among Segments, each of which itself is a
   * concurrently readable hash table. The map supports non-blocking reads and concurrent writes
   * across different segments.
   *
   * The page replacement algorithm's data structures are kept casually consistent with the map. The

    assertAssignable(
        new TypeToken<NumberList<? super Integer>>() {}, new TypeToken<NumberList<?>>() {});
  }

  public <T extends Readable & Appendable> void testMultiBound() {
    assertAssignable(new TypeToken<List<T>>() {}, new TypeToken<List<? extends Readable>>() {});
    assertAssignable(new TypeToken<List<T>>() {}, new TypeToken<List<? extends Appendable>>() {});
  }

  public void testToGenericType() {