pub mod database; pub mod global; pub mod id; mod record; pub mod table; use std::collections::BTreeMap; use uuid::Uuid; #[derive(PartialEq, Eq, Hash, PartialOrd, Ord, Clone, Debug)] struct IDPath { path: Vec, } impl IDPath { fn new() -> Self { let mut path = Vec::new(); path.push(Uuid::nil()); Self { path: path } } fn next() -> Uuid { Uuid::new_v4() } fn extend(&self, addition: Uuid) -> Self { let mut result = self.clone(); result.path.pop(); result.path.push(addition); result.path.push(Uuid::nil()); result } } #[cfg(test)] mod ids { use super::*; #[test] fn create_idpath() { let expected = [Uuid::nil()]; let id = IDPath::new(); assert_eq!(id.path, expected); } #[test] fn next_is_random() { let mut ids: Vec = Vec::new(); for _ in 0..10 { let id = IDPath::next(); assert!(!ids.contains(&id), "{} is a duplicate", id); ids.push(id); } } #[test] fn extend_idpath() { let mut path: Vec = Vec::new(); path.push(Uuid::nil()); let mut id = IDPath::new(); for count in 1..5 { assert_eq!(id.path.len(), count); let extended = IDPath::next(); id = id.extend(extended.clone()); path.pop(); path.push(extended); path.push(Uuid::nil()); assert_eq!(id.path, path); } } } struct Cache { data: BTreeMap, } impl Cache { fn new() -> Self { Self { data: BTreeMap::new(), } } fn add_database(&mut self, name: S) where S: Into, { self.data.insert(name.into(), IDPath::new()); } fn get_databases(&self) -> Vec { self.data.keys().cloned().collect() } } #[cfg(test)] mod caches { use super::*; #[test] fn create_cache() { let cache = Cache::new(); let dbs = cache.get_databases(); assert!(dbs.is_empty()); } #[test] fn add_databases() { let mut cache = Cache::new(); cache.add_database("zed"); cache.add_database("alpha".to_string()); cache.add_database("beta"); cache.add_database("gamma".to_string()); assert_eq!(cache.get_databases(), ["alpha", "beta", "gamma", "zed"]); } }