Struct Entry 

pub struct Entry<K: Key> {
    pub key: K,
    pub offset: Offset,
}

Represents a Key-Value pair. Stored in leaf nodes and used as input for building.

Fields

key: K

The key part of the entry.

offset: Offset

The value part of the entry (u64 offset).

Implementations

impl<K: Key> Entry<K>

pub const SERIALIZED_SIZE: usize

The total size of the entry when serialized.

pub fn new(key: K, offset: Offset) -> Self

pub fn write_to<W: Write>(&self, writer: &mut W) -> Result<usize>

Serializes the entire entry (key followed by value) to a writer. Assumes little-endian encoding for the Value.

pub fn from_reader<R: Read>(reader: &mut R) -> Result<Self>

Deserializes an entire entry from a reader. Assumes little-endian encoding for the Value.

pub fn from_bytes(raw: &[u8]) -> Result<Self>

pub fn key_size() -> usize

impl<K: Key> Entry<K>

S-Tree node. NodeItem’s offset is the offset to the actual offset section in the file. This is to support duplicate keys.

pub fn new_with_key(key: K) -> NodeItem<K>

pub fn create(offset: u64) -> NodeItem<K>

pub fn set_key(&mut self, key: K)

pub fn set_offset(&mut self, offset: u64)

pub fn equals(&self, other: &NodeItem<K>) -> bool

Trait Implementations

impl<K: Clone + Key> Clone for Entry<K>

fn clone(&self) -> Entry<K>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<K: Debug + Key> Debug for Entry<K>

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

Formats the value using the given formatter.

impl<K: Key> Ord for Entry<K>

fn cmp(&self, other: &Self) -> 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,

Restrict a value to a certain interval.

impl<K: PartialEq + Key> PartialEq for Entry<K>

fn eq(&self, other: &Entry<K>) -> 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<K: Key> PartialOrd for Entry<K>

fn partial_cmp(&self, other: &Self) -> 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<K: Eq + Key> Eq for Entry<K>

impl<K: Key> StructuralPartialEq for Entry<K>