Struct TimePoint

pub struct TimePoint(BTreeMap<TimelineName, TimeCell>);

A point in time on any number of Timelines.

You can think of this as all the index values for one row of data.

If a TimePoint is empty (TimePoint::default), the data will be considered static. Static data has no time associated with it, exists on all timelines, and unconditionally shadows any temporal data of the same type.

Tuple Fields

0: BTreeMap<TimelineName, TimeCell>

Implementations

impl TimePoint

pub fn get(&self, timeline_name: &TimelineName) -> Option<NonMinI64>

pub fn insert_cell( &mut self, timeline_name: impl Into<TimelineName>, cell: impl Into<TimeCell>, )

pub fn insert(&mut self, timeline: Timeline, time: impl TryInto<TimeInt>)

pub fn with_index( self, timeline_name: impl Into<TimelineName>, cell: impl Into<TimeCell>, ) -> Self

pub fn with(self, timeline: Timeline, time: impl TryInto<TimeInt>) -> Self

pub fn remove(&mut self, timeline: &TimelineName)

pub fn is_static(&self) -> bool

pub fn is_empty(&self) -> bool

pub fn timeline_names(&self) -> impl ExactSizeIterator<Item = &TimelineName>

pub fn iter(&self) -> impl ExactSizeIterator<Item = (&TimelineName, &TimeCell)>

Trait Implementations

impl Clone for TimePoint

fn clone(&self) -> TimePoint

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for TimePoint

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

Formats the value using the given formatter.

impl Default for TimePoint

fn default() -> TimePoint

Returns the “default value” for a type.

impl<'de> Deserialize<'de> for TimePoint

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<Name, Cell, const N: usize> From<[(Name, Cell); N]> for TimePoint

where Name: Into<TimelineName>, Cell: Into<TimeCell>,

fn from(timelines: [(Name, Cell); N]) -> Self

Converts to this type from the input type.

impl<T: TryInto<TimeInt>, const N: usize> From<[(Timeline, T); N]> for TimePoint

fn from(timelines: [(Timeline, T); N]) -> Self

Converts to this type from the input type.

impl From<BTreeMap<TimelineName, TimeCell>> for TimePoint

fn from(map: BTreeMap<TimelineName, TimeCell>) -> Self

Converts to this type from the input type.

impl<Name, Cell> FromIterator<(Name, Cell)> for TimePoint

where Name: Into<TimelineName>, Cell: Into<TimeCell>,

fn from_iter<I: IntoIterator<Item = (Name, Cell)>>(iter: I) -> Self

Creates a value from an iterator.

impl<T: TryInto<TimeInt>> FromIterator<(Timeline, T)> for TimePoint

fn from_iter<I: IntoIterator<Item = (Timeline, T)>>(iter: I) -> Self

Creates a value from an iterator.

impl Hash for TimePoint

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

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<'a> IntoIterator for &'a TimePoint

type Item = (&'a TimelineName, &'a TimeCell)

The type of the elements being iterated over.

type IntoIter = Iter<'a, TimelineName, TimeCell>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl IntoIterator for TimePoint

type Item = (TimelineName, TimeCell)

The type of the elements being iterated over.

type IntoIter = IntoIter<TimelineName, TimeCell>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl Ord for TimePoint

fn cmp(&self, other: &TimePoint) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized,

Restrict a value to a certain interval.

impl PartialEq for TimePoint

fn eq(&self, other: &TimePoint) -> 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 PartialOrd for TimePoint

fn partial_cmp(&self, other: &TimePoint) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

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

Tests less than (for self and other) and is used by the < operator.

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

Tests less than or equal to (for self and other) and is used by the <= operator.

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

Tests greater than (for self and other) and is used by the > operator.

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

Tests greater than or equal to (for self and other) and is used by the >= operator.

impl Serialize for TimePoint

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

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl SizeBytes for TimePoint

fn heap_size_bytes(&self) -> u64

Returns how many bytes self uses on the heap.

fn total_size_bytes(&self) -> u64

Returns the total size of self in bytes, accounting for both stack and heap space.

fn stack_size_bytes(&self) -> u64

Returns the total size of self on the stack, in bytes.

fn is_pod() -> bool

Is Self just plain old data?

impl Eq for TimePoint

impl StructuralPartialEq for TimePoint