pub struct Buffer {
chunks: LinkedList<Chunk>,
pos: usize,
}
impl Buffer {
pub fn new() -> Buffer {
Buffer {
chunks: LinkedList::new(),
pos: 0,
}
}
fn grow_to(&mut self, index: usize) -> io::Result<()> {
let chunk_index = index / CHUNK_SIZE;
let capacity = self.chunks.len();
if chunk_index < capacity {
return Ok(());
}
for _ in capacity..(chunk_index + 1) {
self.chunks.push_back(Chunk::new()?);
}
Ok(())
}
pub fn len(&self) -> usize {
if self.chunks.is_empty() { 0 } else {
let last = self.chunks.back().unwrap();
(self.chunks.len() - 1) * CHUNK_SIZE + last.len()
}
}
pub fn pop_front(&mut self) -> Option<Chunk> {
self.pos = if self.pos > CHUNK_SIZE { self.pos - CHUNK_SIZE } else { 0 };
self.chunks.pop_front()
}
}
impl io::Write for Buffer {
fn write(&mut self, data: &[u8]) -> io::Result<usize> {
if data.is_empty() { return Ok(0); }
self.grow_to(self.pos + data.len() - 1)?;
let len = self.chunks.len();
let first_index = self.pos / CHUNK_SIZE;
let mut iter = if first_index < len - first_index {
self.chunks.cursor_front_mut()
} else {
self.chunks.cursor_back_mut()
};
let mut written: usize = 0;
for i in 0..data.len() {
let cursor = self.pos + i;
let chunk_index = cursor / CHUNK_SIZE;
let byte_index = cursor % CHUNK_SIZE;
iter.at(chunk_index).set(byte_index, data[i]);
written += 1;
}
self.pos += written;
Ok(written)
}
fn flush(&mut self) -> io::Result<()> {
Ok(())
}
}
impl io::Seek for Buffer {
fn seek(&mut self, pos: SeekFrom) -> io::Result<u64> {
let offset = match pos {
SeekFrom::Start(offset) => offset as i128,
SeekFrom::End(n) => self.len() as i128 + n as i128,
SeekFrom::Current(n) => self.pos as i128 + n as i128,
};
if offset < 0 {
return Err(Error::new(ErrorKind::InvalidInput, "Seeking before start of buffer!"));
}
let trunc = offset as usize;
if trunc as i128 != offset {
return Err(Error::new(ErrorKind::OutOfMemory, "Tried seeking past the memory limit!"));
}
self.pos = offset as usize;
Ok(self.pos as u64)
}
fn stream_position(&mut self) -> io::Result<u64> {
Ok(self.pos as u64)
}
}