Struct parquet2::read::Decompressor

pub struct Decompressor<P: PageIterator> { /* private fields */ }

Decompressor that allows re-using the page buffer of PageIterator.

Implementation

The implementation depends on whether a page is compressed or not.

PageReader(a), CompressedPage(b), Decompressor(c), DecompressedPage(d)

un-compressed pages:

page iter: a is swapped with b decompress iter: b is swapped with d, b is swapped with a therefore:

• PageReader has its buffer back
• Decompressor’s buffer is un-used
• DecompressedPage has the same data as CompressedPage had

compressed pages:

page iter: a is swapped with b decompress iter:

• b is decompressed into c
• b is swapped with a
• c is moved to d
• (next iteration): d is moved to c therefore, while the page is available:

• PageReader has its buffer back
• Decompressor’s buffer empty
• DecompressedPage has the decompressed buffer after the page is used:
• PageReader has its buffer back
• Decompressor has its buffer back
• DecompressedPage has an empty buffer

Implementations

impl<P: PageIterator> Decompressor<P>

pub fn new(iter: P, buffer: Vec<u8>) -> Self

Creates a new Decompressor.

pub fn into_buffers(self) -> (Vec<u8>, Vec<u8>)

Returns two buffers: the first buffer corresponds to the page buffer, the second to the decompression buffer.

Trait Implementations

impl<P: PageIterator> FallibleStreamingIterator for Decompressor<P>

type Item = Page

The type being iterated over.

type Error = Error

The error type of iteration.

fn advance(&mut self) -> Result<()>

Advances the iterator to the next position.

fn get(&self) -> Option<&Self::Item>

Returns the current element.

fn next(&mut self) -> Result<Option<&Self::Item>, Self::Error>

Advances the iterator, returning the next element.

fn size_hint(&self) -> (usize, Option<usize>)

Returns bounds on the number of remaining elements in the iterator.

fn all<F>(&mut self, f: F) -> Result<bool, Self::Error>where Self: Sized, F: FnMut(&Self::Item) -> bool,

Determines if all elements of the iterator satisfy a predicate.

fn any<F>(&mut self, f: F) -> Result<bool, Self::Error>where Self: Sized, F: FnMut(&Self::Item) -> bool,

Determines if any elements of the iterator satisfy a predicate.

fn by_ref(&mut self) -> &mut Selfwhere Self: Sized,

Borrows an iterator, rather than consuming it.

fn count(self) -> Result<usize, Self::Error>where Self: Sized,

Returns the number of remaining elements in the iterator.

fn filter<F>(self, f: F) -> Filter<Self, F>where Self: Sized, F: FnMut(&Self::Item) -> bool,

Returns an iterator which filters elements by a predicate.

fn find<F>(&mut self, f: F) -> Result<Option<&Self::Item>, Self::Error>where Self: Sized, F: FnMut(&Self::Item) -> bool,

Returns the first element of the iterator which satisfies a predicate.

fn for_each<F>(self, f: F) -> Result<(), Self::Error>where Self: Sized, F: FnMut(&Self::Item),

Calls a closure on each element of an iterator.

fn fuse(self) -> Fuse<Self>where Self: Sized,

Returns an iterator which is well-behaved at the beginning and end of iteration.

fn map<F, B>(self, f: F) -> Map<Self, F, B>where Self: Sized, F: FnMut(&Self::Item) -> B,

Returns an iterator which applies a transform to elements.

fn map_ref<F, B>(self, f: F) -> MapRef<Self, F>where Self: Sized, F: Fn(&Self::Item) -> &B, B: ?Sized,

Returns an iterator which applies a transform to elements.

fn map_err<F, B>(self, f: F) -> MapErr<Self, F>where Self: Sized, F: Fn(Self::Error) -> B,

Returns an iterator that applies a transform to errors.

fn nth(&mut self, n: usize) -> Result<Option<&Self::Item>, Self::Error>

Returns the nth element of the iterator.

fn position<F>(&mut self, f: F) -> Result<Option<usize>, Self::Error>where Self: Sized, F: FnMut(&Self::Item) -> bool,

Returns the position of the first element matching a predicate.

fn skip(self, n: usize) -> Skip<Self>where Self: Sized,

Returns an iterator which skips the first n elements.

fn skip_while<F>(self, f: F) -> SkipWhile<Self, F>where Self: Sized, F: FnMut(&Self::Item) -> bool,

Returns an iterator which skips the first sequence of elements matching a predicate.

fn take(self, n: usize) -> Take<Self>where Self: Sized,

Returns an iterator which only returns the first n elements.

fn take_while<F>(self, f: F) -> TakeWhile<Self, F>where Self: Sized, F: FnMut(&Self::Item) -> bool,

Returns an iterator which only returns the first sequence of elements matching a predicate.