#[repr(transparent)]pub struct TopologyInvariants(pub u16);Expand description
Structural, modal, and homological invariants enforced on a HarbouredGraph and its host Geometry.
Tuple Fields§
§0: u16Implementations§
Source§impl TopologyInvariants
impl TopologyInvariants
pub const EMPTY: Self
Sourcepub const TRANSITIVE: Self
pub const TRANSITIVE: Self
Implicit reachability closure.
Sourcepub const REIFIED_EDGES: Self
pub const REIFIED_EDGES: Self
Edges resolve to .q42 NQuin IDs / RDF-Star TAG_EMBEDDED virtual IDs.
Sourcepub const SPATIAL_METRIC: Self
pub const SPATIAL_METRIC: Self
Edge weights derived from .10d Euclidean / geodesic / Fisher-Rao distance.
Sourcepub const TEMPORAL_MONOTONIC: Self
pub const TEMPORAL_MONOTONIC: Self
Edges must advance monotonically along Tensor10D.t (d_6) and Lamport clock (metadata[32..60]).
Sourcepub const DEONTIC_GUARDED: Self
pub const DEONTIC_GUARDED: Self
Reject or gate edges carrying active OP_FORBID (0x12) without a valid DEFEATER_BIT.
Sourcepub const PARACONSISTENT_ISOLATED: Self
pub const PARACONSISTENT_ISOLATED: Self
Contradictory BelnapStatus::Both (0x32) vertices/edges are isolated to quarantine sub-context.
Sourcepub const MANIFOLD_CLOSED: Self
pub const MANIFOLD_CLOSED: Self
Closed manifold homology invariant (no unsealed boundary 1-cells: ∂² = 0).
Sourcepub const SENSITIVITY_MONOTONIC: Self
pub const SENSITIVITY_MONOTONIC: Self
Enforce non-increasing sensitivity class (context[56..63]) across directed edges (no classified leak).
Sourcepub const CHAIN_BOUNDARY_EXACT: Self
pub const CHAIN_BOUNDARY_EXACT: Self
Enforce chain-complex boundary exactness (∂_{k-1} ∘ ∂_k = 0).
pub const fn contains(self, other: Self) -> bool
pub const fn union(self, other: Self) -> Self
pub const fn bits(self) -> u16
pub const fn from_bits_truncate(bits: u16) -> Self
pub fn from_name(name: &str) -> Option<Self>
Trait Implementations§
Source§impl BitOr for TopologyInvariants
impl BitOr for TopologyInvariants
Source§impl BitOrAssign for TopologyInvariants
impl BitOrAssign for TopologyInvariants
Source§fn bitor_assign(&mut self, rhs: Self)
fn bitor_assign(&mut self, rhs: Self)
|= operation. Read moreSource§impl Clone for TopologyInvariants
impl Clone for TopologyInvariants
impl Copy for TopologyInvariants
Source§impl Debug for TopologyInvariants
impl Debug for TopologyInvariants
Source§impl Default for TopologyInvariants
impl Default for TopologyInvariants
Source§impl<'de> Deserialize<'de> for TopologyInvariants
impl<'de> Deserialize<'de> for TopologyInvariants
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>,
impl Eq for TopologyInvariants
Source§impl Hash for TopologyInvariants
impl Hash for TopologyInvariants
Source§impl PartialEq for TopologyInvariants
impl PartialEq for TopologyInvariants
impl Pod for TopologyInvariants
Source§impl Serialize for TopologyInvariants
impl Serialize for TopologyInvariants
impl StructuralPartialEq for TopologyInvariants
Auto Trait Implementations§
impl Freeze for TopologyInvariants
impl RefUnwindSafe for TopologyInvariants
impl Send for TopologyInvariants
impl Sync for TopologyInvariants
impl Unpin for TopologyInvariants
impl UnsafeUnpin for TopologyInvariants
impl UnwindSafe for TopologyInvariants
Blanket Implementations§
§impl<S, A> Aggregate<Result<S, Error>> for Awhere
A: Aggregate<S>,
impl<S, A> Aggregate<Result<S, Error>> for Awhere
A: Aggregate<S>,
impl<T> AnyBitPattern for Twhere
T: Pod,
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
impl<ST, DT> CastableFrom<ST, Initialized, Initialized> for DT
impl<ST, DT> CastableFrom<ST, Uninit, Uninit> for DT
§impl<T> CheckedBitPattern for Twhere
T: AnyBitPattern,
impl<T> CheckedBitPattern for Twhere
T: AnyBitPattern,
§type Bits = T
type Bits = T
Self must have the same layout as the specified Bits except for
the possible invalid bit patterns being checked during
is_valid_bit_pattern.§fn is_valid_bit_pattern(_bits: &T) -> bool
fn is_valid_bit_pattern(_bits: &T) -> bool
bits
as &Self.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>,
§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
key and return true if they are equal.§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
§impl<T> Instrument for T
impl<T> Instrument for T
§fn instrument(self, span: Span) -> Instrumented<Self> ⓘ
fn instrument(self, span: Span) -> Instrumented<Self> ⓘ
impl<T> Interleave for Twhere
T: Pod,
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> ⓘ
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> ⓘ
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 more