* @brief Returns ``std::nullopt``. */

* @brief Recursive implementation of `fold`, requires that `tail - head > 0`. */

* @brief Returns one-past-the-end of the scanned range. */

* @brief Recursive implementation of `fall_sweep`, requires that `tail - head > 0`. */

* @brief Launch the implementation in the un-scanned chunks. * * Options: * left fully scanned and right fully scanned -> return (make this

* @brief Generate a random bit sequence and advance the state of the generator. * * @return A pseudo-random number. */

* @brief Get the value like ``std::optional``. * * Requires ``code == err::none`` . */

* @brief Access the contained object, must have been constructed first. */

* @brief Access the stored value, ``has_value()`` must be true. */

* @brief Return a proxy object that can be assigned any value. */

* @brief Return a proxy object that can be assigned any value. */

* @brief Access the stored value, ``has_value()`` must be true. */

* @brief Access the contained object, must have been constructed first. */

* @brief Get the value like ``std::optional``. * * Requires ``code == err::none`` . */

* @brief Get the value ``like std::optional``. * * Requires ``code == err::none`` . */

* @brief Access the contained object, must have been constructed first. */

* @brief Access the stored value, ``has_value()`` must be true. */

* @brief Access the stored value, ``has_value()`` must be true. */

* @brief Access the contained object, must have been constructed first. */

* @brief Get the value ``like std::optional``. * * Requires ``code == err::none`` . */

* @brief A no-op assignment operator. */

* @brief Move assign to a future. */

* @brief Move assign a lazy_pool object. */

* @brief Move assign a lazy_pool object. */

* @brief Move assign to a future. */

* @brief A no-op assignment operator. */

* @brief Move assign a lazy_pool object. */

* @brief Move assign a lazy_pool object. */

* @brief Get a pointer to the parent frame. * * Only valid if this is not a root frame. */

* @brief Remove a task from the work queue */

* @brief Remove a task from the work queue */

* @brief Push a new node, this can be called concurrently from any number of threads. * * `new_node` should be an unlinked node e.g. not part of

* @brief Add a task to the work queue. */

* @brief Push a new node, this can be called concurrently from any number of threads. * * `new_node` should be an unlinked node e.g. not part of

* @brief Get the interval to the right of the current interval. */

* @brief Get the interval to the right of the current interval. */

* @brief Reset the join and steal counters, must be outside a fork-join region. */

* @brief Set the stacklet object to point at a new stacklet. * * Returns the previous stacklet. */

* @brief Cold path in `unsafe_rethrow_if_exception` in its own non-inline function. */

* @brief A no-op. */

* @brief A no-op. */

* @brief A no-op. */

* @brief A no-op. */

condense state into string to display during debugging */

* @brief Utility function. */

* @brief Utility function. */

* @brief schedule a job to the owned worker context. */

* @brief schedule suspended tasks to the context, supports concurrent submission. * * This will trigger the notification function. */

* @brief Schedule a task for execution. */

* @brief Schedule a job on a random worker. */

* @brief Run a job inline. */

* @brief Schedule a job on a random worker. */

* @brief Schedule a task for execution. */