fusor-core 0.1.5

//! Coherent async views and their loading status.
//!
//! Supply an [`AsyncBoundary`] to one `<Async>` region to coordinate its reads.
//! Its [`BoundaryStatus`] reports when the complete view is ready or a read has
//! failed. Keep status displays and retry controls outside the region so they
//! remain usable while it is pending.
use crate::{
    Effect, OwnerHandle, Registration, Signal, batch, effect, signal, untrack, versions::Versions,
};
use std::{
    cell::{Cell, RefCell},
    collections::BTreeMap,
    rc::{Rc, Weak},
};

/// Version of the supported renderer preparation and coherent-read contract.
///
/// This covers this module, [`crate::versions::Versions`], and
/// [`Signal::with_render_value`]. A change to their integration semantics bumps
/// this version. It is independent of the browser template format and of any
/// external renderer's generated-code protocol.
#[doc(hidden)]
pub const VERSION: u32 = 2;

#[derive(Clone, Debug, PartialEq, Eq)]
pub enum BoundaryStatus {
    Detached,
    Pending,
    Ready,
    Error(String),
    Faulted(String),
    Disposed,
}

/// A speculative read lifetime, distinct from a component's owner lifetime.
///
/// Reads may start before owner activation. The boundary cancels leases when
/// their inputs become obsolete, they leave the read set, or it is disposed.
#[doc(hidden)]
pub trait ReadLease {
    /// Invalidate delivery and request cancellation. Must tolerate repeated calls;
    /// cancellation does not roll back external work or await its termination.
    fn cancel(&self);
}

/// A renderer-owned candidate update. Dropping it releases unpublished patches.
/// A renderer may retain prepared scopes across discovery passes in one attempt;
/// use [`Attempt::on_invalidate`] to retire them when the input epoch ends.
///
/// Formatting, constructors, key comparisons and fallible target setup belong
/// in evaluation or [`Self::validate`], before any visible mutation. The boundary
/// validates source versions both before and after renderer validation.
#[doc(hidden)]
pub trait Publication {
    /// Check that all prepared operations can still target the intended nodes.
    /// An error preserves the previously published scene and reports `Error`.
    fn validate(&self) -> Result<(), String>;
    /// Apply the validated update synchronously, without application callbacks,
    /// signal writes, constructors, formatting, or other fallible preparation.
    /// An unexpected failure reports `Faulted`; the boundary cannot undo a
    /// renderer's partial scene mutation. Successful application and finishing
    /// run within one reactive batch.
    fn apply(&mut self) -> Result<(), String>;
    /// Finish a successful publication: activate adopted owners and retire old
    /// scopes in the renderer's documented order. Application callbacks may run
    /// here, so release mutable scene borrows first. Input changes during this
    /// phase are detected before the boundary declares the scene ready.
    fn finish(self: Box<Self>);
}

type Evaluate = dyn Fn(&Attempt) -> Result<Box<dyn Publication>, String>;

struct Inner {
    id: u64,
    status: Signal<BoundaryStatus>,
    wake: Signal<u64>,
    retry: Cell<u64>,
    epoch: Cell<u64>,
    attached: Cell<bool>,
    alive: Cell<bool>,
    driving: Cell<bool>,
    violation: RefCell<Option<String>>,
    rejected_retry: Cell<Option<u64>>,
    inputs: RefCell<Versions>,
    reads: RefCell<BTreeMap<u64, Rc<dyn ReadLease>>>,
    candidates: RefCell<Vec<Box<dyn FnOnce()>>>,
}

thread_local! {
    static NEXT: Cell<u64> = const { Cell::new(0) };
    static EVALUATING: RefCell<Vec<Weak<Inner>>> = const { RefCell::new(Vec::new()) };
    // The length of EVALUATING, readable without a borrow on every write.
    static EVALUATION_DEPTH: Cell<usize> = const { Cell::new(0) };
    static PREPARING: RefCell<Option<OwnerHandle>> = const { RefCell::new(None) };
}

/// A stable handle. Attach it to exactly one live `Async` region. Read
/// status and put selection/retry controls outside that region.
#[derive(Clone)]
pub struct AsyncBoundary(Rc<Inner>);

impl AsyncBoundary {
    pub fn coherent() -> Self {
        let id = NEXT.with(|next| {
            let id = next.get().checked_add(1).expect("boundary id overflow");
            next.set(id);
            id
        });
        Self(Rc::new(Inner {
            id,
            status: signal(BoundaryStatus::Detached),
            wake: signal(0),
            retry: Cell::new(0),
            epoch: Cell::new(0),
            attached: Cell::new(false),
            alive: Cell::new(true),
            driving: Cell::new(false),
            violation: RefCell::new(None),
            inputs: RefCell::new(Versions::default()),
            rejected_retry: Cell::new(None),
            reads: RefCell::new(BTreeMap::new()),
            candidates: RefCell::new(Vec::new()),
        }))
    }

    pub fn status(&self) -> BoundaryStatus {
        let cycle = EVALUATING.with(|stack| {
            if stack
                .borrow()
                .iter()
                .filter_map(Weak::upgrade)
                .any(|inner| inner.id == self.0.id)
            {
                *self.0.violation.borrow_mut() =
                    Some("a coherent region cannot read its own boundary status".into());
                true
            } else {
                false
            }
        });
        if cycle {
            self.0.status.get_untracked()
        } else {
            self.0.status.get()
        }
    }

    pub fn pending(&self) -> bool {
        self.status() == BoundaryStatus::Pending
    }
    pub fn is_interactive(&self) -> bool {
        self.status() == BoundaryStatus::Ready
    }

    /// Explicitly retry failed reads. Compatible successes remain reusable.
    pub fn retry(&self) {
        if self.0.alive.get() {
            self.0
                .retry
                .set(self.0.retry.get().checked_add(1).expect("retry overflow"));
            self.0.wake.update(|n| *n += 1);
        }
    }

    /// Attach one renderer to this boundary and retain the returned mount.
    ///
    /// Evaluation can begin immediately, even while `owner` is prepared. It
    /// collects reactive dependencies and speculative reads, and must be pure
    /// apart from read discovery. Use [`prepare_state`] for candidate constructor
    /// effects. Pending reads or evaluation/validation errors discard the new
    /// publication. The renderer remains responsible for staging nodes, guarding
    /// interaction while pending, and retaining the previous scene.
    ///
    /// Disposal is permanent: a boundary cannot attach again after its mount or
    /// owner has been disposed. This method does not commit the supplied owner.
    #[doc(hidden)]
    pub fn attach(
        &self,
        owner: &OwnerHandle,
        evaluate: impl Fn(&Attempt) -> Result<Box<dyn Publication>, String> + 'static,
    ) -> Result<BoundaryMount, String> {
        if !self.0.alive.get() || owner.is_disposed() {
            return Err("cannot attach a disposed async boundary".into());
        }
        if self.0.attached.replace(true) {
            return Err("an async boundary can only attach once".into());
        }
        let inner = Rc::downgrade(&self.0);
        let cleanup = owner.on_cleanup(move || {
            if let Some(inner) = inner.upgrade() {
                dispose(&inner);
            }
        });
        let weak = Rc::downgrade(&self.0);
        let owner = owner.clone();
        let evaluate: Rc<Evaluate> = Rc::new(evaluate);
        let subscription = effect(move || {
            if let Some(inner) = weak
                .upgrade()
                .filter(|inner| inner.alive.get() && !owner.is_disposed())
            {
                Versions::exclude(|| {
                    inner.wake.get();
                });
                drive(&inner, &*evaluate);
            }
        });
        Ok(BoundaryMount {
            inner: Rc::downgrade(&self.0),
            subscription,
            _cleanup: cleanup,
        })
    }
}

/// Retained by the renderer. Dropping it cancels candidate reads and subscriptions.
#[must_use = "retain the mount for as long as the coherent region is mounted"]
#[doc(hidden)]
pub struct BoundaryMount {
    inner: Weak<Inner>,
    subscription: Effect,
    _cleanup: Registration,
}
impl Drop for BoundaryMount {
    fn drop(&mut self) {
        self.subscription.dispose();
        if let Some(inner) = self.inner.upgrade() {
            dispose(&inner);
        }
    }
}

fn dispose(inner: &Inner) {
    if !inner.alive.replace(false) {
        return;
    }
    let reads = inner.reads.take();
    for read in reads.into_values() {
        read.cancel();
    }
    discard_candidates(inner);
    inner.status.set(BoundaryStatus::Disposed);
}

fn discard_candidates(inner: &Inner) {
    let candidates = inner.candidates.take();
    untrack(|| {
        for cleanup in candidates {
            cleanup();
        }
    });
}

/// Weak lifetime witness used by read declarations that outlive a mounted view.
#[doc(hidden)]
pub struct BoundaryLifetime(Weak<Inner>);
impl BoundaryLifetime {
    /// Whether the boundary remains attached or available to attach.
    pub fn is_live(&self) -> bool {
        self.0.upgrade().is_some_and(|inner| inner.alive.get())
    }
}

/// One discovery pass in the current attempt. An unresolved read records pending
/// and returns normally; no exception, panic, or unwinding implements suspension.
#[doc(hidden)]
pub struct Attempt {
    inner: Weak<Inner>,
    epoch: u64,
    pending: Cell<bool>,
    reads: RefCell<BTreeMap<u64, Rc<dyn ReadLease>>>,
}
impl Attempt {
    /// A weak witness for declarations retained beyond the current evaluation.
    pub fn boundary_lifetime(&self) -> BoundaryLifetime {
        BoundaryLifetime(self.inner.clone())
    }
    /// Stable identity of this boundary; zero only after its lifetime expires.
    pub fn boundary_id(&self) -> u64 {
        self.inner.upgrade().map_or(0, |inner| inner.id)
    }
    /// Candidate input generation. Changes when captured source versions change.
    pub fn epoch(&self) -> u64 {
        self.epoch
    }
    /// Retire prepared state when this input epoch ends or the boundary is
    /// disposed, even if its renderer slot is never visited again. Register once
    /// per slot and epoch, normally capturing a weak slot reference. The callback
    /// runs untracked and without internal borrows held.
    /// Pending passes and retries within the same epoch keep the candidate alive.
    pub fn on_invalidate(&self, cleanup: impl FnOnce() + 'static) {
        if let Some(inner) = self
            .inner
            .upgrade()
            .filter(|inner| inner.alive.get() && inner.epoch.get() == self.epoch)
        {
            inner.candidates.borrow_mut().push(Box::new(cleanup));
        } else {
            untrack(cleanup);
        }
    }
    /// Explicit retry generation, used by read adapters to retry failed reads.
    pub fn retry_generation(&self) -> u64 {
        self.inner.upgrade().map_or(0, |inner| inner.retry.get())
    }
    /// Record an unresolved read. Evaluation returns normally to discover other
    /// reads, but this pass cannot publish.
    pub fn pending(&self) {
        self.pending.set(true);
    }
    /// Retain a read under an identity stable across discovery passes. Different
    /// read declarations must use different IDs within a boundary. Re-registering
    /// the same declaration in one pass replaces its lease.
    pub fn register(&self, id: u64, lease: Rc<dyn ReadLease>) {
        self.reads.borrow_mut().insert(id, lease);
    }
    /// Wake this boundary after a read completes. Notifications from obsolete
    /// epochs or disposed boundaries are ignored. Adapters must separately guard
    /// their result delivery using their own cancellation/request generations.
    pub fn notifier(&self) -> impl Fn() + 'static {
        let weak = self.inner.clone();
        let epoch = self.epoch;
        move || {
            if let Some(inner) = weak
                .upgrade()
                .filter(|inner| inner.alive.get() && inner.epoch.get() == epoch)
            {
                inner.wake.update(|n| *n += 1);
            }
        }
    }
}

struct Evaluation;
impl Drop for Evaluation {
    fn drop(&mut self) {
        EVALUATING.with(|stack| {
            stack.borrow_mut().pop();
        });
        EVALUATION_DEPTH.set(EVALUATION_DEPTH.get() - 1);
    }
}
struct Driving<'a>(&'a Cell<bool>);
impl Drop for Driving<'_> {
    fn drop(&mut self) {
        self.0.set(false);
    }
}

fn drive(inner: &Rc<Inner>, evaluate: &Evaluate) {
    if inner.rejected_retry.get() == Some(inner.retry.get()) {
        return;
    }
    if inner.driving.replace(true) {
        return;
    }
    let _driving = Driving(&inner.driving);
    inner.status.set(BoundaryStatus::Pending);
    let versions = inner.inputs.borrow().clone();
    if !untrack(|| versions.is_current()) || inner.epoch.get() == 0 {
        inner
            .epoch
            .set(inner.epoch.get().checked_add(1).expect("attempt overflow"));
        let reads = inner.reads.take();
        for read in reads.into_values() {
            read.cancel();
        }
        discard_candidates(inner);
    }
    if !inner.alive.get() {
        return;
    }
    inner.violation.take();
    let attempt = Attempt {
        inner: Rc::downgrade(inner),
        epoch: inner.epoch.get(),
        pending: Cell::new(false),
        reads: RefCell::new(BTreeMap::new()),
    };
    EVALUATING.with(|stack| stack.borrow_mut().push(Rc::downgrade(inner)));
    EVALUATION_DEPTH.set(EVALUATION_DEPTH.get() + 1);
    let guard = Evaluation;
    let (result, inputs) = Versions::capture(|| evaluate(&attempt));
    drop(guard);
    let old = inner.reads.replace(attempt.reads.take());
    let removed: Vec<_> = old
        .into_iter()
        .filter(|(id, _)| !inner.reads.borrow().contains_key(id))
        .map(|(_, lease)| lease)
        .collect();
    for lease in removed {
        lease.cancel();
    }
    *inner.inputs.borrow_mut() = inputs.clone();
    if !inner.alive.get() {
        return;
    }
    publish_attempt(inner, &attempt, inputs, result);
}

fn publish_attempt(
    inner: &Rc<Inner>,
    attempt: &Attempt,
    inputs: Versions,
    result: Result<Box<dyn Publication>, String>,
) {
    let result = match inner.violation.take() {
        Some(error) => {
            inner.rejected_retry.set(Some(inner.retry.get()));
            Err(error)
        }
        None => result,
    };
    let mut publication = match result {
        Ok(publication) => publication,
        Err(error) => {
            inner.status.set(BoundaryStatus::Error(error));
            return;
        }
    };
    if attempt.pending.get() || !untrack(|| inputs.is_current()) {
        inner.status.set(BoundaryStatus::Pending);
        return;
    }
    if let Err(error) = publication.validate() {
        inner.status.set(BoundaryStatus::Error(error));
        return;
    }
    if !inner.alive.get() || !untrack(|| inputs.is_current()) {
        inner.status.set(BoundaryStatus::Pending);
        return;
    }
    batch(|| {
        if let Err(error) = publication.apply() {
            inner.status.set(BoundaryStatus::Faulted(error));
            return;
        }
        // Keep the guard through activation. Synchronous activation effects may
        // invalidate these inputs and must never be overwritten by Ready.
        publication.finish();
        if inner.alive.get() {
            inner.status.set(if untrack(|| inputs.is_current()) {
                BoundaryStatus::Ready
            } else {
                BoundaryStatus::Pending
            });
        }
    });
}

/// Record a write inside a coherent evaluation. Every signal write checks this,
/// so the idle check inlines into callers.
#[inline]
pub(crate) fn mutation(operation: &str) -> bool {
    EVALUATION_DEPTH.get() != 0 && evaluating_mutation(operation)
}

#[cold]
fn evaluating_mutation(operation: &str) -> bool {
    EVALUATING.with(|stack| {
        let inner = stack.borrow().last().and_then(Weak::upgrade);
        if let Some(inner) = inner {
            *inner.violation.borrow_mut() = Some(format!(
                "coherent render evaluation must be pure: {operation}"
            ));
            true
        } else {
            false
        }
    })
}

pub(crate) fn preparing_owner() -> Option<OwnerHandle> {
    PREPARING.with(|owner| owner.borrow().clone())
}

/// Construct candidate state with effects gated by the supplied owner.
///
/// If the owner is not active, effects created inside `make` first run when it
/// activates and stop when it is disposed, even if their handles are retained.
/// Retain those effect handles as usual. Nested calls restore the previous owner,
/// including during unwinding.
///
/// An already active owner preserves ordinary immediate effect timing and does
/// not adopt those effects for cleanup. This function neither commits the owner
/// nor validates or rolls back renderer work. Ordinary constructors should not
/// use it unless staged effects are intended: outside this explicit preparation
/// context, [`effect`] runs immediately even when an unrelated owner is prepared.
/// Speculative async reads have separate leases and may start before activation.
#[doc(hidden)]
pub fn prepare_state<R>(owner: OwnerHandle, make: impl FnOnce(OwnerHandle) -> R) -> R {
    struct Restore(Option<OwnerHandle>);
    impl Drop for Restore {
        fn drop(&mut self) {
            PREPARING.with(|owner| *owner.borrow_mut() = self.0.take());
        }
    }
    let _restore = Restore(PREPARING.with(|previous| previous.replace(Some(owner.clone()))));
    make(owner)
}