Struct FinitelyFreeModuleStructure

pub struct FinitelyFreeModuleStructure<Ring: RingSignature, RingB: BorrowedStructure<Ring>> { /* private fields */ }

Implementations§

Trait Implementations§

Return the unique x such that a = b + x, or None if no such x exists.

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.

FinitelyFreeModuleStructure

Struct FinitelyFreeModuleStructure Copy item path

Implementations§

impl<Ring: RingSignature, RingB: BorrowedStructure<Ring>> FinitelyFreeModuleStructure<Ring, RingB>

pub fn new(ring: RingB, rank: usize) -> Self

impl<Ring: RingSignature, RingB: BorrowedStructure<Ring>> FinitelyFreeModuleStructure<Ring, RingB>

pub fn ring(&self) -> &Ring

pub fn to_col(&self, v: &<Self as SetSignature>::Set) -> Matrix<Ring::Set>

pub fn to_row(&self, v: &<Self as SetSignature>::Set) -> Matrix<Ring::Set>

pub fn from_row(&self, m: &Matrix<Ring::Set>) -> <Self as SetSignature>::Set

pub fn from_col(&self, m: &Matrix<Ring::Set>) -> <Self as SetSignature>::Set

pub fn basis_element(&self, i: usize) -> <Self as SetSignature>::Set

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

pub fn submodules(&self) -> FinitelyFreeSubmoduleStructure<Ring, &Ring>

pub fn into_submodules(self) -> FinitelyFreeSubmoduleStructure<Ring, RingB>

pub fn cosets(&self) -> FinitelyFreeSubmoduleCosetStructure<Ring, &Ring>

pub fn into_cosets(self) -> FinitelyFreeSubmoduleCosetStructure<Ring, RingB>

pub fn affine_subsets( &self, ) -> FinitelyFreeSubmoduleAffineSubsetStructure<Ring, &Ring>

pub fn into_affine_subsets( self, ) -> FinitelyFreeSubmoduleAffineSubsetStructure<Ring, RingB>

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

pub fn generated_submodule( &self, generators: Vec<&Vec<Ring::Set>>, ) -> FinitelyFreeSubmodule<Ring::Set>

Trait Implementations§

impl<Ring: RingSignature, RingB: BorrowedStructure<Ring>> AdditionSignature for FinitelyFreeModuleStructure<Ring, RingB>

fn add(&self, v: &Self::Set, w: &Self::Set) -> Self::Set

fn add_mut(&self, a: &mut Self::Set, b: &Self::Set)

impl<Ring: RingSignature, RingB: BorrowedStructure<Ring>> AdditiveGroupSignature for FinitelyFreeModuleStructure<Ring, RingB>

fn neg(&self, v: &Self::Set) -> Self::Set

fn sub(&self, v: &Self::Set, w: &Self::Set) -> Self::Set

impl<Ring: RingSignature, RingB: BorrowedStructure<Ring>> AdditiveMonoidSignature for FinitelyFreeModuleStructure<Ring, RingB>

fn sum(&self, vals: Vec<impl Borrow<Self::Set>>) -> Self::Set

fn preimage(&self, y: &Vec<Ring::Set>) -> Vec<Ring::Set>

impl<Ring: RingSignature, RingB: BorrowedStructure<Ring>> CancellativeAdditionSignature for FinitelyFreeModuleStructure<Ring, RingB>

fn try_sub(&self, a: &Self::Set, b: &Self::Set) -> Option<Self::Set>

impl<Ring: Clone + RingSignature, RingB: Clone + BorrowedStructure<Ring>> Clone for FinitelyFreeModuleStructure<Ring, RingB>

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

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

impl<Ring: Debug + RingSignature, RingB: Debug + BorrowedStructure<Ring>> Debug for FinitelyFreeModuleStructure<Ring, RingB>

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

impl<Ring: RingSignature + EqSignature, RingB: BorrowedStructure<Ring>> EqSignature for FinitelyFreeModuleStructure<Ring, RingB>

fn equal(&self, v: &Self::Set, w: &Self::Set) -> bool

impl<Ring: RingSignature, RingB: BorrowedStructure<Ring>> FreeModuleSignature<Ring> for FinitelyFreeModuleStructure<Ring, RingB>

type Basis = EnumeratedFiniteSetStructure

fn basis_set(&self) -> impl Borrow<Self::Basis>

fn to_component<'a>(&self, b: &usize, v: &'a Self::Set) -> Cow<'a, Ring::Set>

fn from_component(&self, b: &usize, r: &Ring::Set) -> Self::Set

fn image(&self, x: &Vec<Ring::Set>) -> Vec<Ring::Set>

fn try_preimage(&self, y: &Vec<Ring::Set>) -> Option<Vec<Ring::Set>>

fn domain(&self) -> &FinitelyFreeModuleStructure<Ring, RingDomainB>

fn range(&self) -> &FinitelyFreeModuleStructure<Ring, RingRangeB>

impl<Ring: PartialEq + RingSignature, RingB: PartialEq + BorrowedStructure<Ring>> PartialEq for FinitelyFreeModuleStructure<Ring, RingB>

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

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

impl<Ring: RingSignature, RingB: BorrowedStructure<Ring>> RinglikeSpecializationSignature for FinitelyFreeModuleStructure<Ring, RingB>

fn try_ring_restructure( &self, ) -> Option<impl EqSignature<Set = Self::Set> + RingSignature>

fn try_char_zero_ring_restructure( &self, ) -> Option<impl EqSignature<Set = Self::Set> + CharZeroRingSignature>

impl<Ring: RingSignature, RingB: BorrowedStructure<Ring>> SemiModuleSignature<Ring> for FinitelyFreeModuleStructure<Ring, RingB>

fn ring(&self) -> &Ring

fn scalar_mul(&self, v: &Self::Set, r: &Ring::Set) -> Self::Set

impl<Ring: RingSignature, RingB: BorrowedStructure<Ring>> SetSignature for FinitelyFreeModuleStructure<Ring, RingB>

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

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

impl<Ring: RingSignature, RingB: BorrowedStructure<Ring>> TryNegateSignature for FinitelyFreeModuleStructure<Ring, RingB>

fn try_neg(&self, a: &Self::Set) -> Option<Self::Set>

impl<Ring: RingSignature, RingB: BorrowedStructure<Ring>> ZeroSignature for FinitelyFreeModuleStructure<Ring, RingB>

fn zero(&self) -> Self::Set

impl<Ring: Eq + RingSignature, RingB: Eq + BorrowedStructure<Ring>> Eq for FinitelyFreeModuleStructure<Ring, RingB>

impl<Ring: RingSignature, RingB: BorrowedStructure<Ring>> Signature for FinitelyFreeModuleStructure<Ring, RingB>

impl<Ring: RingSignature, RingB: BorrowedStructure<Ring>> StructuralPartialEq for FinitelyFreeModuleStructure<Ring, RingB>

Auto Trait Implementations§

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

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

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

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

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

impl<Ring, RingB> UnwindSafe for FinitelyFreeModuleStructure<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

Struct FinitelyFreeModuleStructure

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

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

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

impl<Ring, RingB> UnwindSafe for FinitelyFreeModuleStructure<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>,