Newer
Older
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
use std::{
collections::HashMap,
path::{Path, PathBuf},
rc::Rc,
};
use crate::Tileset;
pub type ResourcePath = Path;
pub type ResourcePathBuf = PathBuf;
pub trait ResourceCache {
fn get_tileset(&self, path: impl AsRef<ResourcePath>) -> Option<Rc<Tileset>>;
fn get_or_try_insert_tileset_with<F, E>(
&mut self,
path: ResourcePathBuf,
f: F,
) -> Result<Rc<Tileset>, E>
where
F: FnOnce() -> Result<Tileset, E>;
}
/// A cache that identifies resources by their path in the user's filesystem.
pub struct FilesystemResourceCache {
tilesets: HashMap<ResourcePathBuf, Rc<Tileset>>,
}
impl FilesystemResourceCache {
pub fn new() -> Self {
Self {
tilesets: HashMap::new(),
}
}
}
impl ResourceCache for FilesystemResourceCache {
fn get_tileset(&self, path: impl AsRef<ResourcePath>) -> Option<Rc<Tileset>> {
self.tilesets.get(path.as_ref()).map(Clone::clone)
}
fn get_or_try_insert_tileset_with<F, E>(
&mut self,
path: ResourcePathBuf,
f: F,
) -> Result<Rc<Tileset>, E>
where
F: FnOnce() -> Result<Tileset, E>,
{
Ok(match self.tilesets.entry(path) {
std::collections::hash_map::Entry::Occupied(o) => o.into_mut(),
std::collections::hash_map::Entry::Vacant(v) => v.insert(Rc::new(f()?)),
}
.clone())
}
}