abin 0.1.6

A library for working with binaries and strings. The library tries to avoid heap-allocations / memory-copy whenever possible by automatically choosing a reasonable strategy: stack for small binaries; static-lifetime-binary or reference-counting.
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
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52

use crate::AnyBin;

/// Consuming iterator for a binary.
#[derive(Debug)]
pub struct IntoIter<T> {
    pos: usize,
    inner: T,
    len: usize,
}

impl<T: AnyBin> IntoIter<T> {
    /// Creates an iterator over the bytes contained by the binary, starting at given
    /// position (`pos`). The position is usually `0` (if you want to read the binary from
    /// the start).
    pub(crate) fn new(inner: T, pos: usize) -> Self {
        let len = inner.len();
        Self { inner, pos, len }
    }

    /// Consumes this `IntoIter`, returning the underlying value.
    pub fn into_inner(self) -> T {
        self.inner
    }
}

impl<T: AnyBin> Iterator for IntoIter<T> {
    type Item = u8;

    #[inline]
    fn next(&mut self) -> Option<u8> {
        let current_pos = self.pos;
        if current_pos < self.len {
            self.pos += 1;
            Some(self.inner.as_slice()[current_pos])
        } else {
            // out of bounds
            None
        }
    }

    #[inline]
    fn size_hint(&self) -> (usize, Option<usize>) {
        let rem = if self.pos < self.len {
            self.len - self.pos
        } else {
            0
        };
        (rem, Some(rem))
    }
}

impl<T: AnyBin> ExactSizeIterator for IntoIter<T> {}