Remove a type from this `Extensions`. If a extension of this type existed, it will be returned. # Example ``` # use harpc_tower::Extensions; let mu

Returns a [`TargetBitSet`] of execution targets that can cover the statement at `index`. A target is supported when its [`Cost`] entry is present for

Computes the transitive closure in-place using the Warshall algorithm. After this operation, `self.contains(i, j)` is `true` if and only if there exi

Converts a KPC return code into a [`Result`], using `error` to construct the [`SamplerError`] variant for non-zero codes.

Creates a type mismatch diagnostic with specific labels for the left and right types.

Unifies two variables into the same equivalence class. Constraint merging must be handled separately to avoid data loss.

Unregisters an action from the database. # Errors - [`HasChildren`] if the action has children which must be unregistered first - [`StoreError`] if

Configures depth-based recursion tracking. Uses a simple counter to limit nesting depth. When `max_depth` is `None`, defaults to 32 levels. This is l

Adds a list of policies to the policy set. # Errors Returns an error if the policy is not valid.

Returns mutable access to the basic blocks without invalidating cached data. # Contract The caller must ensure that no modifications change the cont

Bind this configuration to a [`PropertyType`] catalog to create a distribution. [`PropertyType`]: type_system::ontology::property_type::PropertyType

Builds an `EntityPathBitSet` from a list of paths using `insert` (swallowing).

Processes a node within a normalization boundary. Boundaries define scopes where [`Binding`] accumulation occurs before being wrapped into a [`Let`]

Group an observation set into per-month timing buckets (records-derive).

Creates a caller/callee pair for heuristics testing.