Struct LazyStream 

pub struct LazyStream<T: Clone> { /* private fields */ }

A lazy, eventually-periodic stream.

The stream is defined by a finite prefix followed by an infinitely repeating cycle. If cycle is empty, the stream is exactly prefix (i.e. finite for practical purposes but the API treats it as an infinite stream repeating the last element when both slices are exhausted, which is handled in the accessor functions).

Implementations

impl<T: Clone> LazyStream<T>

pub fn new(prefix: Vec<T>, cycle: Vec<T>) -> Self

Create a stream with an explicit prefix and repeating cycle.

If cycle is empty the stream is treated as a finite prefix followed by an infinite repetition of the last prefix element; if the prefix is also empty the stream returns the default value if T: Default, but callers should guarantee cycle is non-empty for infinite streams.

pub fn constant(val: T) -> Self

Create the constant stream [val, val, val, ...].

pub fn cycle(vals: Vec<T>) -> Self

Create a stream that repeats vals forever: vals\[0\], vals\[1\], ..., vals[n-1], vals\[0\], ....

Panics if vals is empty.

pub fn take(&self, n: usize) -> Vec<T>

Return the first n elements of the stream.

pub fn nth(&self, n: usize) -> T

Return the n-th element (0-indexed).

pub fn map<U: Clone, F: Fn(&T) -> U>(&self, f: F) -> LazyStream<U>

Apply f element-wise, producing a new LazyStream<U>.

pub fn zip<U: Clone, V: Clone, F: Fn(&T, &U) -> V>( &self, other: &LazyStream<U>, f: F, ) -> LazyStream<V>

Point-wise combine two streams with a binary function.

The resulting stream has:

• prefix length = max of the two prefixes, extended by cycling the shorter cycle
• cycle length = lcm of the two cycle lengths

pub fn to_approx(&self, n: usize) -> StreamApprox<T>

Convert the stream to a finite unrolled approximation of depth n.

Trait Implementations

impl<T: Clone + Clone> Clone for LazyStream<T>

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

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<T: Debug + Clone> Debug for LazyStream<T>

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

Formats the value using the given formatter.

impl<T: PartialEq + Clone> PartialEq for LazyStream<T>

fn eq(&self, other: &LazyStream<T>) -> 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<T: Eq + Clone> Eq for LazyStream<T>

impl<T: Clone> StructuralPartialEq for LazyStream<T>