Struct lsm_tree::Value

pub struct Value {
    pub key: UserKey,
    pub value: UserValue,
    pub seqno: SeqNo,
    pub value_type: ValueType,
}

Represents a value in the LSM-tree

key and value are arbitrary user-defined byte arrays

Disk representation

[seqno; 8 bytes] [tombstone; 1 byte] [key length; 2 bytes] [key; N bytes] [value length; 4 bytes] [value: N bytes]

Fields

key: UserKey

User-defined key - an arbitrary byte array

Supports up to 2^16 bytes

value: UserValue

User-defined value - an arbitrary byte array

Supports up to 2^32 bytes

seqno: SeqNo

Sequence number

value_type: ValueType

Tombstone marker - if this is true, the value has been deleted

Implementations

impl Value

pub fn new<K: Into<UserKey>, V: Into<UserValue>>( key: K, value: V, seqno: u64, value_type: ValueType ) -> Self

Creates a new Value.

Panics

Panics if the key length is empty or greater than 2^16, or the value length is greater than 2^16

Trait Implementations

impl Clone for Value

fn clone(&self) -> Value

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for Value

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

Formats the value using the given formatter.

impl From<(ParsedInternalKey, Arc<[u8]>)> for Value

fn from(val: (ParsedInternalKey, UserValue)) -> Self

Converts to this type from the input type.

impl Ord for Value

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 + PartialOrd,

Restrict a value to a certain interval.

impl PartialEq for Value

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

This method tests for self and other values to be equal, and is used by ==.

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

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

impl PartialOrd for Value

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

This method tests less than (for self and other) and is used by the < operator.

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

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

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

This method tests greater than (for self and other) and is used by the > operator.

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

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

impl Eq for Value

impl StructuralEq for Value

impl StructuralPartialEq for Value