lb_rs/model/
server_tree.rs

1use crate::model::file_like::FileLike;
2use crate::model::file_metadata::Owner;
3use crate::model::tree_like::{TreeLike, TreeLikeMut};
4use db_rs::{LookupSet, LookupTable};
5use std::collections::HashSet;
6use std::iter::FromIterator;
7use tracing::*;
8use uuid::Uuid;
9
10use super::errors::LbResult;
11use super::server_meta::ServerMeta;
12
13pub struct ServerTree<'a> {
14    pub ids: HashSet<Uuid>,
15    pub owned_files: &'a mut LookupSet<Owner, Uuid>,
16    pub shared_files: &'a mut LookupSet<Owner, Uuid>,
17    pub file_children: &'a mut LookupSet<Uuid, Uuid>,
18    pub files: &'a mut LookupTable<Uuid, ServerMeta>,
19}
20
21impl<'a> ServerTree<'a> {
22    pub fn new(
23        owner: Owner, owned_files: &'a mut LookupSet<Owner, Uuid>,
24        shared_files: &'a mut LookupSet<Owner, Uuid>, file_children: &'a mut LookupSet<Uuid, Uuid>,
25        files: &'a mut LookupTable<Uuid, ServerMeta>,
26    ) -> LbResult<Self> {
27        let (owned_ids, shared_ids) =
28            match (owned_files.get().get(&owner), shared_files.get().get(&owner)) {
29                (Some(owned_ids), Some(shared_ids)) => (owned_ids.clone(), shared_ids.clone()),
30                _ => {
31                    error!("Tree created for user without owned and shared files {:?}", owner);
32                    (HashSet::new(), HashSet::new())
33                }
34            };
35
36        let mut ids = HashSet::new();
37        ids.extend(owned_ids);
38        ids.extend(shared_ids.clone());
39
40        let mut to_get_descendants = Vec::from_iter(shared_ids);
41        while let Some(id) = to_get_descendants.pop() {
42            let children = file_children.get().get(&id).cloned().unwrap_or_default();
43            ids.extend(children.clone());
44            to_get_descendants.extend(children);
45        }
46
47        Ok(Self { ids, owned_files, shared_files, file_children, files })
48    }
49}
50
51impl TreeLike for ServerTree<'_> {
52    type F = ServerMeta;
53
54    fn ids(&self) -> Vec<Uuid> {
55        self.ids.iter().copied().collect()
56    }
57
58    fn maybe_find(&self, id: &Uuid) -> Option<&Self::F> {
59        if self.ids.contains(id) { self.files.maybe_find(id) } else { None }
60    }
61}
62
63impl TreeLikeMut for ServerTree<'_> {
64    fn insert(&mut self, f: Self::F) -> LbResult<Option<Self::F>> {
65        let id = *f.id();
66        let owner = f.owner();
67        let maybe_prior = LookupTable::insert(self.files, id, f.clone())?;
68
69        // maintain index: owned_files
70        if maybe_prior.as_ref().map(|f| f.owner()) != Some(f.owner()) {
71            if let Some(ref prior) = maybe_prior {
72                self.owned_files.remove(&prior.owner(), &id)?;
73            }
74            self.owned_files.insert(owner, id)?;
75        }
76
77        // maintain index: shared_files
78        let prior_sharees = if let Some(ref prior) = maybe_prior {
79            prior
80                .user_access_keys()
81                .iter()
82                .filter(|k| !k.deleted)
83                .map(|k| Owner(k.encrypted_for))
84                .collect()
85        } else {
86            HashSet::new()
87        };
88        let sharees = f
89            .user_access_keys()
90            .iter()
91            .filter(|k| !k.deleted)
92            .map(|k| Owner(k.encrypted_for))
93            .collect::<HashSet<_>>();
94        for removed_sharee in prior_sharees.difference(&sharees) {
95            self.shared_files.remove(removed_sharee, &id)?;
96        }
97        for new_sharee in sharees.difference(&prior_sharees) {
98            self.shared_files.insert(*new_sharee, id)?;
99        }
100
101        // maintain index: file_children
102        if self.file_children.get().get(&id).is_none() {
103            self.file_children.create_key(id)?;
104        }
105        if self.file_children.get().get(f.parent()).is_none() {
106            self.file_children.create_key(*f.parent())?;
107        }
108        if maybe_prior.as_ref().map(|f| *f.parent()) != Some(*f.parent()) {
109            if let Some(ref prior) = maybe_prior {
110                self.file_children.remove(prior.parent(), &id)?;
111            }
112
113            self.file_children.insert(*f.parent(), id)?;
114        }
115
116        Ok(maybe_prior)
117    }
118
119    fn remove(&mut self, _id: Uuid) -> LbResult<Option<Self::F>> {
120        error!("remove metadata called in server!");
121        Ok(None)
122    }
123
124    fn clear(&mut self) -> LbResult<()> {
125        error!("clear called in server!");
126        Ok(())
127    }
128}
lb_rs/model/server_tree.rs

lb_rs/model/
server_tree.rs
