lsm_tree/
value.rs

1// Copyright (c) 2024-present, fjall-rs
2// This source code is licensed under both the Apache 2.0 and MIT License
3// (found in the LICENSE-* files in the repository)
4
5use crate::{key::InternalKey, Slice, ValueType};
6
7/// User defined key
8pub type UserKey = Slice;
9
10/// User defined data (blob of bytes)
11pub type UserValue = Slice;
12
13/// Sequence number - a monotonically increasing counter
14///
15/// Values with the same seqno are part of the same batch.
16///
17/// A value with a higher sequence number shadows an item with the
18/// same key and lower sequence number.
19/// This enables MVCC.
20///
21/// Stale items are lazily garbage-collected during compaction.
22pub type SeqNo = u64;
23
24/// Internal representation of KV pairs
25#[derive(Clone, Eq)]
26pub struct InternalValue {
27    /// Internal key
28    pub key: InternalKey,
29
30    /// User-defined value - an arbitrary byte array
31    ///
32    /// Supports up to 2^32 bytes
33    pub value: UserValue,
34}
35
36impl InternalValue {
37    /// Creates a new [`Value`].
38    ///
39    /// # Panics
40    ///
41    /// Panics if the key length is empty or greater than 2^16, or the value length is greater than 2^32.
42    pub fn new<V: Into<UserValue>>(key: InternalKey, value: V) -> Self {
43        let value = value.into();
44
45        assert!(!key.user_key.is_empty(), "key may not be empty");
46        assert!(
47            u32::try_from(value.len()).is_ok(),
48            "values can be 2^32 bytes in length"
49        );
50
51        Self { key, value }
52    }
53
54    /// Creates a new [`Value`].
55    ///
56    /// # Panics
57    ///
58    /// Panics if the key length is empty or greater than 2^16, or the value length is greater than 2^32.
59    pub fn from_components<K: Into<UserKey>, V: Into<UserValue>>(
60        user_key: K,
61        value: V,
62        seqno: SeqNo,
63        value_type: ValueType,
64    ) -> Self {
65        let key = InternalKey::new(user_key, seqno, value_type);
66        Self::new(key, value)
67    }
68
69    /// Creates a new tombstone.
70    ///
71    /// # Panics
72    ///
73    /// Panics if the key length is empty or greater than 2^16.
74    pub fn new_tombstone<K: Into<UserKey>>(key: K, seqno: u64) -> Self {
75        let key = InternalKey::new(key, seqno, ValueType::Tombstone);
76        Self::new(key, vec![])
77    }
78
79    /// Creates a new weak tombstone.
80    ///
81    /// # Panics
82    ///
83    /// Panics if the key length is empty or greater than 2^16.
84    pub fn new_weak_tombstone<K: Into<UserKey>>(key: K, seqno: u64) -> Self {
85        let key = InternalKey::new(key, seqno, ValueType::WeakTombstone);
86        Self::new(key, vec![])
87    }
88
89    #[doc(hidden)]
90    #[must_use]
91    pub fn is_tombstone(&self) -> bool {
92        self.key.is_tombstone()
93    }
94}
95
96impl PartialEq for InternalValue {
97    fn eq(&self, other: &Self) -> bool {
98        self.key == other.key
99    }
100}
101
102impl std::fmt::Debug for InternalValue {
103    fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {
104        write!(
105            f,
106            "{:?} => {:?}",
107            self.key,
108            if self.value.len() >= 64 {
109                format!("[ ... {} bytes ]", self.value.len())
110            } else {
111                format!("{:?}", self.value)
112            }
113        )
114    }
115}
116
117#[cfg(test)]
118mod tests {
119    use super::*;
120    use test_log::test;
121
122    #[test]
123    fn pik_cmp_user_key() {
124        let a = InternalKey::new(*b"a", 0, ValueType::Value);
125        let b = InternalKey::new(*b"b", 0, ValueType::Value);
126        assert!(a < b);
127    }
128
129    #[test]
130    fn pik_cmp_seqno() {
131        let a = InternalKey::new(*b"a", 0, ValueType::Value);
132        let b = InternalKey::new(*b"a", 1, ValueType::Value);
133        assert!(a > b);
134    }
135}
lsm_tree/value.rs

lsm_tree/
value.rs
