* immutable graphs, this value is ignored; they always have a {@link ElementOrder#stable()
   * stable} order.
   *
   * @throws IllegalArgumentException if {@code incidentEdgeOrder} is not either {@code
   *     ElementOrder.unordered()} or {@code ElementOrder.stable()}.
   * @since 29.0
   */
  public <N1 extends N> ValueGraphBuilder<N1, V> incidentEdgeOrder(

  }

  /** A factory that chooses the most space-efficient representation of the table. */
  static <R, C, V> RegularImmutableTable<R, C, V> forOrderedComponents(
      ImmutableList<Cell<R, C, V>> cellList,
      ImmutableSet<R> rowSpace,
      ImmutableSet<C> columnSpace) {
    // use a dense table if more than half of the cells have values
    // TODO(gak): tune this condition based on empirical evidence

@GwtCompatible
@NullMarked
public class TreeBasedTableRowTest extends RowTests {
  public TreeBasedTableRowTest() {
    super(false, true, true, true, true);
  }

  @Override
  Table<Character, String, Integer> makeTable() {
    return TreeBasedTable.create();
  }

when she got to the door, she found she had forgotten the
little golden key, and when she went back to the table for it,
she found she could not possibly reach it:  she could see it
quite plainly through the glass, and she tried her best to climb
up one of the legs of the table, but it was too slippery;
and when she had tired herself out with trying,
the poor little thing sat down and cried.

@GwtCompatible
@NullMarked
public class HashBasedTableRowTest extends RowTests {
  public HashBasedTableRowTest() {
    super(false, true, true, true, true);
  }

  @Override
  Table<Character, String, Integer> makeTable() {
    return HashBasedTable.create();
  }

@GwtIncompatible // TODO(hhchan): ArrayTable
@NullUnmarked
public class ArrayTableRowMapTest extends RowMapTests {
  public ArrayTableRowMapTest() {
    super(true, false, false, false);
  }

  @Override
  Table<String, Integer, Character> makeTable() {
    return ArrayTable.create(asList("foo", "bar", "dog"), asList(1, 2, 3));
  }

  @Override
  protected Map<String, Map<Integer, Character>> makeEmptyMap() {

     * For example, if you specify an underscore as the delimiter for JavaBeans and a period as the delimiter for {@link Map},
     * the property names for the source and destination will be as follows:
     * </p>
     * <table border="1">
     * <caption>Copied JavaBeans Properties</caption>
     * <tr>
     * <th>JavaBeans Property Name</th>
     * <th>{@literal Map} Property Name</th>
     * </tr>
     * <tr>

  }

  public void testHashBiMap() {
    assertFreshInstance(new TypeToken<HashBiMap<String, ?>>() {});
  }

  public void testTable() {
    assertFreshInstance(new TypeToken<Table<String, ?, ?>>() {});
    assertNotInstantiable(new TypeToken<Table<EmptyEnum, String, Integer>>() {});
  }

  public void testHashBasedTable() {
    assertFreshInstance(new TypeToken<HashBasedTable<String, ?, ?>>() {});
  }

      Table<R, C, V> table(Table<R, C, V> table, @Nullable Object mutex) {
    return new SynchronizedTable<>(table, mutex);
  }

  static final class SynchronizedTable<
          R extends @Nullable Object, C extends @Nullable Object, V extends @Nullable Object>
      extends SynchronizedObject implements Table<R, C, V> {

    SynchronizedTable(Table<R, C, V> delegate, @Nullable Object mutex) {

      Table<R, C, V> table(Table<R, C, V> table, @Nullable Object mutex) {
    return new SynchronizedTable<>(table, mutex);
  }

  static final class SynchronizedTable<
          R extends @Nullable Object, C extends @Nullable Object, V extends @Nullable Object>
      extends SynchronizedObject implements Table<R, C, V> {

    SynchronizedTable(Table<R, C, V> delegate, @Nullable Object mutex) {