public class TreeBasedTableRowMapTest extends RowMapTests {
  public TreeBasedTableRowMapTest() {
    super(false, true, true, true);
  }

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

      TreeBasedTable<R, C, V> generateTreeBasedTable(R row, C column, V value) {
    TreeBasedTable<R, C, V> table = TreeBasedTable.create();
    table.put(row, column, value);
    return table;
  }

  @Generates
  static <R, C, V> ImmutableTable<R, C, V> generateImmutableTable(R row, C column, V value) {
    return ImmutableTable.of(row, column, value);
  }

  // common.reflect
  @Generates

  public TablesTransposeColumnTest() {
    super(false, true, true, true, true);
  }

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

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

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

    Table<Character, Integer, String> nonEmptyTable = HashBasedTable.create();
    nonEmptyTable.put('A', 1, "blah");

    new EqualsTester()
        .addEqualityGroup(INSTANCE, HashBasedTable.create(), TreeBasedTable.create())
        .addEqualityGroup(nonEmptyTable)
        .testEquals();
  }

  @GwtIncompatible // ArrayTable
  public void testEqualsObjectNullValues() {
    new EqualsTester()

import com.google.common.collect.SortedMultiset;
import com.google.common.collect.SortedSetMultimap;
import com.google.common.collect.Table;
import com.google.common.collect.Tables;
import com.google.common.collect.TreeBasedTable;
import com.google.common.collect.TreeMultimap;
import com.google.common.io.ByteSink;
import com.google.common.io.ByteSource;
import com.google.common.io.ByteStreams;
import com.google.common.io.CharSink;

public class TreeBasedTableColumnTest extends ColumnTests {
  public TreeBasedTableColumnTest() {
    super(false, true, true, true, false);
  }

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

  public TreeBasedTableColumnMapTest() {
    super(false, true, true, false);
  }

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

      TreeBasedTable<R, C, V> generateTreeBasedTable(R row, C column, V value) {
    TreeBasedTable<R, C, V> table = TreeBasedTable.create();
    table.put(row, column, value);
    return table;
  }

  @Generates
  static <R, C, V> ImmutableTable<R, C, V> generateImmutableTable(R row, C column, V value) {
    return ImmutableTable.of(row, column, value);
  }

  // common.reflect
  @Generates

 * single row key may or may not be ordered, depending on the implementation. When rows and columns
 * are both sorted, it's easier to use the {@link TreeBasedTable} subclass.
 *
 * <p>The {@link #rowKeySet} method returns a {@link SortedSet} and the {@link #rowMap} method
 * returns a {@link SortedMap}, instead of the {@link Set} and {@link Map} specified by the {@link