aprender-db 0.51.0

GPU-first embedded analytics database with SIMD fallback and SQL query interface
Documentation
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
//! Key-Value Store Module for PAIML Stack Integration (Phase 6)
//!
//! Provides a simple, high-performance key-value store with:
//! - SIMD-optimized key hashing via `trueno::hash`
//! - In-memory and persistent backends
//! - Async-first API compatible with pforge `StateManager`
//!
//! # Example
//!
//! ```rust,no_run
//! use trueno_db::kv::{KvStore, MemoryKvStore};
//!
//! # async fn example() -> trueno_db::Result<()> {
//! let store = MemoryKvStore::new();
//!
//! // Basic operations
//! store.set("key", b"value".to_vec()).await?;
//! let value = store.get("key").await?;
//! assert_eq!(value, Some(b"value".to_vec()));
//!
//! store.delete("key").await?;
//! assert!(!store.exists("key").await?);
//! # Ok(())
//! # }
//! ```

mod memory;

#[cfg(feature = "compression")]
mod compressed;

pub use memory::MemoryKvStore;

#[cfg(feature = "compression")]
pub use compressed::{CompressedKvStore, Compression};

// Re-export trueno hash functions for KV consumers
pub use trueno::{hash_bytes, hash_key, hash_keys_batch};

use crate::Result;
use std::future::Future;

/// Key-value store trait for pforge state management integration.
///
/// This trait is designed to match pforge's `StateManager` interface
/// for seamless integration while leveraging trueno's SIMD capabilities.
pub trait KvStore: Send + Sync {
    /// Get a value by key.
    ///
    /// Returns `None` if the key doesn't exist.
    fn get(&self, key: &str) -> impl Future<Output = Result<Option<Vec<u8>>>> + Send;

    /// Set a value for a key.
    ///
    /// Overwrites any existing value.
    fn set(&self, key: &str, value: Vec<u8>) -> impl Future<Output = Result<()>> + Send;

    /// Delete a key.
    ///
    /// No-op if the key doesn't exist.
    fn delete(&self, key: &str) -> impl Future<Output = Result<()>> + Send;

    /// Check if a key exists.
    fn exists(&self, key: &str) -> impl Future<Output = Result<bool>> + Send;

    /// Get multiple keys in a batch (SIMD-optimized).
    ///
    /// Returns values in the same order as keys. Missing keys return `None`.
    fn batch_get(
        &self,
        keys: &[&str],
    ) -> impl Future<Output = Result<Vec<Option<Vec<u8>>>>> + Send {
        async move {
            let mut results = Vec::with_capacity(keys.len());
            for key in keys {
                results.push(self.get(key).await?);
            }
            Ok(results)
        }
    }

    /// Set multiple key-value pairs in a batch (SIMD-optimized).
    fn batch_set(&self, pairs: Vec<(&str, Vec<u8>)>) -> impl Future<Output = Result<()>> + Send {
        async move {
            for (key, value) in pairs {
                self.set(key, value).await?;
            }
            Ok(())
        }
    }
}

#[cfg(test)]
mod tests {
    use super::*;

    // ============================================================
    // RED PHASE: These tests define the expected behavior
    // ============================================================

    #[tokio::test]
    async fn test_memory_kv_set_get() {
        let store = MemoryKvStore::new();

        store.set("key1", b"value1".to_vec()).await.unwrap();
        let value = store.get("key1").await.unwrap();

        assert_eq!(value, Some(b"value1".to_vec()));
    }

    #[tokio::test]
    async fn test_memory_kv_get_nonexistent() {
        let store = MemoryKvStore::new();

        let value = store.get("nonexistent").await.unwrap();

        assert_eq!(value, None);
    }

    #[tokio::test]
    async fn test_memory_kv_overwrite() {
        let store = MemoryKvStore::new();

        store.set("key", b"value1".to_vec()).await.unwrap();
        store.set("key", b"value2".to_vec()).await.unwrap();
        let value = store.get("key").await.unwrap();

        assert_eq!(value, Some(b"value2".to_vec()));
    }

    #[tokio::test]
    async fn test_memory_kv_delete() {
        let store = MemoryKvStore::new();

        store.set("key", b"value".to_vec()).await.unwrap();
        store.delete("key").await.unwrap();
        let value = store.get("key").await.unwrap();

        assert_eq!(value, None);
    }

    #[tokio::test]
    async fn test_memory_kv_delete_nonexistent() {
        let store = MemoryKvStore::new();

        // Should not error
        store.delete("nonexistent").await.unwrap();
    }

    #[tokio::test]
    async fn test_memory_kv_exists() {
        let store = MemoryKvStore::new();

        assert!(!store.exists("key").await.unwrap());

        store.set("key", b"value".to_vec()).await.unwrap();
        assert!(store.exists("key").await.unwrap());

        store.delete("key").await.unwrap();
        assert!(!store.exists("key").await.unwrap());
    }

    #[tokio::test]
    async fn test_memory_kv_batch_get() {
        let store = MemoryKvStore::new();

        store.set("a", b"1".to_vec()).await.unwrap();
        store.set("b", b"2".to_vec()).await.unwrap();
        // "c" intentionally not set

        let results = store.batch_get(&["a", "b", "c"]).await.unwrap();

        assert_eq!(results.len(), 3);
        assert_eq!(results[0], Some(b"1".to_vec()));
        assert_eq!(results[1], Some(b"2".to_vec()));
        assert_eq!(results[2], None);
    }

    #[tokio::test]
    async fn test_memory_kv_batch_set() {
        let store = MemoryKvStore::new();

        store
            .batch_set(vec![("a", b"1".to_vec()), ("b", b"2".to_vec()), ("c", b"3".to_vec())])
            .await
            .unwrap();

        assert_eq!(store.get("a").await.unwrap(), Some(b"1".to_vec()));
        assert_eq!(store.get("b").await.unwrap(), Some(b"2".to_vec()));
        assert_eq!(store.get("c").await.unwrap(), Some(b"3".to_vec()));
    }

    #[tokio::test]
    async fn test_memory_kv_concurrent_access() {
        use std::sync::Arc;

        let store = Arc::new(MemoryKvStore::new());
        let mut handles = vec![];

        // Spawn 100 concurrent writers
        for i in 0..100 {
            let store = Arc::clone(&store);
            handles.push(tokio::spawn(async move {
                let key = format!("key{i}");
                let value = format!("value{i}").into_bytes();
                store.set(&key, value).await.unwrap();
            }));
        }

        for handle in handles {
            handle.await.unwrap();
        }

        // Verify all writes succeeded
        for i in 0..100 {
            let key = format!("key{i}");
            let expected = format!("value{i}").into_bytes();
            assert_eq!(store.get(&key).await.unwrap(), Some(expected));
        }
    }

    #[tokio::test]
    async fn test_memory_kv_empty_key() {
        let store = MemoryKvStore::new();

        store.set("", b"empty_key_value".to_vec()).await.unwrap();
        assert_eq!(store.get("").await.unwrap(), Some(b"empty_key_value".to_vec()));
    }

    #[tokio::test]
    async fn test_memory_kv_empty_value() {
        let store = MemoryKvStore::new();

        store.set("key", vec![]).await.unwrap();
        assert_eq!(store.get("key").await.unwrap(), Some(vec![]));
    }

    #[tokio::test]
    async fn test_memory_kv_large_value() {
        let store = MemoryKvStore::new();

        let large_value = vec![0u8; 1024 * 1024]; // 1MB
        store.set("large", large_value.clone()).await.unwrap();

        assert_eq!(store.get("large").await.unwrap(), Some(large_value));
    }

    #[tokio::test]
    async fn test_memory_kv_with_capacity() {
        let store = MemoryKvStore::with_capacity(100);
        store.set("key", b"value".to_vec()).await.unwrap();
        assert_eq!(store.get("key").await.unwrap(), Some(b"value".to_vec()));
    }

    #[tokio::test]
    async fn test_memory_kv_len_and_is_empty() {
        let store = MemoryKvStore::new();

        assert!(store.is_empty());
        assert_eq!(store.len(), 0);

        store.set("key1", b"value1".to_vec()).await.unwrap();
        assert!(!store.is_empty());
        assert_eq!(store.len(), 1);

        store.set("key2", b"value2".to_vec()).await.unwrap();
        assert_eq!(store.len(), 2);
    }

    #[tokio::test]
    async fn test_memory_kv_clear() {
        let store = MemoryKvStore::new();

        store.set("key1", b"value1".to_vec()).await.unwrap();
        store.set("key2", b"value2".to_vec()).await.unwrap();
        assert_eq!(store.len(), 2);

        store.clear();
        assert!(store.is_empty());
        assert_eq!(store.len(), 0);
        assert_eq!(store.get("key1").await.unwrap(), None);
    }

    #[test]
    fn test_memory_kv_default() {
        let store: MemoryKvStore = MemoryKvStore::default();
        assert!(store.is_empty());
    }

    // ============================================================
    // Compression Tests (GH-5) - RED PHASE
    // ============================================================

    #[cfg(feature = "compression")]
    mod compression_tests {
        use super::*;
        use crate::kv::{CompressedKvStore, Compression};

        #[tokio::test]
        async fn test_compressed_kv_lz4_roundtrip() {
            let inner = MemoryKvStore::new();
            let store = CompressedKvStore::new(inner, Compression::Lz4);

            let data = b"hello world compressed with lz4".to_vec();
            store.set("key", data.clone()).await.unwrap();
            let retrieved = store.get("key").await.unwrap();

            assert_eq!(retrieved, Some(data));
        }

        #[tokio::test]
        async fn test_compressed_kv_zstd_roundtrip() {
            let inner = MemoryKvStore::new();
            let store = CompressedKvStore::new(inner, Compression::Zstd);

            let data = b"hello world compressed with zstd".to_vec();
            store.set("key", data.clone()).await.unwrap();
            let retrieved = store.get("key").await.unwrap();

            assert_eq!(retrieved, Some(data));
        }

        #[tokio::test]
        async fn test_compressed_kv_reduces_size() {
            let inner = MemoryKvStore::new();
            let store = CompressedKvStore::new(inner, Compression::Lz4);

            // Highly compressible data (repeated zeros)
            let data = vec![0u8; 10000];
            store.set("key", data.clone()).await.unwrap();

            // Get raw compressed size from inner store
            let compressed = store.inner().get("key").await.unwrap().unwrap();

            // LZ4 should compress zeros significantly
            assert!(
                compressed.len() < data.len() / 5,
                "Compressed {} -> {} bytes (expected >5x reduction)",
                data.len(),
                compressed.len()
            );
        }

        #[tokio::test]
        async fn test_compressed_kv_empty_value() {
            let inner = MemoryKvStore::new();
            let store = CompressedKvStore::new(inner, Compression::Lz4);

            store.set("empty", vec![]).await.unwrap();
            assert_eq!(store.get("empty").await.unwrap(), Some(vec![]));
        }

        #[tokio::test]
        async fn test_compressed_kv_delete() {
            let inner = MemoryKvStore::new();
            let store = CompressedKvStore::new(inner, Compression::Lz4);

            store.set("key", b"value".to_vec()).await.unwrap();
            store.delete("key").await.unwrap();
            assert_eq!(store.get("key").await.unwrap(), None);
        }

        #[tokio::test]
        async fn test_compressed_kv_exists() {
            let inner = MemoryKvStore::new();
            let store = CompressedKvStore::new(inner, Compression::Lz4);

            assert!(!store.exists("key").await.unwrap());
            store.set("key", b"value".to_vec()).await.unwrap();
            assert!(store.exists("key").await.unwrap());
        }

        #[tokio::test]
        async fn test_compressed_kv_batch_operations() {
            let inner = MemoryKvStore::new();
            let store = CompressedKvStore::new(inner, Compression::Lz4);

            store.batch_set(vec![("a", b"alpha".to_vec()), ("b", b"beta".to_vec())]).await.unwrap();

            let results = store.batch_get(&["a", "b", "c"]).await.unwrap();
            assert_eq!(results[0], Some(b"alpha".to_vec()));
            assert_eq!(results[1], Some(b"beta".to_vec()));
            assert_eq!(results[2], None);
        }

        #[tokio::test]
        async fn test_compression_enum_variants() {
            assert_eq!(Compression::Lz4.as_str(), "lz4");
            assert_eq!(Compression::Zstd.as_str(), "zstd");
        }

        #[tokio::test]
        async fn test_compressed_kv_large_value() {
            let inner = MemoryKvStore::new();
            let store = CompressedKvStore::new(inner, Compression::Zstd);

            // 1MB of random-ish data
            let data: Vec<u8> = (0..1024 * 1024).map(|i| (i % 256) as u8).collect();
            store.set("large", data.clone()).await.unwrap();

            let retrieved = store.get("large").await.unwrap();
            assert_eq!(retrieved, Some(data));
        }
    }
}