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 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70
use crate::io;
pub struct LineColIterator<I> {
iter: I,
/// Index of the current line. Characters in the first line of the input
/// (before the first newline character) are in line 1.
line: usize,
/// Index of the current column. The first character in the input and any
/// characters immediately following a newline character are in column 1.
/// The column is 0 immediately after a newline character has been read.
col: usize,
/// Byte offset of the start of the current line. This is the sum of lengths
/// of all previous lines. Keeping track of things this way allows efficient
/// computation of the current line, column, and byte offset while only
/// updating one of the counters in `next()` in the common case.
start_of_line: usize,
}
impl<I> LineColIterator<I>
where
I: Iterator<Item = io::Result<u8>>,
{
pub fn new(iter: I) -> LineColIterator<I> {
LineColIterator {
iter,
line: 1,
col: 0,
start_of_line: 0,
}
}
pub fn line(&self) -> usize {
self.line
}
pub fn col(&self) -> usize {
self.col
}
pub fn byte_offset(&self) -> usize {
self.start_of_line + self.col
}
}
impl<I> Iterator for LineColIterator<I>
where
I: Iterator<Item = io::Result<u8>>,
{
type Item = io::Result<u8>;
fn next(&mut self) -> Option<io::Result<u8>> {
match self.iter.next() {
None => None,
Some(Ok(b'\n')) => {
self.start_of_line += self.col + 1;
self.line += 1;
self.col = 0;
Some(Ok(b'\n'))
}
Some(Ok(c)) => {
self.col += 1;
Some(Ok(c))
}
Some(Err(e)) => Some(Err(e)),
}
}
}