foundation_core 0.0.6

/// Delay devises a way for Iterators to communicate a delay of the completion
/// of an operation without requiring the caller to be forced to be blocked
/// till the operation is done. This is similar to the async/await model where
/// operations that need completion can call `func().await` to signal the runtime
/// to pause that operation till the underlying response is ready.
/// We replicate similar but in an Iterator only world.
///
/// One interesting question is what does a delay mean:
///
/// 1. In one sense this can be the delay result of a one time operation
///    upon which completion we get our result from the `Delayed::Done` option at
///    which point we can expect no further results.
/// 2. But in another sense can also represent a re-occurring operation that will be
///    delayed a specific period of time upon which after completion, may or may not repeat.
///
#[derive(Clone, Debug, PartialEq, Eq, Hash)]
pub enum Delayed<T> {
    /// Pending represents to the receiver two important information:
    ///
    /// 1. The actual time instant when the delay began (think) of this
    ///    as the actual beginning when we start to count time (start of time)
    ///    for the delayed output
    ///
    /// 2. The total duration upon which we will be delayed from the start of time.
    ///
    /// 3. The remaining duration left until the delay is finished
    ///    (this is more of a bonus).
    ///
    /// This allows more communication about an operation still awaiting completion.
    Pending(std::time::Instant, std::time::Duration, std::time::Duration),

    /// Ready is the final state where we consider the delay
    /// finished/ended with relevant result.
    Done(T),
}

/// `DelayedTaskResolver` are types implementing this trait to
/// perform final resolution of a task when the task emits
/// the relevant `Delayed::Ready` enum state.
///
/// Unlike `DelayedMapper` these implementing types do
/// not care about the varying states of a `DelayedTaskIterator`
/// but about the final state of the task when it signals
/// it's readiness via the `Delayed::Ready` state.
pub trait DelayedReadyResolver<D> {
    fn handle(&self, item: Delayed<D>);
}

pub type BoxedDelayedReadyResolver<D> = Box<dyn DelayedReadyResolver<D>>;

/// `DelayedIterator` represents a new type of iterator that represents an operation
/// that is to be completed at some future point in time due to a delay.
///
/// Unlike an async operation where we do not know when it is done, a delayed operation
/// stipulates when it begins that an operation is delayed till some duration of time
/// is done at which you can expect the result in a `Delayed::Done` response.
///
/// `DelayedIterators` can be thought of as two forms:
///
/// 1. In one sense this can be the delay result of a one time operation
///    upon which completion we get our result from the `Delayed::Done` option at
///    which point we can expect no further results.
///
/// 2. But in another sense can also represent a re-occurring operation that will be
///    delayed a specific period of time upon which after completion, may or
///    may not repeat.
///
/// Each response from the iterator is either a `Delayed::Pending` marking
/// an operation as still delayed and to be completed. It provides the following pieces:
///
/// 1. The instant of time such delay began
/// 2. The total duration things will be delayed from the start of time in (1).
/// 3. The total duration left till it is completed.
///
/// And a `Delayed::Done` indicate the finalization of the operation and the underlying
/// result.
pub trait DelayedIterator {
    type Item;

    /// Advances the iterator and returns the next value.
    fn next(&mut self) -> Option<Delayed<Self::Item>>;

    /// `into_iter` consumes the implementation and wraps
    /// it in an iterator type that emits `Multi<MultiIterator::Item>`
    /// match the behavior desired for an iterator.
    fn into_iter(self) -> impl Iterator<Item = Delayed<Self::Item>>
    where
        Self: Sized + 'static,
    {
        DelayedAsIterator(Box::new(self))
    }
}

pub type BoxedDelayedIterator<D> = Box<dyn Iterator<Item = Delayed<D>>>;

pub struct DelayedAsIterator<T>(Box<dyn DelayedIterator<Item = T>>);

impl<T> DelayedAsIterator<T> {
    pub fn from_impl(t: impl DelayedIterator<Item = T> + 'static) -> Self {
        Self(Box::new(t))
    }

    #[must_use]
    pub fn new(t: Box<dyn DelayedIterator<Item = T>>) -> Self {
        Self(t)
    }
}

impl<T> Iterator for DelayedAsIterator<T> {
    type Item = Delayed<T>;

    fn next(&mut self) -> Option<Self::Item> {
        self.0.next()
    }
}

/// `SleepIterator` implements a custom non-thread pausing sleep operation
/// which implements the `DelayedIterator`.
///
/// It will keep responding with a `Delayed::Pending` till the time marked
/// for sleeping to end which indicates to the caller to perform whatever
/// task they were waiting for.
#[derive(Clone, Debug)]
pub struct SleepIterator<T>(std::time::Instant, std::time::Duration, Option<T>);

impl<T> SleepIterator<T> {
    pub fn new(from: std::time::Instant, until: std::time::Duration, value: T) -> Self {
        Self(from, until, Some(value))
    }

    pub fn until(duration: std::time::Duration, value: T) -> Self {
        let from = std::time::Instant::now();
        Self(from, duration, Some(value))
    }
}

impl<T> DelayedIterator for SleepIterator<T> {
    type Item = T;

    fn next(&mut self) -> Option<Delayed<Self::Item>> {
        self.2.as_ref()?;

        let now = std::time::Instant::now();
        let result = match self.0.checked_add(self.1) {
            Some(completed_at) => match completed_at.checked_duration_since(now) {
                Some(diff) => Delayed::Pending(self.0, self.1, diff),
                _ => Delayed::Done(self.2.take().expect("item should not be taken yet")),
            },
            _ => Delayed::Done(self.2.take().expect("item should not be taken yet")),
        };

        Some(result)
    }
}