pub struct BloqStats {
pub template_count: usize,
pub node_count: usize,
pub edge_count: usize,
pub node_counts: BTreeMap<&'static str, usize>,
pub edge_counts: BTreeMap<&'static str, usize>,
pub is_static: bool,
}Expand description
Structural counts across every graph level, including guarded and RUS bodies.
These describe stored IR without inspecting physical circuit payloads, expanding fixed repeats, selecting guards, or multiplying RUS attempts.
Fields§
§template_count: usizeTemplates in the compiled pool, including unreferenced templates.
node_count: usizeNodes across all graph levels, including region containers.
edge_count: usizeEdges across all graph levels.
node_counts: BTreeMap<&'static str, usize>Node counts by concrete variant name, including zero-count types.
edge_counts: BTreeMap<&'static str, usize>Edge counts by concrete variant, including zero-count types.
is_static: boolWhether execution structure is fixed: no regions, activation, guarded membership/seams, or shot discard. Ordinary classical readout/decoder computation and fixed circuit repeats do not make structure dynamic. This does not certify validity or backend emittability.
Trait Implementations§
impl Eq for BloqStats
impl StructuralPartialEq for BloqStats
Auto Trait Implementations§
impl Freeze for BloqStats
impl RefUnwindSafe for BloqStats
impl Send for BloqStats
impl Sync for BloqStats
impl Unpin for BloqStats
impl UnsafeUnpin for BloqStats
impl UnwindSafe for BloqStats
Blanket Implementations§
§impl<T, BorrowedSelf> BitwiseMutViaBorrow<BorrowedSelf> for T
impl<T, BorrowedSelf> BitwiseMutViaBorrow<BorrowedSelf> for T
fn assign_index(&mut self, index: usize, to: bool)
fn negate_index(&mut self, index: usize)
fn clear_bits(&mut self)
fn assign_random(
&mut self,
bit_count: usize,
random_number_generator: &mut impl RngExt,
)where
BorrowedSelf: BitLength,
§impl<Bits, Other, BorrowedSelf, BorrowedOther> BitwisePairMutViaBorrow<Other, BorrowedSelf, BorrowedOther> for Bits
impl<Bits, Other, BorrowedSelf, BorrowedOther> BitwisePairMutViaBorrow<Other, BorrowedSelf, BorrowedOther> for Bits
fn assign(&mut self, other: &Other)
fn bitxor_assign(&mut self, other: &Other)
fn bitand_assign(&mut self, other: &Other)
fn bitor_assign(&mut self, other: &Other)
§impl<T, Other, BorrowedSelf, BorrowedOther> BitwisePairViaBorrow<Other, BorrowedSelf, BorrowedOther> for T
impl<T, Other, BorrowedSelf, BorrowedOther> BitwisePairViaBorrow<Other, BorrowedSelf, BorrowedOther> for T
§impl<T, BorrowedSelf> BitwiseViaBorrow<BorrowedSelf> for T
impl<T, BorrowedSelf> BitwiseViaBorrow<BorrowedSelf> for T
fn index(&self, index: usize) -> bool
fn weight(&self) -> usize
fn parity(&self) -> bool
fn is_zero(&self) -> bool
fn is_unit(&self, index: usize) -> bool
fn support<'a>(&'a self) -> impl SortedIteratorwhere
BorrowedSelf: 'a,
fn max_support(&self) -> Option<usize>
fn min_support(&self) -> Option<usize>
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
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
§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.