Struct core::iter::Unfold [] [src]

pub struct Unfold<St, F> {
    pub state: St,
    // some fields omitted
}
Deprecated since 1.2.0

: has not gained enough traction to retain its position in the standard library

An iterator that passes mutable state to a closure and yields the result.

Examples

An iterator that yields sequential Fibonacci numbers, and stops on overflow.

#![feature(iter_unfold)] fn main() { use std::iter::Unfold; // This iterator will yield up to the last Fibonacci number before the max // value of `u32`. You can simply change `u32` to `u64` in this line if // you want higher values than that. let mut fibonacci = Unfold::new((Some(0u32), Some(1u32)), |&mut (ref mut x2, ref mut x1)| { // Attempt to get the next Fibonacci number // `x1` will be `None` if previously overflowed. let next = match (*x2, *x1) { (Some(x2), Some(x1)) => x2.checked_add(x1), _ => None, }; // Shift left: ret <- x2 <- x1 <- next let ret = *x2; *x2 = *x1; *x1 = next; ret }); for i in fibonacci { println!("{}", i); } }
#![feature(iter_unfold)]
use std::iter::Unfold;

// This iterator will yield up to the last Fibonacci number before the max
// value of `u32`. You can simply change `u32` to `u64` in this line if
// you want higher values than that.
let mut fibonacci = Unfold::new((Some(0u32), Some(1u32)),
                                |&mut (ref mut x2, ref mut x1)| {
    // Attempt to get the next Fibonacci number
    // `x1` will be `None` if previously overflowed.
    let next = match (*x2, *x1) {
        (Some(x2), Some(x1)) => x2.checked_add(x1),
        _ => None,
    };

    // Shift left: ret <- x2 <- x1 <- next
    let ret = *x2;
    *x2 = *x1;
    *x1 = next;

    ret
});

for i in fibonacci {
    println!("{}", i);
}

Fields

state
Deprecated since 1.2.0

: has not gained enough traction to retain its position in the standard library

Internal state that will be passed to the closure on the next iteration

Methods

impl<A, St, F> Unfold<St, F> where F: FnMut(&mut St) -> Option<A>

fn new(initial_state: St, f: F) -> Unfold<St, F>

Deprecated since 1.2.0

: has not gained enough traction to retain its position in the standard library

Creates a new iterator with the specified closure as the "iterator function" and an initial state to eventually pass to the closure

Trait Implementations

impl<A, St, F> Iterator for Unfold<St, F> where F: FnMut(&mut St) -> Option<A>

type Item = A

fn next(&mut self) -> Option<A>

fn size_hint(&self) -> (usize, Option<usize>)

fn count(self) -> usize where Self: Sized

fn last(self) -> Option<Self::Item> where Self: Sized

fn nth(&mut self, n: usize) -> Option<Self::Item> where Self: Sized

fn chain<U>(self, other: U) -> Chain<Self, U::IntoIter> where Self: Sized, U: IntoIterator<Item=Self::Item>

fn zip<U>(self, other: U) -> Zip<Self, U::IntoIter> where Self: Sized, U: IntoIterator

fn map<B, F>(self, f: F) -> Map<Self, F> where Self: Sized, F: FnMut(Self::Item) -> B

fn filter<P>(self, predicate: P) -> Filter<Self, P> where Self: Sized, P: FnMut(&Self::Item) -> bool

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where Self: Sized, F: FnMut(Self::Item) -> Option<B>

fn enumerate(self) -> Enumerate<Self> where Self: Sized

fn peekable(self) -> Peekable<Self> where Self: Sized

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where Self: Sized, P: FnMut(&Self::Item) -> bool

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where Self: Sized, P: FnMut(&Self::Item) -> bool

fn skip(self, n: usize) -> Skip<Self> where Self: Sized

fn take(self, n: usize) -> Take<Self> where Self: Sized

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where Self: Sized, F: FnMut(&mut St, Self::Item) -> Option<B>

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where Self: Sized, U: IntoIterator, F: FnMut(Self::Item) -> U

fn fuse(self) -> Fuse<Self> where Self: Sized

fn inspect<F>(self, f: F) -> Inspect<Self, F> where Self: Sized, F: FnMut(&Self::Item)

fn by_ref(&mut self) -> &mut Self where Self: Sized

fn collect<B: FromIterator<Self::Item>>(self) -> B where Self: Sized

fn partition<B, F>(self, f: F) -> (B, B) where Self: Sized, B: Default + Extend<Self::Item>, F: FnMut(&Self::Item) -> bool

fn fold<B, F>(self, init: B, f: F) -> B where Self: Sized, F: FnMut(B, Self::Item) -> B

fn all<F>(&mut self, f: F) -> bool where Self: Sized, F: FnMut(Self::Item) -> bool

fn any<F>(&mut self, f: F) -> bool where Self: Sized, F: FnMut(Self::Item) -> bool

fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where Self: Sized, P: FnMut(&Self::Item) -> bool

fn position<P>(&mut self, predicate: P) -> Option<usize> where Self: Sized, P: FnMut(Self::Item) -> bool

fn rposition<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool, Self: Sized + ExactSizeIterator + DoubleEndedIterator

fn max(self) -> Option<Self::Item> where Self: Sized, Self::Item: Ord

fn min(self) -> Option<Self::Item> where Self: Sized, Self::Item: Ord

fn min_max(self) -> MinMaxResult<Self::Item> where Self: Sized, Self::Item: Ord

fn max_by<B: Ord, F>(self, f: F) -> Option<Self::Item> where Self: Sized, F: FnMut(&Self::Item) -> B

fn min_by<B: Ord, F>(self, f: F) -> Option<Self::Item> where Self: Sized, F: FnMut(&Self::Item) -> B

fn rev(self) -> Rev<Self> where Self: Sized + DoubleEndedIterator

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where FromA: Default + Extend<A>, FromB: Default + Extend<B>, Self: Sized + Iterator<Item=(A, B)>

fn cloned<'a, T: 'a>(self) -> Cloned<Self> where Self: Sized + Iterator<Item=&'a T>, T: Clone

fn cycle(self) -> Cycle<Self> where Self: Sized + Clone

fn reverse_in_place<'a, T: 'a>(&mut self) where Self: Sized + Iterator<Item=&'a mut T> + DoubleEndedIterator

fn sum<S = Self::Item>(self) -> S where S: Add<Self::Item, Output=S> + Zero, Self: Sized

fn product<P = Self::Item>(self) -> P where P: Mul<Self::Item, Output=P> + One, Self: Sized

Derived Implementations

impl<St: Clone, F: Clone> Clone for Unfold<St, F>

fn clone(&self) -> Unfold<St, F>

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