*/
    task.addListener(() -> scheduled.cancel(false), directExecutor());
    return task;
  }

  /**
   * Returns a {@code Future} whose result is taken from the given primary {@code input} or, if the
   * primary input fails with the given {@code exceptionType}, from the result provided by the

          <name>optional</name>
          <version>4.0.0+</version>
          <description>
            Indicates the dependency is optional for use of this library. While the
            version of the dependency will be taken into account for dependency calculation if the
            library is used elsewhere, it will not be passed on transitively. Note: While the type

   *
   * <p>The set's iterator traverses the mappings for the first row, the mappings for the second
   * row, and so on.
   *
   * <p>Each cell is an immutable snapshot of a row key / column key / value mapping, taken at the
   * time the cell is returned by a method call to the set or its iterator.
   */
  @Override
  public Set<Cell<R, C, V>> cellSet() {
    return super.cellSet();
  }

  @Override

     * @param allRecordCount the total number of records found
     * @param allRecordCountRelation the relationship of the record count (exact, approximate, etc.)
     * @param queryTime the time taken to execute the search query
     * @param partialResults whether the results are partial due to timeout or other constraints
     * @param facetResponse the facet information for the search results

         */
        protected List<String> pageNumbers;
        /**
         * Indicates if the search results are partial.
         */
        protected boolean partial;
        /**
         * The time taken for the search query in milliseconds.
         */
        protected long queryTime;
        /**
         * The search query string.
         */
        protected String searchQuery;
        /**

   *
   * <p>The set's iterator traverses the mappings for the first row, the mappings for the second
   * row, and so on.
   *
   * <p>Each cell is an immutable snapshot of a row key / column key / value mapping, taken at the
   * time the cell is returned by a method call to the set or its iterator.
   */
  @Override
  public Set<Cell<R, C, V>> cellSet() {
    return super.cellSet();
  }

  @Override

    // (2) "Dolphin". If we're rotating an array a of size n by a distance of d, then element a[0]
    //     ends up at a[d], which in turn ends up at a[2d], and so on until we get back to a[0].
    //     (All indices taken mod n.) If d and n are mutually prime, all elements will have been
    //     moved at that point. Otherwise, we can rotate the cycle a[1], a[1 + d], a[1 + 2d], etc,

The cashier goes to the kitchen.

You wait, standing in front of the counter 🕙, so that no one else takes your burgers before you do, as there are no numbers for turns.

<img src="/img/async/parallel-burgers/parallel-burgers-03.png" class="illustration">

As you and your crush are busy not letting anyone get in front of you and take your burgers whenever they arrive, you cannot pay attention to your crush. 😞

      } else {
        return defaultExpectedValues;
      }
    }

    /**
     * {@inheritDoc}
     *
     * <p>Note that {@code expectedValuesPerKey} is taken to mean the expected number of
     * <i>distinct</i> values per key.
     *
     * @since 33.3.0
     */
    @CanIgnoreReturnValue
    @Override

   *   <li>it may split characters and combining characters
   *   <li>it does not consider word boundaries
   *   <li>if truncating for display to users, there are other considerations that must be taken
   *       into account
   *   <li>the appropriate truncation indicator may be locale-dependent
   *   <li>it is safe to use non-ASCII characters in the truncation indicator
   * </ul>
   *