Struct libreda_db::prelude::IrregularRepetition

pub struct IrregularRepetition<T>where
    T: CoordinateType,{
    offsets: Vec<Vector<T>, Global>,
}

Describe a non-equispaced repetition by storing a list of offsets.

Fields

offsets: Vec<Vector<T>, Global>

Implementations

impl<T> IrregularRepetition<T>where T: CoordinateType,

pub fn new(offsets: Vec<Vector<T>, Global>) -> IrregularRepetition<T>

Create a new irregular repetition from a list of offsets.

pub fn iter(&self) -> impl Iterator<Item = Vector<T>>

Iterate over each offsets of this repetition.

pub fn len(&self) -> usize

Return the number of offsets in this repetition.

pub fn is_empty(&self) -> bool

Check if there’s no repetition at all.

Trait Implementations

impl<T> Clone for IrregularRepetition<T>where T: Clone + CoordinateType,

fn clone(&self) -> IrregularRepetition<T>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<T> Debug for IrregularRepetition<T>where T: Debug + CoordinateType,

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

Formats the value using the given formatter.

impl<'de, T> Deserialize<'de> for IrregularRepetition<T>where T: CoordinateType + Deserialize<'de>,

fn deserialize<__D>( __deserializer: __D ) -> Result<IrregularRepetition<T>, <__D as Deserializer<'de>>::Error>where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<T> Hash for IrregularRepetition<T>where T: Hash + CoordinateType,

fn hash<__H>(&self, state: &mut __H)where __H: Hasher,

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl<T> PartialEq<IrregularRepetition<T>> for IrregularRepetition<T>where T: PartialEq<T> + CoordinateType,

fn eq(&self, other: &IrregularRepetition<T>) -> bool

This method tests for self and other values to be equal, and is used by ==.

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

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

impl<T> Serialize for IrregularRepetition<T>where T: CoordinateType + Serialize,

fn serialize<__S>( &self, __serializer: __S ) -> Result<<__S as Serializer>::Ok, <__S as Serializer>::Error>where __S: Serializer,

Serialize this value into the given Serde serializer.

impl<T> Eq for IrregularRepetition<T>where T: Eq + CoordinateType,

impl<T> StructuralEq for IrregularRepetition<T>where T: CoordinateType,

impl<T> StructuralPartialEq for IrregularRepetition<T>where T: CoordinateType,