Delegates a call to a closure with a predetermined amount of inputs and outputs. # Errors This function returns a `Report<RemoteInvocationError>` in

Returns an iterator over (field name, value) pairs. # Examples ``` # #![feature(allocator_api)] # extern crate alloc; # use alloc::alloc::Global; #

Returns a mutable iterator over ID-element pairs. Similar to [`Iterator::enumerate`] but yields typed IDs instead of `usize` indices.

Runs the analysis to a fixed point using the provided allocator. Iterates over the control-flow graph, applying transfer functions and propagating st

* @param name the name of the queue. * @returns the number of items onf the queue

Starts listening for incoming connections on the specified address. # Errors This function will return an error if: - The server fails to start list

Attempts to extract an identifier from an argument. This function validates that the argument contains a simple path expression that can be converted

Computes a lower bound on the cost of completing the current partial assignment. Sums `min(block_cost)` and `min(transition_cost)` independently over

Mangles a symbol by appending a unique suffix. The mangling pattern is `<symbol>:<count>` where count is a unique number for each original symbol. Th

Returns the explanatory message text for this label. The message provides context about what's happening at the location pointed to by this label's s

Selects the next unassigned block using the MRV heuristic. Ties are broken by highest constraint degree (count of fixed + boundary neighbors).

Re-applies composite swallowing after a raw union. Removes any path whose ancestor composite is also present in the set.

Evaluates an operand to produce its footprint.

Helper to create a properties object with email and shortname.

Returns an iterator over all property type references used by this entity type. This method collects all references to property types from the `prope

Provisions a new unique ID without interning any value. This is useful when creating recursive data structures, where an ID needs to be known before

</pre>

Remaps terminator costs after block splitting. For each original block, the original terminator cost is placed on the last block of its region (which

Resolves the metadata for the given data types. This method resolves the metadata for the given data types and all their parents. It returns the reso

Resolves the metadata for the given entity types. This method resolves the metadata for the given entity types and all their parents. It returns the

Iterates placement regions in reverse topological order (sinks first).

Finds the canonical [`VariableKind`] for a variable's equivalence class.

Run a DFS from `root` without resetting state. Nodes already in the gray or black sets from previous calls are treated as previously visited. This al

Alias for seed - seeds both User and Invitation entity types.

Extracts the simple type name from a fully qualified type path. Takes a fully qualified Rust type name (e.g., `crate::pass::transform::MyPass<T>`) an

Spawns a named server task. If the future completes while `shutdown` has not been requested, this is treated as an unexpected exit and `abort` is can

Finds suggestions for the given name in the root namespace.

Runs MIR optimization passes on the body set. Applies pre-inline cleanup, function inlining, and post-inline simplification in sequence. Bodies are m

Unassigns a role from an actor. # Errors - [`StoreError`] if a database error occurs [`StoreError`]: PrincipalError::StoreError

Update the definition of an existing [`DataType`]. # Errors - if the [`DataType`] doesn't exist.