Articulations: for incrementally-changing data/computation.
Introduced by (produced by)
Eliminated by (consumed by)
The term Art stands for two things here:
Adapton Reference / Thunk, and
Articulation, for naming and discretizing incrementally-changing data (and computations).
Each art has a unique identity, its
Because this identity, each art permits efficient (O(1) time)
hashing and equality checks.
The concept of an art abstracts over whether the producer is
eager (like a ref
cell) or lazy (like a
thunk). One uses
force to inspect both eager and lazy arts. Consequently, code
that consumes structures with arts need only ever use
two different functions, depending on whether the art is lazy or
fn hash_slice<H>(data: &[Self], state: &mut H) where1.3.0[src]
impl<T> StructuralEq for Art<T>[src]
impl<T> StructuralPartialEq for Art<T>[src]
impl<T> !RefUnwindSafe for Art<T>
impl<T> !UnwindSafe for Art<T>
type Owned = T
The resulting type after obtaining ownership.
fn clone_into(&self, target: &mut T)[src]
type Error = Infallible
The type returned in the event of a conversion error.