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
mod adapter;
pub mod adapters;
pub use self::adapter::Adapter;
use std::{
collections::HashMap,
io,
sync::{Arc, RwLock},
};
use super::record::Sequence;
#[derive(Debug)]
struct AdapterCache<A> {
adapter: A,
cache: HashMap<String, Sequence>,
}
#[derive(Debug)]
pub struct Repository<A>(Arc<RwLock<AdapterCache<A>>>);
impl<A> Repository<A>
where
A: Adapter,
{
pub fn new(adapter: A) -> Self {
Self(Arc::new(RwLock::new(AdapterCache {
adapter,
cache: HashMap::new(),
})))
}
pub fn get(&self, name: &str) -> Option<io::Result<Sequence>> {
{
let lock = self.0.read().unwrap();
if let Some(sequence) = lock.cache.get(name) {
return Some(Ok(sequence.clone()));
}
}
let mut lock = self.0.write().unwrap();
let record = match lock.adapter.get(name)? {
Ok(record) => record,
Err(e) => return Some(Err(e)),
};
lock.cache
.entry(name.into())
.or_insert_with(|| record.sequence().clone());
Some(Ok(record.sequence().clone()))
}
pub fn len(&self) -> usize {
self.0.read().unwrap().cache.len()
}
pub fn is_empty(&self) -> bool {
self.0.read().unwrap().cache.is_empty()
}
pub fn clear(&self) {
self.0.write().unwrap().cache.clear();
}
}
impl<A> Clone for Repository<A>
where
A: Adapter,
{
fn clone(&self) -> Self {
Self(self.0.clone())
}
}
#[cfg(test)]
mod tests {
use super::*;
use crate::{
record::{Definition, Sequence},
Record,
};
#[test]
fn test_get() -> io::Result<()> {
let sq0 = Record::new(
Definition::new("sq0", None),
Sequence::from(b"ACGT".to_vec()),
);
let repository = Repository::new(vec![sq0.clone()]);
assert_eq!(
repository.get("sq0").transpose()?,
Some(sq0.sequence().clone())
);
assert_eq!(repository.get("sq1").transpose()?, None);
Ok(())
}
}