public static <R, C, V> TreeBasedTable<R, C, V> create(
      Comparator<? super R> rowComparator, Comparator<? super C> columnComparator) {
    checkNotNull(rowComparator);
    checkNotNull(columnComparator);
    return new TreeBasedTable<>(rowComparator, columnComparator);
  }
public static <R, C, V> TreeBasedTable<R, C, V> create(
      Comparator<? super R> rowComparator, Comparator<? super C> columnComparator) {
    checkNotNull(rowComparator);
    checkNotNull(columnComparator);
    return new TreeBasedTable<>(rowComparator, columnComparator);
  }
public static < R , C , V > TreeBasedTable < R , C , V > create ( Comparator < ? super R > rowComparator , Comparator < ? super C > columnComparator ) { checkNotNull ( rowComparator ) ; checkNotNull ( columnComparator ) ; return new TreeBasedTable <> ( rowComparator , columnComparator ) ; }
Creates an empty {@code TreeBasedTable} that is ordered by the specified comparators.

@param rowComparator the comparator that orders the row keys
@param columnComparator the comparator that orders the column keys
Creates an empty { @code TreeBasedTable } that is ordered by the specified comparators .