scientific-workflow 0.8.1

//! Template-defined, heterogeneous scientific system states.
//!
//! This module is the complete public boundary for describing one scientific
//! system at a particular time point. A program first loads a JSON template
//! into [`SystemStateSchema`], constructs its initial blank [`SystemState`], and then
//! moves concrete Rust payloads into and out of the declared fields.
//!
//! # Public workflow
//!
//! 1. Load and validate a template with [`SystemStateSchema::load_json_template`].
//! 2. Create the initial state with [`SystemStateSchema::create_empty_state`].
//! 3. Assemble payload types and owners with [`SystemState::insert_payload`].
//! 4. Borrow, mutate, or extract payloads through [`SystemState`].
//!    Coordinated kernels use [`SystemState::borrow_payloads`] or
//!    [`SystemState::borrow_payloads_mut`] with matching type and field-name tuples.
//! 5. Mutate time through [`SystemState::replace_simulation_time`] or
//!    [`SystemState::advance_simulation_time`].
//! 6. Create later blank states with
//!    [`SystemState::clone_structure_without_payloads`].
//!
//! The template fixes field names, field order, and optional human-facing
//! descriptions. It contains no Rust type or storage codec information.
//! Individual payload slots may be empty, but callers cannot add, remove, or
//! reorder fields after the template is loaded. First insertion binds a slot's
//! concrete Rust type. That contract survives extraction and clearing and is
//! inherited by blank states derived from an assembled instance.
//!
//! Every inserted payload implements Serde `Serialize`, `Clone`, `Send`, and
//! `'static`. Serialization is supplied by the payload type itself; this
//! module only retains a private borrowed erased view for the future storage
//! encoder. It does not select JSON framing or perform IO.
//!
//! # Boundary
//!
//! `system_state` owns schema declaration, field indexing, and owned in-memory
//! evolution of typed payloads. It does not own persistence formats, execution
//! controls, scheduling, sampling decisions, artifact publication, or RNG
//! provenance.
//!
//! # Ownership
//!
//! [`SystemState::insert_payload`] consumes a concrete payload without cloning it. An
//! insertion into an empty slot returns `None`; replacement returns the
//! previous payload as `Some(T)`, preserving its ownership instead of dropping
//! it. A rejected insertion returns [`PayloadInsertError<T>`], from which the unchanged
//! incoming payload can be recovered.
//!
//! [`SystemState::take_payload`] moves a stored payload back to the caller. Together,
//! insertion and extraction allow large scientific allocations to cross the state
//! boundary without copying their contents. Explicitly cloning a
//! [`SystemState`] is intentionally different: it creates a new erased box and
//! invokes each populated payload's `Clone` implementation. Clone depth is
//! therefore defined by the concrete payload type.
//!
//! The public insertion contract deliberately makes replacement visible:
//!
//! ```no_run
//! use scientific_workflow::system_state::{SystemStateSchema, SimulationTime};
//!
//! # fn example(spec: &SystemStateSchema) -> Result<(), Box<dyn std::error::Error>> {
//! let mut state = spec.create_empty_state(SimulationTime::from_iteration(0));
//!
//! let previous = state.insert_payload("population", vec![1_u64, 2, 3])?;
//! assert!(previous.is_none());
//!
//! let previous = state.insert_payload("population", vec![4_u64, 5, 6])?;
//! assert_eq!(previous, Some(vec![1, 2, 3]));
//!
//! let time = state.advance_simulation_time(None)?;
//! assert_eq!(time.iteration(), 1);
//! # Ok(())
//! # }
//! ```
//!
//! Ignoring a successful replacement result would drop the displaced payload.
//! Callers should bind or explicitly drop the returned `Option<T>` so that
//! ownership disposal is intentional.
//!
//! # Encapsulation
//!
//! Runtime type erasure and boxing are private implementation details.
//! Downstream crates interact only with concrete types through generic state
//! methods. Template parsing representations, compact field indices, and
//! name-to-slot lookup tables are likewise hidden behind the public types
//! re-exported below.
//!
//! Type erasure remains limited to the private heterogeneous owner. Concrete
//! payload types and runtime identities are retained, and serialization
//! erasure is borrowed only when storage explicitly requests it.

mod error;
mod schema;
mod state;
mod value;

pub use error::{PayloadInsertError, StateError};
pub use schema::{StateFieldSchema, SystemStateSchema};
#[doc(hidden)]
pub use state::PayloadTuple;
pub use state::{SimulationTime, SystemState};

/// A state-bearing value from which persistent-recording layout can be derived.
///
/// Both [`SystemState`] and [`SystemStateSchema`] implement this trait. Passing
/// a live state is the natural choice for a new recording; passing a schema is
/// useful when a continuation writer must be configured before checkpoint
/// reconstruction. Writer builders retain only the cheap shared schema handle.
pub trait StateSchemaSource {
    /// Returns the immutable schema that defines the state's field layout.
    fn state_schema(&self) -> &SystemStateSchema;
}

impl StateSchemaSource for SystemState {
    fn state_schema(&self) -> &SystemStateSchema {
        self.schema()
    }
}

impl StateSchemaSource for SystemStateSchema {
    fn state_schema(&self) -> &SystemStateSchema {
        self
    }
}