Struct TickArraySequence 

pub struct TickArraySequence {
    pub start_tick_index: i32,
    pub end_tick_index: i32,
    pub ticks: HashMap<i32, TickFacade>,
    pub tick_spacing: u16,
}

Fields

start_tick_index: i32

end_tick_index: i32

ticks: HashMap<i32, TickFacade>

tick_spacing: u16

Implementations

impl TickArraySequence

pub fn new( tick_arrays: Vec<TickArrayFacade>, tick_spacing: u16, ) -> Result<Self, CoreError>

pub fn start_index(&self) -> i32

Returns the first valid tick index in the sequence.

pub fn end_index(&self) -> i32

Returns the last valid tick index in the sequence.

pub fn tick(&self, tick_index: i32) -> Result<&TickFacade, CoreError>

pub fn next_initialized_tick( &self, tick_index: i32, ) -> Result<(Option<&TickFacade>, i32), CoreError>

pub fn prev_initialized_tick( &self, tick_index: i32, ) -> Result<(Option<&TickFacade>, i32), CoreError>

Trait Implementations

impl Clone for TickArraySequence

fn clone(&self) -> TickArraySequence

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for TickArraySequence

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

Formats the value using the given formatter.

impl PartialEq for TickArraySequence

fn eq(&self, other: &TickArraySequence) -> bool

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

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

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

impl Eq for TickArraySequence

impl StructuralPartialEq for TickArraySequence