pub enum ClaimKind {
AtomExists {
atom: usize,
},
BindingEdge {
a: usize,
b: usize,
},
GeometryKind {
atom: usize,
kind: String,
},
Custom {
label: String,
},
}Expand description
What one structural claim asserts about the dictionary. One e-process
runs per claim; the kinds mirror the discovery stack’s claim surface:
atom existence (#976 birth), binding edges (#975), geometry
adjudication (#907). Custom keeps the ledger open to claim types
that do not exist yet without an enum churn per new discovery gate.
Variants§
AtomExists
“Atom atom is statistically real” — the K vs K+1 birth claim.
BindingEdge
“Atoms a and b are bound” — a #975 binding edge.
GeometryKind
“Atom atom’s latent geometry is kind” (e.g. “circle”,
“clusters”, “line”) — a #907 adjudication claim.
Custom
Any other structural claim, labeled.
Trait Implementations§
Source§impl<'de> Deserialize<'de> for ClaimKind
impl<'de> Deserialize<'de> for ClaimKind
Source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read more
impl Eq for ClaimKind
impl StructuralPartialEq for ClaimKind
Auto Trait Implementations§
impl Freeze for ClaimKind
impl RefUnwindSafe for ClaimKind
impl Send for ClaimKind
impl Sync for ClaimKind
impl Unpin for ClaimKind
impl UnsafeUnpin for ClaimKind
impl UnwindSafe for ClaimKind
Blanket Implementations§
impl<T> Allocation for T
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
impl<ST, DT> CastableFrom<ST, Initialized, Initialized> for DT
impl<ST, DT> CastableFrom<ST, Uninit, Uninit> for DT
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> DeserializeOwned for Twhere
T: for<'de> Deserialize<'de>,
Source§impl<T> DistributionExt for Twhere
T: ?Sized,
impl<T> DistributionExt for Twhere
T: ?Sized,
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
impl<T, U> Imply<T> for U
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left is true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left(&self) returns true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§impl<T> Pointable for T
impl<T> Pointable for T
impl<T> Read<Exclusive, BecauseExclusive> for Twhere
T: ?Sized,
impl<T> Scalar for T
Source§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
Source§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self from the equivalent element of its
superset. Read moreSource§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if
self is actually part of its subset T (and can be converted to it).Source§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset but without any property checks. Always succeeds.Source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.