Struct NullPartition 

pub struct NullPartition<H: HostTypes> { /* private fields */ }

Resolver-absent default Partition<H>. Embeds inline stubs for every sub-trait associated type so Partition<H> accessors return references to fields rather than to statics. The only meaningful state is the fingerprint; everything else uses HostTypes::EMPTY_* defaults. Returned by the three witness trait impls’ left_factor / right_factor / left_summand / etc. accessors as the resolver-absent value pathway. Consumers needing real partition data pair the sibling PartitionHandle with a PartitionResolver instead.

Implementations

impl<H: HostTypes> NullPartition<H>

pub const ABSENT: NullPartition<H>

Phase 2 (orphan-closure): absent-value sentinel used by Null stubs in other namespaces to satisfy &Self::Partition return borrows.

pub fn from_fingerprint(fingerprint: ContentFingerprint) -> Self

Construct a NullPartition with the given content fingerprint. All other fields are resolver-absent defaults.

pub const fn fingerprint(&self) -> ContentFingerprint

Returns the content fingerprint identifying which Partition this stub stands in for.

Trait Implementations

impl<H: Clone + HostTypes> Clone for NullPartition<H>

fn clone(&self) -> NullPartition<H>

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<H: Debug + HostTypes> Debug for NullPartition<H>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<H: Hash + HostTypes> Hash for NullPartition<H>

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl<H: PartialEq + HostTypes> PartialEq for NullPartition<H>

fn eq(&self, other: &NullPartition<H>) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<H: HostTypes> Partition<H> for NullPartition<H>

type IrreducibleSet = NullIrreducibleSet<H>

Associated type for IrreducibleSet.

type ReducibleSet = NullReducibleSet<H>

Associated type for ReducibleSet.

type UnitGroup = NullUnitGroup<H>

Associated type for UnitGroup.

type Complement = NullComplement<H>

Associated type for Complement.

type TypeDefinition = NullTypeDefinition<H>

Associated type for TypeDefinition.

type FreeRank = NullFreeRank<H>

Associated type for FreeRank.

type TagSite = NullTagSite<H>

Associated type for TagSite.

fn irreducibles(&self) -> &Self::IrreducibleSet

The irreducible component of this partition.

fn reducibles(&self) -> &Self::ReducibleSet

The reducible component of this partition.

fn units(&self) -> &Self::UnitGroup

The units component of this partition.

fn exterior(&self) -> &Self::Complement

The exterior component of this partition.

fn density(&self) -> H::Decimal

The irreducible density of this partition: |Irr| / |A|, where A is the active carrier.

fn source_type(&self) -> &Self::TypeDefinition

The type declaration that was resolved to produce this partition.

fn witt_length(&self) -> u64

The Witt level n at which this partition was computed. The ring has 2^n elements at this level.

fn site_budget(&self) -> &Self::FreeRank

The site budget associated with this partition.

fn is_exhaustive(&self) -> bool

Whether the four components of this partition are exhaustive over R_n: |Irr| + |Red| + |Unit| + |Ext| = 2^n (FPM_8). Set by the kernel after verification.

fn tag_site_of(&self) -> &Self::TagSite

The tag site distinguishing the variants of a PartitionCoproduct. Logically distinct from every data site of either operand (ST_6) and carries the ln 2 entropy quantum of ST_2.

fn product_category_level(&self) -> &H::HostString

The categorical level at which this construction is a product / coproduct. Values: ‘partition_classification’ (PartitionProduct, PartitionCoproduct), or ‘nerve_topology’ (CartesianPartitionProduct). Prevents misreading the product vs coproduct distinction across levels.

impl<H: Copy + HostTypes> Copy for NullPartition<H>

impl<H: Eq + HostTypes> Eq for NullPartition<H>

impl<H: HostTypes> StructuralPartialEq for NullPartition<H>