Struct FinitelyFreeSubmoduleStructure

pub struct FinitelyFreeSubmoduleStructure<Ring: ReducedHermiteAlgorithmSignature, RingB: BorrowedStructure<Ring>> { /* private fields */ }

Implementations§

Trait Implementations§

Returns a duplicate of the value. Read more

Performs copy-assignment from source. Read more

Formats the value using the given formatter. Read more

Tests for self and other values to be equal, and is used by ==.

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

Some instances of Self::Set may not be valid to represent elements of this set. Return true if x is a valid element and false if not.

Auto Trait Implementations§

Blanket Implementations§

Gets the TypeId of self. Read more

Immutably borrows from an owned value. Read more

Mutably borrows from an owned value. Read more

🔬This is a nightly-only experimental API. (clone_to_uninit)

Performs copy-assignment from self to dest. Read more

Checks if this value is equivalent to the given key. Read more

Compare self to key and return true if they are equal.

Returns the argument unchanged.

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Converts self into a Left variant of Either<Self, Self> if into_left is true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more

Converts self into a Left variant of Either<Self, Self> if into_left(&self) returns true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more

The alignment of pointer.

The type for initializers.

Initializes a with the given initializer. Read more

Dereferences the given pointer. Read more

Mutably dereferences the given pointer. Read more

Drops the object pointed to by the given pointer. Read more

Should always be Self

Returns the String produced by Ts Debug implementation.

use malachite_base::strings::ToDebugString;

assert_eq!([1, 2, 3].to_debug_string(), "[1, 2, 3]");
assert_eq!(
    [vec![2, 3], vec![], vec![4]].to_debug_string(),
    "[[2, 3], [], [4]]"
);
assert_eq!(Some(5).to_debug_string(), "Some(5)");

The resulting type after obtaining ownership.

Creates owned data from borrowed data, usually by cloning. Read more

Uses borrowed data to replace owned data, usually by cloning. Read more

The type returned in the event of a conversion error.

Performs the conversion.

The type returned in the event of a conversion error.

Performs the conversion.

FinitelyFreeSubmoduleStructure

Struct FinitelyFreeSubmoduleStructure Copy item path

Implementations§

impl<Ring: ReducedHermiteAlgorithmSignature, RingB: BorrowedStructure<Ring>> FinitelyFreeSubmoduleStructure<Ring, RingB>

pub fn new(module: FinitelyFreeModuleStructure<Ring, RingB>) -> Self

impl<Ring: ReducedHermiteAlgorithmSignature, RingB: BorrowedStructure<Ring>> FinitelyFreeSubmoduleStructure<Ring, RingB>

pub fn module(&self) -> &FinitelyFreeModuleStructure<Ring, RingB>

pub fn ring(&self) -> &Ring

pub fn matrix_row_span_and_basis( &self, matrix: Matrix<Ring::Set>, ) -> (FinitelyFreeSubmodule<Ring::Set>, Matrix<Ring::Set>)

pub fn matrix_col_span_and_basis( &self, matrix: Matrix<Ring::Set>, ) -> (FinitelyFreeSubmodule<Ring::Set>, Matrix<Ring::Set>)

pub fn matrix_row_span( &self, matrix: Matrix<Ring::Set>, ) -> FinitelyFreeSubmodule<Ring::Set>

pub fn matrix_col_span( &self, matrix: Matrix<Ring::Set>, ) -> FinitelyFreeSubmodule<Ring::Set>

pub fn span( &self, span: Vec<impl Borrow<Vec<Ring::Set>>>, ) -> FinitelyFreeSubmodule<Ring::Set>

pub fn kernel( &self, items: Vec<impl Borrow<Vec<Ring::Set>>>, ) -> FinitelyFreeSubmodule<Ring::Set>

pub fn matrix_row_preimage( &self, matrix: &Matrix<Ring::Set>, space: &FinitelyFreeSubmodule<Ring::Set>, ) -> FinitelyFreeSubmodule<Ring::Set>

pub fn matrix_col_preimage( &self, matrix: &Matrix<Ring::Set>, space: &FinitelyFreeSubmodule<Ring::Set>, ) -> FinitelyFreeSubmodule<Ring::Set>

pub fn matrix_row_kernel( &self, matrix: Matrix<Ring::Set>, ) -> FinitelyFreeSubmodule<Ring::Set>

pub fn matrix_col_kernel( &self, matrix: Matrix<Ring::Set>, ) -> FinitelyFreeSubmodule<Ring::Set>

pub fn full_submodule(&self) -> FinitelyFreeSubmodule<Ring::Set>

pub fn zero_submodule(&self) -> FinitelyFreeSubmodule<Ring::Set>

pub fn reduce_element( &self, submodule: &FinitelyFreeSubmodule<Ring::Set>, element: &Vec<Ring::Set>, ) -> (Vec<Ring::Set>, Vec<Ring::Set>)

pub fn equal_slow( &self, x: &FinitelyFreeSubmodule<Ring::Set>, y: &FinitelyFreeSubmodule<Ring::Set>, ) -> bool

pub fn contains_element( &self, submodule: &FinitelyFreeSubmodule<Ring::Set>, element: &Vec<Ring::Set>, ) -> bool

pub fn contains( &self, x: &FinitelyFreeSubmodule<Ring::Set>, y: &FinitelyFreeSubmodule<Ring::Set>, ) -> bool

pub fn add( &self, x: FinitelyFreeSubmodule<Ring::Set>, y: FinitelyFreeSubmodule<Ring::Set>, ) -> FinitelyFreeSubmodule<Ring::Set>

pub fn sum( &self, xs: Vec<FinitelyFreeSubmodule<Ring::Set>>, ) -> FinitelyFreeSubmodule<Ring::Set>

pub fn intersect( &self, x: FinitelyFreeSubmodule<Ring::Set>, y: FinitelyFreeSubmodule<Ring::Set>, ) -> FinitelyFreeSubmodule<Ring::Set>

pub fn intersect_list( &self, xs: Vec<FinitelyFreeSubmodule<Ring::Set>>, ) -> FinitelyFreeSubmodule<Ring::Set>

pub fn extension_basis( &self, x: &FinitelyFreeSubmodule<Ring::Set>, y: &FinitelyFreeSubmodule<Ring::Set>, ) -> Vec<Vec<Ring::Set>>

pub fn coset( &self, x: &FinitelyFreeSubmodule<Ring::Set>, offset: &Vec<Ring::Set>, ) -> FinitelyFreeSubmoduleCoset<Ring::Set>

pub fn into_coset( &self, x: FinitelyFreeSubmodule<Ring::Set>, ) -> FinitelyFreeSubmoduleCoset<Ring::Set>

Trait Implementations§

impl<Ring: Clone + ReducedHermiteAlgorithmSignature, RingB: Clone + BorrowedStructure<Ring>> Clone for FinitelyFreeSubmoduleStructure<Ring, RingB>

fn clone(&self) -> FinitelyFreeSubmoduleStructure<Ring, RingB>

fn clone_from(&mut self, source: &Self)

impl<Ring: Debug + ReducedHermiteAlgorithmSignature, RingB: Debug + BorrowedStructure<Ring>> Debug for FinitelyFreeSubmoduleStructure<Ring, RingB>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

impl<Ring: UniqueReducedHermiteAlgorithmSignature, RingB: BorrowedStructure<Ring>> EqSignature for FinitelyFreeSubmoduleStructure<Ring, RingB>

fn equal( &self, x: &FinitelyFreeSubmodule<Ring::Set>, y: &FinitelyFreeSubmodule<Ring::Set>, ) -> bool

impl<Ring: PartialEq + ReducedHermiteAlgorithmSignature, RingB: PartialEq + BorrowedStructure<Ring>> PartialEq for FinitelyFreeSubmoduleStructure<Ring, RingB>

fn eq(&self, other: &FinitelyFreeSubmoduleStructure<Ring, RingB>) -> bool

fn ne(&self, other: &Rhs) -> bool

impl<Ring: ReducedHermiteAlgorithmSignature, RingB: BorrowedStructure<Ring>> SetSignature for FinitelyFreeSubmoduleStructure<Ring, RingB>

type Set = FinitelyFreeSubmodule<<Ring as SetSignature>::Set>

fn is_element(&self, x: &Self::Set) -> Result<(), String>

impl<Ring: Eq + ReducedHermiteAlgorithmSignature, RingB: Eq + BorrowedStructure<Ring>> Eq for FinitelyFreeSubmoduleStructure<Ring, RingB>

impl<Ring: ReducedHermiteAlgorithmSignature, RingB: BorrowedStructure<Ring>> Signature for FinitelyFreeSubmoduleStructure<Ring, RingB>

impl<Ring: ReducedHermiteAlgorithmSignature, RingB: BorrowedStructure<Ring>> StructuralPartialEq for FinitelyFreeSubmoduleStructure<Ring, RingB>

Auto Trait Implementations§

impl<Ring, RingB> Freeze for FinitelyFreeSubmoduleStructure<Ring, RingB>where RingB: Freeze,

impl<Ring, RingB> RefUnwindSafe for FinitelyFreeSubmoduleStructure<Ring, RingB>where RingB: RefUnwindSafe, Ring: RefUnwindSafe,

impl<Ring, RingB> Send for FinitelyFreeSubmoduleStructure<Ring, RingB>

impl<Ring, RingB> Sync for FinitelyFreeSubmoduleStructure<Ring, RingB>

impl<Ring, RingB> Unpin for FinitelyFreeSubmoduleStructure<Ring, RingB>where RingB: Unpin, Ring: Unpin,

impl<Ring, RingB> UnwindSafe for FinitelyFreeSubmoduleStructure<Ring, RingB>where RingB: UnwindSafe, Ring: UnwindSafe,

Blanket Implementations§

impl<T> Any for Twhere T: 'static + ?Sized,

fn type_id(&self) -> TypeId

impl<T> Borrow<T> for Twhere T: ?Sized,

fn borrow(&self) -> &T

impl<T> BorrowMut<T> for Twhere T: ?Sized,

fn borrow_mut(&mut self) -> &mut T

impl<T> CloneToUninit for Twhere T: Clone,

unsafe fn clone_to_uninit(&self, dest: *mut u8)

impl<Q, K> Equivalent<K> for Qwhere Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,

fn equivalent(&self, key: &K) -> bool

impl<Q, K> Equivalent<K> for Qwhere Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,

fn equivalent(&self, key: &K) -> bool

impl<T, U> ExactFrom<T> for Uwhere U: TryFrom<T>,

fn exact_from(value: T) -> U

impl<T, U> ExactInto<U> for Twhere U: ExactFrom<T>,

fn exact_into(self) -> U

impl<T> From<T> for T

fn from(t: T) -> T

impl<T, U> Into<U> for Twhere U: From<T>,

fn into(self) -> U

impl<T> IntoEither for T

fn into_either(self, into_left: bool) -> Either<Self, Self>

fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>where F: FnOnce(&Self) -> bool,

impl<S> IntoErgonomicSignature for Swhere S: SetSignature,

Struct FinitelyFreeSubmoduleStructure

impl<Ring, RingB> Freeze for FinitelyFreeSubmoduleStructure<Ring, RingB>
where RingB: Freeze,

impl<Ring, RingB> RefUnwindSafe for FinitelyFreeSubmoduleStructure<Ring, RingB>
where RingB: RefUnwindSafe, Ring: RefUnwindSafe,

impl<Ring, RingB> Unpin for FinitelyFreeSubmoduleStructure<Ring, RingB>
where RingB: Unpin, Ring: Unpin,

impl<Ring, RingB> UnwindSafe for FinitelyFreeSubmoduleStructure<Ring, RingB>
where RingB: UnwindSafe, Ring: UnwindSafe,

impl<T> Any for T
where T: 'static + ?Sized,

impl<T> Borrow<T> for T
where T: ?Sized,

impl<T> BorrowMut<T> for T
where T: ?Sized,

impl<T> CloneToUninit for T
where T: Clone,

impl<Q, K> Equivalent<K> for Q
where Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,

impl<Q, K> Equivalent<K> for Q
where Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,

impl<T, U> ExactFrom<T> for U
where U: TryFrom<T>,

impl<T, U> ExactInto<U> for T
where U: ExactFrom<T>,

impl<T, U> Into<U> for T
where U: From<T>,

fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
where F: FnOnce(&Self) -> bool,

impl<S> IntoErgonomicSignature for S
where S: SetSignature,

impl<T, U> OverflowingInto<U> for T
where U: OverflowingFrom<T>,

impl<RS> RingMatricesSignature for RS
where RS: SetSignature,

impl<T, U> RoundingInto<U> for T
where U: RoundingFrom<T>,

impl<T, U> SaturatingInto<U> for T
where U: SaturatingFrom<T>,

impl<T> ToDebugString for T
where T: Debug,

impl<T> ToOwned for T
where T: Clone,

impl<RS> ToPolynomialSignature for RS
where RS: Signature,

impl<T, U> TryFrom<U> for T
where U: Into<T>,

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

impl<V, T> VZip<V> for T
where V: MultiLane<T>,

impl<T, U> WrappingInto<U> for T
where U: WrappingFrom<T>,

impl<Domain, Range, M, BM> BorrowedMorphism<Domain, Range, M> for BM
where Domain: Signature, Range: Signature, M: Morphism<Domain, Range>, BM: Borrow<M> + Clone + Debug + Send + Sync,

impl<S, BS> BorrowedSet<S> for BS
where BS: Borrow<S> + Clone + Debug + Send + Sync,

impl<S, BS> BorrowedStructure<S> for BS
where S: Signature, BS: Borrow<S> + Clone + Debug + Eq + Send + Sync,