pbt 0.5.10

High-throughput property-based testing with `derive`, swarm-testing, precise sizing, and full graph-theoretic type analysis over mutually inductive and uninstantiable types.
Documentation
//! Opaque internal data necessary to
//! register a type with the global type reflection graph.

use {
    crate::{
        Pbt,
        reflection::{BucketOps, Constructors, Erased},
    },
    ahash::HashMap,
    alloc::collections::BTreeMap,
    core::any::TypeId,
};

/// Opaque internal data necessary to
/// register a type with the global type reflection graph.
#[non_exhaustive]
pub struct Registration<'lock> {
    /// Erased function pointers performing operations on vectors of this type.
    pub(crate) bucket_ops: &'lock mut HashMap<TypeId, BucketOps<Erased>>,
    /// The global "naive" variant graph including uninstantiable structures.
    pub(crate) variants: &'lock mut BTreeMap<TypeId, Constructors<Erased>>,
}

impl Registration<'_> {
    /// Register the type `T` and its dependencies
    /// in a naive type reflection graph,
    /// including any uninstantiable variants.
    #[inline]
    #[expect(
        clippy::missing_panics_doc,
        reason = "Internal invariants: violations should fail loudly."
    )]
    pub fn register<T>(&mut self)
    where
        T: Pbt,
    {
        // If this type has already been registered, short-circuit:
        let ty = TypeId::of::<T>();
        if self
            .bucket_ops
            .insert(ty, BucketOps::<T>::derive().erase())
            .is_some()
        {
            return;
        }

        // Recurse, i.e. run depth-first search:
        let constructors = T::register(self).erase();
        let dup: Option<_> = self.variants.insert(ty, constructors);
        assert!(
            dup.is_none(),
            "INTERNAL ERROR (`pbt`): TOCTOU despite `&mut` (witchcraft)",
        );
    }
}