Struct ldpc::css::Css [−][src]
pub struct Css<X, Z = X> {
pub x: X,
pub z: Z,
}
Fields
x: X
z: Z
Implementations
Trait Implementations
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<'a> From<&'a Css<SparseBinVecBase<Vec<usize, Global>>, SparseBinVecBase<Vec<usize, Global>>>> for PauliOperator
impl<'a> From<&'a Css<SparseBinVecBase<Vec<usize, Global>>, SparseBinVecBase<Vec<usize, Global>>>> for PauliOperator
Performs the conversion.
impl From<Css<SparseBinVecBase<Vec<usize, Global>>, SparseBinVecBase<Vec<usize, Global>>>> for PauliOperator
impl From<Css<SparseBinVecBase<Vec<usize, Global>>, SparseBinVecBase<Vec<usize, Global>>>> for PauliOperator
Performs the conversion.
impl<'a, D> SyndromeDecoder<Css<SparseBinVecBase<&'a [usize]>, SparseBinVecBase<&'a [usize]>>, Css<SparseBinVecBase<Vec<usize, Global>>, SparseBinVecBase<Vec<usize, Global>>>> for CssDecoder<D> where
D: ClassicalSyndromeDecoder<'a>,
impl<'a, D> SyndromeDecoder<Css<SparseBinVecBase<&'a [usize]>, SparseBinVecBase<&'a [usize]>>, Css<SparseBinVecBase<Vec<usize, Global>>, SparseBinVecBase<Vec<usize, Global>>>> for CssDecoder<D> where
D: ClassicalSyndromeDecoder<'a>,
Auto Trait Implementations
impl<X, Z> RefUnwindSafe for Css<X, Z> where
X: RefUnwindSafe,
Z: RefUnwindSafe,
impl<X, Z> UnwindSafe for Css<X, Z> where
X: UnwindSafe,
Z: UnwindSafe,
Blanket Implementations
Mutably borrows from an owned value. Read more
Compare self to key
and return true
if they are equal.
The inverse inclusion map: attempts to construct self
from the equivalent element of its
superset. Read more
pub fn is_in_subset(&self) -> bool
pub fn is_in_subset(&self) -> bool
Checks if self
is actually part of its subset T
(and can be converted to it).
pub unsafe fn to_subset_unchecked(&self) -> SS
pub unsafe fn to_subset_unchecked(&self) -> SS
Use with care! Same as self.to_subset
but without any property checks. Always succeeds.
pub fn from_subset(element: &SS) -> SP
pub fn from_subset(element: &SS) -> SP
The inclusion map: converts self
to the equivalent element of its superset.