refactor: remove lattice-store crate and update roadmap tasks

This commit is contained in:
2025-12-22 21:12:29 +01:00
parent e942da49ff
commit 665114036b
7 changed files with 1 additions and 81 deletions
-2
View File
@@ -3,7 +3,6 @@ resolver = "2"
members = [
"lattice-core",
"lattice-net",
"lattice-store",
"lattice-cli",
]
@@ -16,7 +15,6 @@ license = "MIT"
# Workspace crates
lattice-core = { path = "lattice-core" }
lattice-net = { path = "lattice-net" }
lattice-store = { path = "lattice-store" }
lattice-cli = { path = "lattice-cli" }
# CLI
+1 -2
View File
@@ -139,8 +139,7 @@
**Post-M2 Refactoring:**
- [ ] Unify `node.rs` from `lattice-cli` and `lattice-core`
- [ ] Move `Store` code into `lattice-store` crate
- [ ] Move `StoreActor` code into `lattice-store` crate
- [ ] Use prost for node status in store
---
-15
View File
@@ -1,15 +0,0 @@
[package]
name = "lattice-store"
description = "Log-based KV store with snapshots and watermarks"
version.workspace = true
edition.workspace = true
license.workspace = true
[dependencies]
lattice-core = { workspace = true }
tokio = { workspace = true }
thiserror = { workspace = true }
tracing = { workspace = true }
[dev-dependencies]
tokio-test = { workspace = true }
-12
View File
@@ -1,12 +0,0 @@
//! Lattice Store
//!
//! Log-based Key-Value store:
//! - State is a "view" generated by replaying entries
//! - Watermarks for agreeing on safe compaction points
//! - Snapshots for replacing old logs
pub mod store;
pub mod snapshot;
pub mod watermark;
pub use store::Store;
-6
View File
@@ -1,6 +0,0 @@
//! Snapshots for log compaction
/// A verified snapshot that can replace old log entries.
pub struct Snapshot {
// TODO: snapshot data, watermark, verification
}
-35
View File
@@ -1,35 +0,0 @@
//! The main KV store
use std::collections::HashMap;
/// A log-based Key-Value store.
///
/// The store is a dynamic "view" generated by replaying entries.
pub struct Store {
data: HashMap<Vec<u8>, Vec<u8>>,
}
impl Store {
/// Create a new empty store.
pub fn new() -> Self {
Self {
data: HashMap::new(),
}
}
/// Get a value by key.
pub fn get(&self, key: &[u8]) -> Option<&[u8]> {
self.data.get(key).map(|v| v.as_slice())
}
/// Set a value (this would normally go through the log).
pub fn set(&mut self, key: Vec<u8>, value: Vec<u8>) {
self.data.insert(key, value);
}
}
impl Default for Store {
fn default() -> Self {
Self::new()
}
}
-9
View File
@@ -1,9 +0,0 @@
//! Watermarks for agreeing on safe compaction points
/// A watermark representing a safe cut-off point for log compaction.
///
/// Nodes use watermarks to agree on which entries can be safely
/// deleted and replaced with snapshots.
pub struct Watermark {
// TODO: watermark data
}