public void setAllPageCount(final int allPageCount) {
        this.allPageCount = allPageCount;
    }

    /**
     * Checks if there is a previous page.
     * @return True if a previous page exists, false otherwise.
     */
    public boolean isExistPrePage() {
        return existPrePage;
    }

    /**
     * Sets the existence of a previous page.
     * @param existPrePage True if a previous page exists.

        Optional<Long> size = byteSource.sizeIfKnown();
        // if we know the size and it fits in an int
        if (size.isPresent() && size.get().longValue() == size.get().intValue()) {
          // otherwise try to presize a StringBuilder
          // it is kind of lame that we need to construct a decoder to access this value.
          // if this is a concern we could add special cases for some known charsets (like utf8)

        Optional<Long> size = byteSource.sizeIfKnown();
        // if we know the size and it fits in an int
        if (size.isPresent() && size.get().longValue() == size.get().intValue()) {
          // otherwise try to presize a StringBuilder
          // it is kind of lame that we need to construct a decoder to access this value.
          // if this is a concern we could add special cases for some known charsets (like utf8)

Most of these ideas would be more or less **independent**, and in most cases you should only need to study them if they apply directly to **your project**.

If something seems interesting and useful to your project, go ahead and check it, but otherwise, you might probably just skip them.

/// tip

If you want to **learn FastAPI** in a structured way (recommended), go and read the [Tutorial - User Guide](../tutorial/index.md) chapter by chapter instead.

    addNodes(graph);

    assertThat(graph.nodeOrder()).isEqualTo(insertion());
    assertThat(graph.nodes()).containsExactly(3, 1, 4).inOrder();
  }

  // The default ordering is INSERTION unless otherwise specified.
  @Test
  public void nodeOrder_default() {
    MutableGraph<Integer> graph = GraphBuilder.directed().build();

    addNodes(graph);

    assertThat(graph.nodeOrder()).isEqualTo(insertion());

     * The result code of the DCERPC operation
     */
    protected int result = 0;

    /**
     * Checks if a specific flag is set
     * @param flag the flag to check
     * @return true if the flag is set, false otherwise
     */
    public boolean isFlagSet(final int flag) {
        return (flags & flag) == flag;
    }

    /**
     * Unsets a specific flag
     * @param flag the flag to unset
     */

   *
   * @param timeout the maximum time to wait for the permit. Negative values are treated as zero.
   * @return {@code true} if the permit was acquired, {@code false} otherwise
   * @throws IllegalArgumentException if the requested number of permits is negative or zero
   * @since 33.4.0 (but since 28.0 in the JRE flavor)
   */

     * @param text the string to check
     * @return true if empty or null, false otherwise
     */
    public static final boolean isEmpty(final String text) {
        return text == null || text.length() == 0;
    }

    /**
     * Checks if the string is not empty.
     *
     * @param text the string to check
     * @return true if not empty, false otherwise
     */
    public static final boolean isNotEmpty(final String text) {

     * Checks if query parser is available.
     * @return True if query parser is available, false otherwise.
     */
    public static boolean hasQueryParser() {
        return hasComponent(QUERY_PARSER);
    }

    /**
     * Checks if view helper is available.
     * @return True if view helper is available, false otherwise.
     */
    public static boolean hasViewHelper() {
        return hasComponent(VIEW_HELPER);

  b) Subject to the terms of this Agreement, each Contributor hereby
  grants Recipient a non-exclusive, worldwide, royalty-free patent
  license under Licensed Patents to make, use, sell, offer to sell,
  import and otherwise transfer the Contribution of such Contributor,
  if any, in Source Code or other form. This patent license shall
  apply to the combination of the Contribution and the Program if, at