*/
@GwtCompatible
public class TreeBasedTable<R, C, V> extends StandardRowSortedTable<R, C, V> {
  private final Comparator<? super C> columnComparator;

  private static final class Factory<C, V> implements Supplier<Map<C, V>>, Serializable {
    final Comparator<? super C> comparator;

    Factory(Comparator<? super C> comparator) {
      this.comparator = comparator;
    }

    @Override
    public Map<C, V> get() {

	}

	var users3 []User
	DB.Joins("inner join pets on pets.user_id = users.id AND pets.name = ?", user.Pets[0].Name).Joins("join accounts on accounts.user_id = users.id AND accounts.number = ?", user.Account.Number).Where("users.name = ?", user.Name).First(&users3)
	if len(users3) != 1 {
		t.Errorf("should find one users using multiple left join conditions, but got %v", len(users3))
	}

	var users4 []User

    assertThat(Ascii.toLowerCase(LOWER)).isSameInstanceAs(LOWER);
    assertThat(Ascii.toLowerCase(IGNORED)).isEqualTo(IGNORED);
    assertThat(Ascii.toLowerCase("fOobaR")).isEqualTo("foobar");
  }

  public void testToUpperCase() {
    assertThat(Ascii.toUpperCase(LOWER)).isEqualTo(UPPER);
    assertThat(Ascii.toUpperCase(UPPER)).isSameInstanceAs(UPPER);

    assertThat(Ascii.toLowerCase(LOWER)).isSameInstanceAs(LOWER);
    assertThat(Ascii.toLowerCase(IGNORED)).isEqualTo(IGNORED);
    assertThat(Ascii.toLowerCase("fOobaR")).isEqualTo("foobar");
  }

  public void testToUpperCase() {
    assertThat(Ascii.toUpperCase(LOWER)).isEqualTo(UPPER);
    assertThat(Ascii.toUpperCase(UPPER)).isSameInstanceAs(UPPER);

  @Override
  public void testEntrySetRemoveAllNullFromEmpty() {
    try {
      super.testEntrySetRemoveAllNullFromEmpty();
    } catch (RuntimeException tolerated) {
      // GWT's HashMap.entrySet().removeAll(null) doesn't throws NPE.
    }
  }

  @Override
  public void testEntrySetRetainAllNullFromEmpty() {
    try {
      super.testEntrySetRetainAllNullFromEmpty();
    } catch (RuntimeException tolerated) {

	case '0', '1', '2', '3', '4', '5', '6', '7', '8', '9':
		i, err := d.number()
		return i, Number, err
	case '-':
		if c = d.next(); c < '0' || c > '9' {
			return nil, Unknown, d.mkError(ErrSyntax, "in negative numeric literal")
		}
		n, err := d.number()
		if err != nil {
			return nil, Unknown, err
		}
		return -n, Number, nil
	case 'f':
		if d.remaining() < 4 {

     */
    public void setLength(final int length) {
        deferred.length = length;
    }

    /**
     * Advances the buffer index by the specified number of bytes.
     *
     * @param n the number of bytes to advance
     */
    public void advance(final int n) {
        index += n;
        if (index - start > deferred.length) {
            deferred.length = index - start;
        }

 */
@GwtCompatible
public class TreeBasedTable<R, C, V> extends StandardRowSortedTable<R, C, V> {
  private final Comparator<? super C> columnComparator;

  private static final class Factory<C, V> implements Supplier<Map<C, V>>, Serializable {
    final Comparator<? super C> comparator;

    Factory(Comparator<? super C> comparator) {
      this.comparator = comparator;
    }

    @Override
    public Map<C, V> get() {

    this.loadSuccessCount = loadSuccessCount;
    this.loadExceptionCount = loadExceptionCount;
    this.totalLoadTime = totalLoadTime;
    this.evictionCount = evictionCount;
  }

  /**
   * Returns the number of times {@link Cache} lookup methods have returned either a cached or
   * uncached value. This is defined as {@code hitCount + missCount}.
   *

    this.loadSuccessCount = loadSuccessCount;
    this.loadExceptionCount = loadExceptionCount;
    this.totalLoadTime = totalLoadTime;
    this.evictionCount = evictionCount;
  }

  /**
   * Returns the number of times {@link Cache} lookup methods have returned either a cached or
   * uncached value. This is defined as {@code hitCount + missCount}.
   *