Skip to main content

ZigZagIterator

Struct ZigZagIterator 

Source
pub struct ZigZagIterator { /* private fields */ }
Expand description

Zigzag Iterator

Interleave elements from two lists in a zigzag fashion. Elements are yielded alternately from each list until both are exhausted.

§Examples

Basic usage:

let mut it = algorithmz::queue::ZigZagIterator::new(vec![1,2],vec![3,4,5]);
while it.has_next() {
    println!("{}",it.next().unwrap());
}

Implementations§

Source§

impl ZigZagIterator

Source

pub fn new(v1: Vec<i32>, v2: Vec<i32>) -> Self

new iterator constructor

Source

pub fn next(&mut self) -> Option<i32>

grab the next item

Source

pub fn has_next(&self) -> bool

is there a next element?

Auto Trait Implementations§

Blanket Implementations§

Source§

impl<T> Any for T
where T: 'static + ?Sized,

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

impl<T> Borrow<T> for T
where T: ?Sized,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T, U> Into<U> for T
where U: From<T>,

Source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

type Error = Infallible

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
Source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.