Struct Schedule 

pub struct Schedule { /* private fields */ }

A generated sequence of dates partitioning [effective, termination].

Implementations

impl Schedule

pub fn builder( effective: Date, termination: Date, tenor: Period, ) -> ScheduleBuilder

Starts a ScheduleBuilder for the interval [effective, termination] with the regular period tenor.

pub fn dates(&self) -> &[Date]

The generated dates in ascending order.

pub fn len(&self) -> usize

Number of dates (one more than the number of periods).

pub fn is_empty(&self) -> bool

Always false — a valid schedule has at least two dates.

pub fn effective_date(&self) -> Date

The first (effective) date.

pub fn termination_date(&self) -> Date

The last (termination) date.

pub fn iter(&self) -> Iter<'_, Date>

Iterator over the dates.

Trait Implementations

impl Clone for Schedule

fn clone(&self) -> Schedule

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Schedule

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

Formats the value using the given formatter.

impl Eq for Schedule

impl Index<usize> for Schedule

type Output = Date

The returned type after indexing.

fn index(&self, i: usize) -> &Date

Performs the indexing (container[index]) operation.

impl<'a> IntoIterator for &'a Schedule

type Item = &'a Date

The type of the elements being iterated over.

type IntoIter = Iter<'a, Date>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl PartialEq for Schedule

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