pub(crate) struct DictionaryPageHeader {
pub(crate) num_values: i32,
pub(crate) encoding: Encoding,
pub(crate) is_sorted: Option<bool>,
}Fields§
§num_values: i32Number of values in the dictionary
encoding: EncodingEncoding using this dictionary page
is_sorted: Option<bool>If true, the entries in the dictionary are sorted in ascending order
Trait Implementations§
Source§impl Clone for DictionaryPageHeader
impl Clone for DictionaryPageHeader
Source§fn clone(&self) -> DictionaryPageHeader
fn clone(&self) -> DictionaryPageHeader
Returns a duplicate of the value. Read more
1.0.0 · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source. Read moreSource§impl Debug for DictionaryPageHeader
impl Debug for DictionaryPageHeader
Source§impl PartialEq for DictionaryPageHeader
impl PartialEq for DictionaryPageHeader
Source§impl<'a, R: ThriftCompactInputProtocol<'a>> ReadThrift<'a, R> for DictionaryPageHeader
impl<'a, R: ThriftCompactInputProtocol<'a>> ReadThrift<'a, R> for DictionaryPageHeader
Source§fn read_thrift(prot: &mut R) -> Result<Self>
fn read_thrift(prot: &mut R) -> Result<Self>
Read an object of type
Self from the input protocol object.Source§impl WriteThrift for DictionaryPageHeader
impl WriteThrift for DictionaryPageHeader
Source§const ELEMENT_TYPE: ElementType = ElementType::Struct
const ELEMENT_TYPE: ElementType = ElementType::Struct
The
ElementType to use when a list of this object is written.Source§fn write_thrift<W: Write>(
&self,
writer: &mut ThriftCompactOutputProtocol<W>,
) -> Result<()>
fn write_thrift<W: Write>( &self, writer: &mut ThriftCompactOutputProtocol<W>, ) -> Result<()>
Serialize this object to the given
writer.Source§impl WriteThriftField for DictionaryPageHeader
impl WriteThriftField for DictionaryPageHeader
Source§fn write_thrift_field<W: Write>(
&self,
writer: &mut ThriftCompactOutputProtocol<W>,
field_id: i16,
last_field_id: i16,
) -> Result<i16>
fn write_thrift_field<W: Write>( &self, writer: &mut ThriftCompactOutputProtocol<W>, field_id: i16, last_field_id: i16, ) -> Result<i16>
Used to write struct fields (which may be primitive or IDL defined types). This will
write the field marker for the given
field_id, using last_field_id to compute the
field delta used by the Thrift compact protocol. On success this will return field_id
to be used in chaining.impl Eq for DictionaryPageHeader
impl StructuralPartialEq for DictionaryPageHeader
Auto Trait Implementations§
impl Freeze for DictionaryPageHeader
impl RefUnwindSafe for DictionaryPageHeader
impl Send for DictionaryPageHeader
impl Sync for DictionaryPageHeader
impl Unpin for DictionaryPageHeader
impl UnwindSafe for DictionaryPageHeader
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Checks if this value is equivalent to the given key. Read more
§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Compare self to
key and return true if they are equal.Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left is true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left(&self) returns true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read more