btreelist 0.5.0

A list data structure that has efficient insertion and removal in the middle.
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29

use crate::BTreeList;

/// An iterator over items in a [`BTreeList`].
#[derive(Debug)]
pub struct OwnedIter<T, const B: usize> {
    pub(crate) inner: BTreeList<T, B>,
}

impl<T, const B: usize> Iterator for OwnedIter<T, B> {
    type Item = T;

    fn next(&mut self) -> Option<Self::Item> {
        if !self.inner.is_empty() {
            self.inner.pop_front()
        } else {
            None
        }
    }
}

impl<T, const B: usize> DoubleEndedIterator for OwnedIter<T, B> {
    fn next_back(&mut self) -> Option<Self::Item> {
        if !self.inner.is_empty() {
            self.inner.pop_back()
        } else {
            None
        }
    }
}