}

    /**
     * Gets the starting record number for the current page.
     *
     * @return The starting record number
     */
    public long getCurrentStartRecordNumber() {
        return currentStartRecordNumber;
    }

    /**
     * Gets the ending record number for the current page.
     *
     * @return The ending record number
     */
    public long getCurrentEndRecordNumber() {

    }

    /**
     * Gets the default current page number, which is 1.
     *
     * @return The default current page number.
     */
    protected int getDefaultCurrentPageNumber() {
        return 1;
    }

    /**
     * Gets the total number of records.
     *
     * @return The total record count.
     */
    public int getAllRecordCount() {

        return ComponentUtil.getFessConfig().getPagingPageSizeAsInteger();
    }

    /**
     * Gets the default current page number.
     * @return The default current page number.
     */
    protected int getDefaultCurrentPageNumber() {
        return 1;
    }

    /**
     * Gets the total number of records.
     * @return The total record count.
     */
    public int getAllRecordCount() {
        return allRecordCount;

  // okay since we have to copy the just-created array anyway.
  public static ImmutableLongArray of(long first, long... rest) {
    checkArgument(
        rest.length <= Integer.MAX_VALUE - 1, "the total number of elements must fit in an int");
    long[] array = new long[rest.length + 1];
    array[0] = first;
    System.arraycopy(rest, 0, array, 1, rest.length);
    return new ImmutableLongArray(array);
  }

  // okay since we have to copy the just-created array anyway.
  public static ImmutableIntArray of(int first, int... rest) {
    checkArgument(
        rest.length <= Integer.MAX_VALUE - 1, "the total number of elements must fit in an int");
    int[] array = new int[rest.length + 1];
    array[0] = first;
    System.arraycopy(rest, 0, array, 1, rest.length);
    return new ImmutableIntArray(array);
  }

     * @return The number of queue replicas.
     */
    public int getQueueReplicas() {
        return queueReplicas;
    }

    /**
     * Sets the number of queue replicas.
     * @param queueReplicas The number of queue replicas.
     */
    public void setQueueReplicas(final int queueReplicas) {
        this.queueReplicas = queueReplicas;
    }

    /**

| Maximum number of servers per cluster                           | no-limit      |
| Minimum number of servers                                       | 02            |
| Minimum number of drives per server when server count is 1      | 02            |
| Minimum number of drives per server when server count is 2 or 3 | 01            |
| Minimum number of drives per server when server count is 4      | 01            |

        public V computeIfAbsent(K key, Function<? super K, ? extends V> mappingFunction) {
            throw uoe();
        }

        @Override
        public V computeIfPresent(K key, BiFunction<? super K, ? super V, ? extends V> remappingFunction) {
            throw uoe();
        }

        @Override
        public V compute(K key, BiFunction<? super K, ? super V, ? extends V> remappingFunction) {

  }

  public void testPeekingIteratorBehavesLikeIteratorOnSingletonIterable() {
    actsLikeIteratorHelper(singletonList(new Object()));
  }

  // TODO(cpovirk): instead of skipping, use a smaller number of steps
  @GwtIncompatible // works but takes 5 minutes to run
  public void testPeekingIteratorBehavesLikeIteratorOnThreeElementIterable() {
    actsLikeIteratorHelper(Lists.newArrayList("A", "B", "C"));
  }

   * thus a motivated caller may be able to expose the reference to another thread that would then
   * call cancel() and be unable to cancel the delegate.
   * There are a number of ways to solve this, none of which are very pretty, and it is currently
   * believed to be a purely theoretical problem (since the other actions should supply sufficient
   * write-barriers).
   */