redis_rocksdb 0.3.9

rust implement structure kv(key/value) embedded database, storage by rocksdb
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

use crate::rocksdb_impl::shared::make_field_key;
use crate::{BPTree, LenType, RrError, WrapDb};

/// see
/// [Writing a storage engine in Rust: Writing a persistent BTree (Part 1)] (https://nimrodshn.medium.com/writing-a-storage-engine-in-rust-writing-a-persistent-btree-part-1-916b6f3e2934)
/// [A persistent copy-on-write B+Tree implementation, designed as an index for a key-value store, inspired by SQLite](https://github.com/nimrodshn/btree)
pub struct BPTreeImpl {}

impl<T: WrapDb> BPTree<T> for BPTreeImpl {
	fn set_exist(&self, t: &T, key: &[u8], field: &[u8], _value: &[u8]) -> Result<(), RrError> {
		let field_key = make_field_key(key, field);
		if t.exist(&field_key)? {
			// let head_key = make_head_key(key);
			// let mut heap = {
			//     match t.get(&head_key)? {
			//         None => FieldHeap::new(vec![]),
			//         Some(v) => FieldHeap::new(v)
			//     }
			// };
			// let p = &mut heap as *mut _;
			// heap.init(MaxHeapCompare { heap: p });
			// heap.push(field);
			// t.put(&head_key, &heap.data)?;
		}
		// t.put(&field_key, value)?;
		Ok(())
	}

	fn set_not_exist(&self, _t: &T, _key: &[u8], _field: &[u8], _value: &[u8]) -> Result<(), RrError> {
		todo!()
	}

	fn set(&self, _t: &T, _key: &[u8], _field: &[u8], _value: &[u8]) -> Result<(), RrError> {
		todo!()
	}

	fn del_first(&self, _t: &T, _key: &[u8]) -> Result<Option<(Vec<u8>, Vec<u8>)>, RrError> {
		todo!()
	}

	fn del_last(&self, _t: &T, _key: &[u8]) -> Result<Option<(Vec<u8>, Vec<u8>)>, RrError> {
		todo!()
	}

	fn del(&self, _t: &T, _key: &[u8], _field: &[u8]) -> Result<Option<Vec<u8>>, RrError> {
		todo!()
	}

	fn get_first(&self, _t: &T, _key: &[u8]) -> Result<Option<(Vec<u8>, Vec<u8>)>, RrError> {
		todo!()
	}

	fn get_last(&self, _t: &T, _key: &[u8]) -> Result<Option<(Vec<u8>, Vec<u8>)>, RrError> {
		todo!()
	}

	fn get(&self, _t: &T, _key: &[u8], _field: &[u8]) -> Result<Option<Vec<u8>>, RrError> {
		todo!()
	}

	fn len(&self, _t: &T, _key: &[u8]) -> Result<Option<LenType>, RrError> {
		todo!()
	}

	fn del_key(&self, _t: &T, _key: &[u8]) -> Result<(), RrError> {
		todo!()
	}
}