pub struct ServerTree<'a> {
pub ids: HashSet<Uuid>,
pub owned_files: &'a mut LookupSet<Owner, Uuid>,
pub shared_files: &'a mut LookupSet<Owner, Uuid>,
pub file_children: &'a mut LookupSet<Uuid, Uuid>,
pub files: &'a mut LookupTable<Uuid, ServerFile>,
}
Fields§
§ids: HashSet<Uuid>
§owned_files: &'a mut LookupSet<Owner, Uuid>
§file_children: &'a mut LookupSet<Uuid, Uuid>
§files: &'a mut LookupTable<Uuid, ServerFile>
Implementations§
Source§impl<'a> ServerTree<'a>
impl<'a> ServerTree<'a>
Trait Implementations§
Source§impl TreeLike for ServerTree<'_>
impl TreeLike for ServerTree<'_>
type F = ServerFile
fn ids(&self) -> HashSet<&Uuid>
fn maybe_find(&self, id: &Uuid) -> Option<&Self::F>
fn find(&self, id: &Uuid) -> SharedResult<&Self::F>
fn maybe_find_parent<F2: FileLike>(&self, file: &F2) -> Option<&Self::F>
fn find_parent<F2: FileLike>(&self, file: &F2) -> SharedResult<&Self::F>
fn owned_ids(&self) -> HashSet<Uuid>
fn all_files(&self) -> SharedResult<Vec<&Self::F>>
fn stage<Staged>(&self, staged: Staged) -> StagedTree<&Self, Staged>
fn to_staged<Staged>(self, staged: Staged) -> StagedTree<Self, Staged>
fn as_lazy(&self) -> LazyTree<&Self>
fn to_lazy(self) -> LazyTree<Self>
Source§impl TreeLikeMut for ServerTree<'_>
impl TreeLikeMut for ServerTree<'_>
Auto Trait Implementations§
impl<'a> Freeze for ServerTree<'a>
impl<'a> RefUnwindSafe for ServerTree<'a>
impl<'a> Send for ServerTree<'a>
impl<'a> Sync for ServerTree<'a>
impl<'a> Unpin for ServerTree<'a>
impl<'a> !UnwindSafe for ServerTree<'a>
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more