feat: Introduce the CfTree and CfIter types

meilidb-data/Cargo.toml

@@ -14,11 +14,11 @@ meilidb-core = { path = "../meilidb-core", version = "0.1.0" }
 meilidb-schema = { path = "../meilidb-schema", version = "0.1.0" }
 meilidb-tokenizer = { path = "../meilidb-tokenizer", version = "0.1.0" }
 ordered-float = { version = "1.0.2", features = ["serde"] }
+rocksdb = "0.12.3"
 sdset = "0.3.2"
 serde = { version = "1.0.99", features = ["derive"] }
 serde_json = "1.0.40"
 siphasher = "0.3.0"
-sled = "0.26.0"
 zerocopy = "0.2.8"
 
 [dependencies.rmp-serde]

meilidb-data/src/cf_tree.rs

@@ -0,0 +1,72 @@
+use std::sync::Arc;
+use rocksdb::{DBVector, IteratorMode, Direction};
+use crate::RocksDbResult;
+
+#[derive(Clone)]
+pub struct CfTree(Arc<CfTreeInner>);
+
+struct CfTreeInner {
+    db: rocksdb::DB,
+    name: String,
+}
+
+impl CfTree {
+    pub fn insert<K, V>(&self, key: K, value: V) -> RocksDbResult<()>
+    where K: AsRef<[u8]>,
+          V: AsRef<[u8]>,
+    {
+        let cf = self.0.db.cf_handle(&self.0.name).unwrap();
+        self.0.db.put_cf(cf, key, value)
+    }
+
+    pub fn get<K>(&self, key: K) -> RocksDbResult<Option<DBVector>>
+    where K: AsRef<[u8]>,
+    {
+        let cf = self.0.db.cf_handle(&self.0.name).unwrap();
+        self.0.db.get_cf(cf, key)
+    }
+
+    pub fn remove<K>(&self, key: K) -> RocksDbResult<()>
+    where K: AsRef<[u8]>
+    {
+        let cf = self.0.db.cf_handle(&self.0.name).unwrap();
+        self.0.db.delete_cf(cf, key)
+    }
+
+    /// Start and end key range is inclusive on both bounds.
+    pub fn range<KS, KE>(&self, start: KS, end: KE) -> RocksDbResult<CfIter>
+    where KS: AsRef<[u8]>,
+          KE: AsRef<[u8]>,
+    {
+        let cf = self.0.db.cf_handle(&self.0.name).unwrap();
+
+        let mut iter = self.0.db.iterator_cf(cf, IteratorMode::Start)?;
+        iter.set_mode(IteratorMode::From(start.as_ref(), Direction::Forward));
+
+        let end_bound = Box::from(end.as_ref());
+        Ok(CfIter { iter, end_bound: Some(end_bound) })
+    }
+
+    pub fn iter(&self) -> RocksDbResult<CfIter> {
+        let cf = self.0.db.cf_handle(&self.0.name).unwrap();
+        let iter = self.0.db.iterator_cf(cf, IteratorMode::Start)?;
+        Ok(CfIter { iter, end_bound: None })
+    }
+}
+
+pub struct CfIter<'a> {
+    iter: rocksdb::DBIterator<'a>,
+    end_bound: Option<Box<[u8]>>,
+}
+
+impl Iterator for CfIter<'_> {
+    type Item = (Box<[u8]>, Box<[u8]>);
+
+    fn next(&mut self) -> Option<Self::Item> {
+        match (self.iter.next(), self.end_bound) {
+            (Some((key, _)), Some(end_bound)) if key > end_bound => None,
+            (Some(entry), _) => Some(entry),
+            (None, _) => None,
+        }
+    }
+}

meilidb-data/src/lib.rs

@@ -1,3 +1,4 @@
+mod cf_tree;
 mod database;
 mod document_attr_key;
 mod indexer;
@@ -5,8 +6,10 @@ mod number;
 mod ranked_map;
 mod serde;
 
-pub use sled;
+pub use self::cf_tree::{CfTree, CfIter};
 pub use self::database::{Database, Index, CustomSettingsIndex};
 pub use self::number::Number;
 pub use self::ranked_map::RankedMap;
 pub use self::serde::{compute_document_id, extract_document_id, value_to_string};
+
+pub type RocksDbResult<T> = Result<T, rocksdb::Error>;