Struct rerun::TimePoint

pub struct TimePoint(BTreeMap<Timeline, TimeInt>);

A point in time on any number of Timelines.

It can be represented by Time, a sequence index, or a mix of several things.

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<Timeline, TimeInt>

Implementations

impl TimePoint

pub fn get(&self, timeline: &Timeline) -> Option<&TimeInt>

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

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

pub fn remove(&mut self, timeline: &Timeline) -> Option<TimeInt>

pub fn is_static(&self) -> bool

pub fn is_empty(&self) -> bool

pub fn timelines(&self) -> impl ExactSizeIterator

pub fn times(&self) -> impl ExactSizeIterator

pub fn iter(&self) -> impl ExactSizeIterator

pub fn union_max(self, rhs: &TimePoint) -> TimePoint

Computes the union of two TimePoints, keeping the maximum time value in case of conflicts.

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<(), Error>

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<TimePoint, <__D as Deserializer<'de>>::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

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

where T: TryInto<TimeInt>,

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

Converts to this type from the input type.

impl From<BTreeMap<Timeline, TimeInt>> for TimePoint

fn from(timelines: BTreeMap<Timeline, TimeInt>) -> TimePoint

Converts to this type from the input type.

impl<T> FromIterator<(Timeline, T)> for TimePoint

where T: TryInto<TimeInt>,

fn from_iter<I>(iter: I) -> TimePoint

where I: IntoIterator<Item = (Timeline, T)>,

Creates a value from an iterator.

impl Hash for TimePoint

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

type Item = (&'a Timeline, &'a TimeInt)

The type of the elements being iterated over.

type IntoIter = Iter<'a, Timeline, TimeInt>

Which kind of iterator are we turning this into?

fn into_iter(self) -> <&'a TimePoint as IntoIterator>::IntoIter

Creates an iterator from a value.

impl IntoIterator for TimePoint

type Item = (Timeline, TimeInt)

The type of the elements being iterated over.

type IntoIter = IntoIter<Timeline, TimeInt>

Which kind of iterator are we turning this into?

fn into_iter(self) -> <TimePoint as IntoIterator>::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 + PartialOrd,

Restrict a value to a certain interval.

impl PartialEq for TimePoint

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

This method tests less than (for self and other) and is used by the < operator.

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

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

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

This method tests greater than (for self and other) and is used by the > operator.

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

This method 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 as Serializer>::Ok, <__S as Serializer>::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl SizeBytes for TimePoint

fn heap_size_bytes(&self) -> u64

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

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