pub struct BloqNodeId(pub u32);Expand description
A node’s slot index in its own graph level (a crate::Bloq top level or
one region crate::SubGraph body) — ids are level-local, not program-global.
Identity contract: an id is valid until its node is
removed; removal may recycle the id for a later add_node. Holders of ids
across mutating passes must re-resolve them — in particular,
The fuse_single_use_computes optimization removes nodes and is the
documented last structural pass before external ids are retained.
Tuple Fields§
§0: u32Trait Implementations§
Source§impl Clone for BloqNodeId
impl Clone for BloqNodeId
Source§fn clone(&self) -> BloqNodeId
fn clone(&self) -> BloqNodeId
Returns a duplicate of the value. Read more
1.0.0 (const: unstable) · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source. Read moreimpl Copy for BloqNodeId
Source§impl Debug for BloqNodeId
impl Debug for BloqNodeId
Source§impl<'de> Deserialize<'de> for BloqNodeId
impl<'de> Deserialize<'de> for BloqNodeId
Source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read more
impl Eq for BloqNodeId
Source§impl From<BloqNodeId> for ValueRef
impl From<BloqNodeId> for ValueRef
Source§fn from(node: BloqNodeId) -> Self
fn from(node: BloqNodeId) -> Self
Converts to this type from the input type.
Source§impl Hash for BloqNodeId
impl Hash for BloqNodeId
Source§impl Index<BloqNodeId> for SubGraph
The panicking twin of SubGraph::node: panics on a stale id, for passes
that hold ids they know are live.
impl Index<BloqNodeId> for SubGraph
The panicking twin of SubGraph::node: panics on a stale id, for passes
that hold ids they know are live.
Source§impl Index<BloqNodeId> for Bloq
The panicking twin of Bloq::node (see SubGraph’s Index impl).
impl Index<BloqNodeId> for Bloq
The panicking twin of Bloq::node (see SubGraph’s Index impl).
Source§impl Ord for BloqNodeId
impl Ord for BloqNodeId
Source§fn cmp(&self, other: &BloqNodeId) -> Ordering
fn cmp(&self, other: &BloqNodeId) -> Ordering
1.21.0 (const: unstable) · Source§fn max(self, other: Self) -> Selfwhere
Self: Sized,
fn max(self, other: Self) -> Selfwhere
Self: Sized,
Compares and returns the maximum of two values. Read more
Source§impl PartialEq for BloqNodeId
impl PartialEq for BloqNodeId
Source§impl PartialOrd for BloqNodeId
impl PartialOrd for BloqNodeId
Source§impl Serialize for BloqNodeId
impl Serialize for BloqNodeId
impl StructuralPartialEq for BloqNodeId
Auto Trait Implementations§
impl Freeze for BloqNodeId
impl RefUnwindSafe for BloqNodeId
impl Send for BloqNodeId
impl Sync for BloqNodeId
impl Unpin for BloqNodeId
impl UnsafeUnpin for BloqNodeId
impl UnwindSafe for BloqNodeId
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
Mutably borrows from an owned value. Read more
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
§impl<Q, K> Comparable<K> for Q
impl<Q, K> Comparable<K> for Q
impl<T> DeserializeOwned for Twhere
T: for<'de> Deserialize<'de>,
§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
Checks if this value is equivalent to the given key. Read more
§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
Compare self to
key and return true if they are equal.