return (SortedMap<R, Map<C, V>>) super.rowMap();
  }

  @Override
  SortedMap<R, Map<C, V>> createRowMap() {
    return new RowSortedMap();
  }

  @WeakOuter
  private final class RowSortedMap extends RowMap implements SortedMap<R, Map<C, V>> {
    @Override
    public SortedSet<R> keySet() {
      return (SortedSet<R>) super.keySet();
    }

    @Override

  public VerifyException(@Nullable String message) {
    super(message);
  }

  /**
   * Constructs a {@code VerifyException} with the cause {@code cause} and a message that is {@code
   * null} if {@code cause} is null, and {@code cause.toString()} otherwise.
   *
   * @since 19.0
   */
  public VerifyException(@Nullable Throwable cause) {
    super(cause);
  }

  /**

     */
    public ConnectionTimeoutException(final String msg) {
        super(msg);
    }

    /**
     * Constructs a new ConnectionTimeoutException with the specified cause.
     * @param rootCause the cause of this exception
     */
    public ConnectionTimeoutException(final Throwable rootCause) {
        super(rootCause);
    }

    /**

  /**
   * Keeps track of metadata like the number of hash table bits and modifications of this data
   * structure (to make it possible to throw ConcurrentModificationException in the iterator). Note
   * that we choose not to make this volatile, so we do less of a "best effort" to track such
   * errors, for better performance.
   */
  private transient int metadata;

  /** The number of elements contained in the set. */

  private static boolean isInterruptible(Method method) {
    return Arrays.asList(method.getExceptionTypes()).contains(InterruptedException.class);
  }

  /** Sorts the given methods primarily by name and secondarily by number of parameters. */
  private static void sortMethods(Method[] methods) {
    Arrays.sort(
        methods,
        (m1, m2) -> {
          int nameComparison = m1.getName().compareTo(m2.getName());

        maxSafeDigits[i] = overflow.toString(i).length() - 1;
      }
    }

    /**
     * Returns true if (current * radix) + digit is a number too large to be represented by an
     * unsigned long. This is useful for detecting overflow while parsing a string representation of
     * a number. Does not verify whether supplied radix is valid, passing an invalid radix will give
     * undefined results or an ArrayIndexOutOfBoundsException.
     */

   *
   * @since 10.0
   */
  public interface StatsCounter {
    /**
     * Records cache hits. This should be called when a cache request returns a cached value.
     *
     * @param count the number of hits to record
     * @since 11.0
     */
    void recordHits(int count);

    /**
     * Records cache misses. This should be called when a cache request returns a value that was not

    }

    /**
     * Indexes documents from a query log reader asynchronously.
     *
     * @param ctx The content indexing context
     * @param queryLogReader The query log reader
     * @param docPerReq The number of documents to process per request
     * @param requestInterval The interval between requests
     * @return A Promise that will be resolved with the SuggestIndexResponse
     */

  @Override
  public ListenableFuture<?> submit(Runnable task) {
    return (ListenableFuture<?>) super.submit(task);
  }

  @CanIgnoreReturnValue // TODO(kak): consider removing this
  @Override
  public <T extends @Nullable Object> ListenableFuture<T> submit(
      Runnable task, @ParametricNullness T result) {
    return (ListenableFuture<T>) super.submit(task, result);
  }

  @CanIgnoreReturnValue // TODO(kak): consider removing this

            assertEquals(3, response.getDfsResponse().getNumReferrals());
        }

        @ParameterizedTest
        @ValueSource(ints = { 1, 2, 5, 10 })
        @DisplayName("Should handle varying number of referrals")
        void testReadDataWireFormatVaryingReferrals(int numReferrals) {
            byte[] buffer = createDfsReferralBufferWithMultipleReferrals(numReferrals);