Struct parquet::format::BloomFilterHeader

pub struct BloomFilterHeader {
    pub num_bytes: i32,
    pub algorithm: BloomFilterAlgorithm,
    pub hash: BloomFilterHash,
    pub compression: BloomFilterCompression,
}

Bloom filter header is stored at beginning of Bloom filter data of each column and followed by its bitset.

Fields

num_bytes: i32

The size of bitset in bytes *

algorithm: BloomFilterAlgorithm

The algorithm for setting bits. *

hash: BloomFilterHash

The hash function used for Bloom filter. *

compression: BloomFilterCompression

The compression used in the Bloom filter *

Implementations

impl BloomFilterHeader

pub fn new( num_bytes: i32, algorithm: BloomFilterAlgorithm, hash: BloomFilterHash, compression: BloomFilterCompression, ) -> BloomFilterHeader

Trait Implementations

impl Clone for BloomFilterHeader

fn clone(&self) -> BloomFilterHeader

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for BloomFilterHeader

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Hash for BloomFilterHeader

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl Ord for BloomFilterHeader

fn cmp(&self, other: &BloomFilterHeader) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized + PartialOrd,

Restrict a value to a certain interval.

impl PartialEq for BloomFilterHeader

fn eq(&self, other: &BloomFilterHeader) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl PartialOrd for BloomFilterHeader

fn partial_cmp(&self, other: &BloomFilterHeader) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

fn lt(&self, other: &Rhs) -> bool

Tests less than (for self and other) and is used by the < operator.

fn le(&self, other: &Rhs) -> bool

Tests less than or equal to (for self and other) and is used by the <= operator.

fn gt(&self, other: &Rhs) -> bool

Tests greater than (for self and other) and is used by the > operator.

fn ge(&self, other: &Rhs) -> bool

Tests greater than or equal to (for self and other) and is used by the >= operator.

impl TSerializable for BloomFilterHeader

fn read_from_in_protocol<T: TInputProtocol>( i_prot: &mut T, ) -> Result<BloomFilterHeader>

Reads the struct from the input Thrift protocol

fn write_to_out_protocol<T: TOutputProtocol>( &self, o_prot: &mut T, ) -> Result<()>

Writes the struct to the output Thrift protocol

impl Eq for BloomFilterHeader

impl StructuralPartialEq for BloomFilterHeader