Skip to main content

LabelledSimplicialComplex

algebraeon_geometry::simplicial_complex

Struct LabelledSimplicialComplex 

Source 
pub struct LabelledSimplicialComplex<'f, FS: OrderedRingSignature + FieldSignature, T: Eq + Clone + Send + Sync> { /* private fields */ }

Implementations§

Source§

impl<'f, FS: OrderedRingSignature + FieldSignature> LabelledSimplicialComplex<'f, FS, ()>
where FS::Set: Hash,

Source

pub fn interior_and_boundary( &self, ) -> LabelledSimplicialComplex<'f, FS, InteriorOrBoundary>

Source

pub fn interior(&self) -> PartialSimplicialComplex<'f, FS>

Source

pub fn boundary(&self) -> SimplicialComplex<'f, FS>

Source§

impl<'f, FS: OrderedRingSignature + FieldSignature, T: Eq + Clone + Send + Sync> LabelledSimplicialComplex<'f, FS, T>
where FS::Set: Hash,

Source

pub fn simplify(self) -> Self

Source

pub fn remove_simplexes(&mut self, simplexes: Vec<Simplex<'f, FS>>)

Source

pub fn add_simplexes(&mut self, simplexes: Vec<(Simplex<'f, FS>, T)>)

Trait Implementations§

Source§

impl<'f, FS: Clone + OrderedRingSignature + FieldSignature, T: Clone + Eq + Clone + Send + Sync> Clone for LabelledSimplicialComplex<'f, FS, T>

Source§

fn clone(&self) -> LabelledSimplicialComplex<'f, FS, T>

Returns a duplicate of the value. Read more
1.0.0 · Source§

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

Performs copy-assignment from source. Read more
Source§

impl<'f, FS: OrderedRingSignature + FieldSignature, T: Eq + Clone + Send + Sync> Debug for LabelledSimplicialComplex<'f, FS, T>

Source§

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

Formats the value using the given formatter. Read more
Source§

impl<'f, FS: OrderedRingSignature + FieldSignature, T: Eq + Clone + Send + Sync, S: Eq + Clone + Send + Sync> Difference<LabelledPartialSimplicialComplex<'f, FS, S>> for LabelledSimplicialComplex<'f, FS, T>
where FS::Set: Hash,

Source§

type Output = LabelledPartialSimplicialComplex<'f, FS, T>

Source§

fn difference( &self, other: &LabelledPartialSimplicialComplex<'f, FS, S>, ) -> Self::Output

Source§

impl<'f, FS: OrderedRingSignature + FieldSignature, T: Eq + Clone + Send + Sync, S: Eq + Clone + Send + Sync> Difference<LabelledSimplicialComplex<'f, FS, S>> for LabelledPartialSimplicialComplex<'f, FS, T>
where FS::Set: Hash,

Source§

type Output = LabelledPartialSimplicialComplex<'f, FS, T>

Source§

fn difference( &self, other: &LabelledSimplicialComplex<'f, FS, S>, ) -> Self::Output

Source§

impl<'f, FS: OrderedRingSignature + FieldSignature, T: Eq + Clone + Send + Sync, S: Eq + Clone + Send + Sync> Difference<LabelledSimplicialComplex<'f, FS, S>> for LabelledSimplicialComplex<'f, FS, T>
where FS::Set: Hash,

Source§

type Output = LabelledPartialSimplicialComplex<'f, FS, T>

Source§

fn difference( &self, other: &LabelledSimplicialComplex<'f, FS, S>, ) -> Self::Output

Source§

impl<'f, FS: OrderedRingSignature + FieldSignature, T: Eq + Clone + Send + Sync, S: Eq + Clone + Send + Sync> Difference<LabelledSimplicialComplex<'f, FS, S>> for LabelledSimplicialDisjointUnion<'f, FS, T>
where FS::Set: Hash,

Source§

type Output = LabelledPartialSimplicialComplex<'f, FS, T>

Source§

fn difference( &self, other: &LabelledSimplicialComplex<'f, FS, S>, ) -> Self::Output

Source§

impl<'f, FS: OrderedRingSignature + FieldSignature, T: Eq + Clone + Send + Sync, S: Eq + Clone + Send + Sync> Difference<LabelledSimplicialDisjointUnion<'f, FS, S>> for LabelledSimplicialComplex<'f, FS, T>
where FS::Set: Hash,

Source§

type Output = LabelledPartialSimplicialComplex<'f, FS, T>

Source§

fn difference( &self, other: &LabelledSimplicialDisjointUnion<'f, FS, S>, ) -> Self::Output

Source§

impl<'f, FS: OrderedRingSignature + FieldSignature> Intersect<LabelledSimplicialComplex<'f, FS, ()>> for PartialSimplicialComplex<'f, FS>
where FS::Set: Hash,

Source§

type Output = LabelledPartialSimplicialComplex<'f, FS, ()>

Source§

fn intersect(&self, other: &SimplicialComplex<'f, FS>) -> Self::Output

Source§

impl<'f, FS: OrderedRingSignature + FieldSignature> Intersect<LabelledSimplicialComplex<'f, FS, ()>> for SimplicialComplex<'f, FS>
where FS::Set: Hash,

Source§

type Output = LabelledSimplicialComplex<'f, FS, ()>

Source§

fn intersect(&self, other: &SimplicialComplex<'f, FS>) -> Self::Output

Source§

impl<'f, FS: OrderedRingSignature + FieldSignature> Intersect<LabelledSimplicialComplex<'f, FS, ()>> for SimplicialDisjointUnion<'f, FS>
where FS::Set: Hash,

Source§

type Output = LabelledPartialSimplicialComplex<'f, FS, ()>

Source§

fn intersect(&self, other: &SimplicialComplex<'f, FS>) -> Self::Output

Source§

impl<'f, FS: OrderedRingSignature + FieldSignature, T: Eq + Clone + Send + Sync> LabelledSimplexCollection<'f, FS, T> for LabelledSimplicialComplex<'f, FS, T>
where FS::Set: Hash,

Source§

type WithLabel<S: Eq + Clone + Send + Sync> = LabelledSimplicialComplex<'f, FS, S>

Source§

type SubsetType = LabelledPartialSimplicialComplex<'f, FS, T>

Source§

fn try_new_labelled( ambient_space: AffineSpace<'f, FS>, simplexes: HashMap<Simplex<'f, FS>, T>, ) -> Result<Self, &'static str>

Source§

fn new_labelled_unchecked( ambient_space: AffineSpace<'f, FS>, simplexes: HashMap<Simplex<'f, FS>, T>, ) -> Self

Source§

fn ambient_space(&self) -> AffineSpace<'f, FS>

Source§

fn labelled_simplexes(&self) -> HashMap<&Simplex<'f, FS>, &T>

Source§

fn into_labelled_simplexes(self) -> HashMap<Simplex<'f, FS>, T>

Source§

fn into_partial_simplicial_complex( self, ) -> LabelledPartialSimplicialComplex<'f, FS, T>

Source§

fn to_partial_simplicial_complex( &self, ) -> LabelledPartialSimplicialComplex<'f, FS, T>

Source§

fn into_simplicial_disjoint_union( self, ) -> LabelledSimplicialDisjointUnion<'f, FS, T>

Source§

fn to_simplicial_disjoint_union( &self, ) -> LabelledSimplicialDisjointUnion<'f, FS, T>

Source§

fn try_new( ambient_space: AffineSpace<'f, FS>, simplexes: HashSet<Simplex<'f, FS>>, ) -> Result<Self::WithLabel<()>, &'static str>

Source§

fn new_unchecked( ambient_space: AffineSpace<'f, FS>, simplexes: HashSet<Simplex<'f, FS>>, ) -> Self::WithLabel<()>

Source§

fn simplexes<'a>(&'a self) -> HashSet<&'a Simplex<'f, FS>>
where T: 'a,

Source§

fn into_simplexes(self) -> HashSet<Simplex<'f, FS>>

Source§

fn subset_by_label( &self, label: &T, ) -> <Self::SubsetType as LabelledSimplexCollection<'f, FS, T>>::WithLabel<()>

Source§

fn into_subset_by_label( self, label: &T, ) -> <Self::SubsetType as LabelledSimplexCollection<'f, FS, T>>::WithLabel<()>

Source§

fn subset_by_filter(&self, f: impl Fn(&T) -> bool) -> Self::SubsetType

Source§

fn into_subset_by_filter(self, f: impl Fn(&T) -> bool) -> Self::SubsetType

Source§

fn apply_label_function<S: Eq + Clone + Send + Sync>( &self, f: impl Fn(&T) -> S, ) -> Self::WithLabel<S>

Source§

fn into_apply_label_function<S: Eq + Clone + Send + Sync>( self, f: impl Fn(T) -> S, ) -> Self::WithLabel<S>

Source§

fn forget_labels(&self) -> Self::WithLabel<()>

Source§

fn into_forget_labels(self) -> Self::WithLabel<()>

Source§

fn common_label<'a>( &'a self, simplexes: impl Iterator<Item = &'a Simplex<'f, FS>>, ) -> Option<&'a T>
where FS: 'a, AffineSpace<'f, FS>: 'a, 'f: 'a,

Source§

impl<'f, FS: OrderedRingSignature + FieldSignature> Union<LabelledSimplicialComplex<'f, FS, ()>> for PartialSimplicialComplex<'f, FS>
where FS::Set: Hash,

Source§

type Output = LabelledPartialSimplicialComplex<'f, FS, ()>

Source§

fn union(&self, other: &SimplicialComplex<'f, FS>) -> Self::Output

Source§

impl<'f, FS: OrderedRingSignature + FieldSignature> Union<LabelledSimplicialComplex<'f, FS, ()>> for SimplicialComplex<'f, FS>
where FS::Set: Hash,

Source§

type Output = LabelledSimplicialComplex<'f, FS, ()>

Source§

fn union(&self, other: &SimplicialComplex<'f, FS>) -> Self::Output

Source§

impl<'f, FS: OrderedRingSignature + FieldSignature> Union<LabelledSimplicialComplex<'f, FS, ()>> for SimplicialDisjointUnion<'f, FS>
where FS::Set: Hash,

Source§

type Output = LabelledPartialSimplicialComplex<'f, FS, ()>

Source§

fn union(&self, other: &SimplicialComplex<'f, FS>) -> Self::Output

Auto Trait Implementations§

§

impl<'f, FS, T> Freeze for LabelledSimplicialComplex<'f, FS, T>

§

impl<'f, FS, T> RefUnwindSafe for LabelledSimplicialComplex<'f, FS, T>
where FS: RefUnwindSafe, T: RefUnwindSafe, <FS as SetSignature>::Set: RefUnwindSafe,

§

impl<'f, FS, T> Send for LabelledSimplicialComplex<'f, FS, T>

§

impl<'f, FS, T> Sync for LabelledSimplicialComplex<'f, FS, T>

§

impl<'f, FS, T> Unpin for LabelledSimplicialComplex<'f, FS, T>
where T: Unpin, <FS as SetSignature>::Set: Unpin,

§

impl<'f, FS, T> UnsafeUnpin for LabelledSimplicialComplex<'f, FS, T>

§

impl<'f, FS, T> UnwindSafe for LabelledSimplicialComplex<'f, FS, T>
where FS: RefUnwindSafe, T: UnwindSafe, <FS as SetSignature>::Set: UnwindSafe,

Blanket Implementations§

Source§

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

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

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

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

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

Source§

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

Mutably borrows from an owned value. Read more
Source§

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

Source§

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

🔬This is a nightly-only experimental API. (clone_to_uninit)
Performs copy-assignment from self to dest. Read more
Source§

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

Source§

fn exact_from(value: T) -> U

Source§

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

Source§

fn exact_into(self) -> U

Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<'f, FS, S> InteriorOrBoundarySimplexCollection<'f, FS> for S
where FS: OrderedRingSignature + FieldSignature + 'f, S: LabelledSimplexCollection<'f, FS, InteriorOrBoundary>, <FS as SetSignature>::Set: Hash,

Source§

fn interior( &self, ) -> <Self::SubsetType as LabelledSimplexCollection<'f, FS, InteriorOrBoundary>>::WithLabel<()>

Source§

fn boundary( &self, ) -> <Self::SubsetType as LabelledSimplexCollection<'f, FS, InteriorOrBoundary>>::WithLabel<()>

Source§

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

Source§

fn into(self) -> U

Calls U::from(self).

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

Source§

impl<T> IntoEither for T

Source§

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

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
Source§

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

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
Source§

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

Source§

fn overflowing_into(self) -> (U, bool)

Source§

impl<T> Pointable for T

Source§

const ALIGN: usize

The alignment of pointer.
Source§

type Init = T

The type for initializers.
Source§

unsafe fn init(init: <T as Pointable>::Init) -> usize

Initializes a with the given initializer. Read more
Source§

unsafe fn deref<'a>(ptr: usize) -> &'a T

Dereferences the given pointer. Read more
Source§

unsafe fn deref_mut<'a>(ptr: usize) -> &'a mut T

Mutably dereferences the given pointer. Read more
Source§

unsafe fn drop(ptr: usize)

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

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

Source§

fn rounding_into(self, rm: RoundingMode) -> (U, Ordering)

Source§

impl<T> Same for T

Source§

type Output = T

Should always be Self
Source§

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

Source§

fn saturating_into(self) -> U

Source§

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

Source§

fn to_debug_string(&self) -> String

Returns the String produced by Ts Debug implementation.

§Examples
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)");
Source§

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

Source§

type Owned = T

The resulting type after obtaining ownership.
Source§

fn to_owned(&self) -> T

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

fn clone_into(&self, target: &mut T)

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

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

Source§

type Error = Infallible

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
Source§

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

Source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
Source§

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

Source§

fn vzip(self) -> V

Source§

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

Source§

fn wrapping_into(self) -> U

Source§

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,

Source§

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