Struct Lazy Tree &nbsp; Copy item path

impl<T> LazyTree<T>
where T: TreeLike<F = SignedMeta>,

pub fn decrypt( &mut self, keychain: &Keychain, id: &Uuid, public_key_cache: &LookupTable<Owner, String>, ) -> LbResult<File>

convert FileMetadata into File. fields have been decrypted, public keys replaced with usernames, deleted files filtered out, etc.

pub fn decrypt_all( &mut self, keychain: &Keychain, ids: I, public_key_cache: &LookupTable<Owner, String>, skip_invisible: bool, ) -> LbResult<Vec<File>>
where I: Iterator<Item = Uuid>,

convert FileMetadata into File. fields have been decrypted, public keys replaced with usernames, deleted files filtered out, etc.

pub fn is_invisible_id(&mut self, id: Uuid) -> LbResult<bool>

pub fn create_op( &mut self, id: Uuid, key: AESKey, parent: &Uuid, name: &str, file_type: FileType, keychain: &Keychain, ) -> LbResult<(SignedMeta, Uuid)>

pub fn rename_op( &mut self, id: &Uuid, name: &str, keychain: &Keychain, ) -> LbResult<SignedMeta>

pub fn move_op( &mut self, id: &Uuid, new_parent: &Uuid, keychain: &Keychain, ) -> LbResult<Vec<SignedMeta>>

pub fn delete_op(&self, id: &Uuid, keychain: &Keychain) -> LbResult<SignedMeta>

pub fn add_share_op( &mut self, id: Uuid, sharee: Owner, mode: ShareMode, keychain: &Keychain, ) -> LbResult<SignedMeta>

pub fn delete_share_op( &mut self, id: &Uuid, maybe_encrypted_for: Option<PublicKey>, keychain: &Keychain, ) -> LbResult<Vec<SignedMeta>>

pub fn decrypt_document( &mut self, id: &Uuid, doc: &EncryptedDocument, keychain: &Keychain, ) -> LbResult<DecryptedDocument>

pub fn update_document_op( &mut self, id: &Uuid, document: &[u8], keychain: &Keychain, ) -> LbResult<(SignedMeta, EncryptedDocument)>

impl<Base, Local, Staged> LazyTree<Staged>
where Staged: StagedTreeLike<Base = Base, Staged = Local, F = SignedMeta> + TreeLikeMut, Base: TreeLike<F = Staged::F>, Local: TreeLikeMut<F = Staged::F>,

pub fn create_unvalidated( &mut self, id: Uuid, key: AESKey, parent: &Uuid, name: &str, file_type: FileType, keychain: &Keychain, ) -> LbResult<Uuid>

pub fn create( &mut self, id: Uuid, key: AESKey, parent: &Uuid, name: &str, file_type: FileType, keychain: &Keychain, ) -> LbResult<Uuid>

pub fn rename_unvalidated( &mut self, id: &Uuid, name: &str, keychain: &Keychain, ) -> LbResult<()>

pub fn rename( &mut self, id: &Uuid, name: &str, keychain: &Keychain, ) -> LbResult<()>

pub fn move_unvalidated( &mut self, id: &Uuid, new_parent: &Uuid, keychain: &Keychain, ) -> LbResult<()>

pub fn move_file( &mut self, id: &Uuid, new_parent: &Uuid, keychain: &Keychain, ) -> LbResult<()>

pub fn delete_unvalidated( &mut self, id: &Uuid, keychain: &Keychain, ) -> LbResult<()>

pub fn delete(&mut self, id: &Uuid, keychain: &Keychain) -> LbResult<()>

pub fn add_share_unvalidated( &mut self, id: Uuid, sharee: Owner, mode: ShareMode, keychain: &Keychain, ) -> LbResult<()>

pub fn add_share( &mut self, id: Uuid, sharee: Owner, mode: ShareMode, keychain: &Keychain, ) -> LbResult<()>

pub fn delete_share_unvalidated( &mut self, id: &Uuid, maybe_encrypted_for: Option<PublicKey>, keychain: &Keychain, ) -> LbResult<()>

pub fn delete_share( &mut self, id: &Uuid, maybe_encrypted_for: Option<PublicKey>, keychain: &Keychain, ) -> LbResult<()>

pub fn update_document_unvalidated( &mut self, id: &Uuid, document: &[u8], keychain: &Keychain, ) -> LbResult<EncryptedDocument>

pub fn update_document( &mut self, id: &Uuid, document: &[u8], keychain: &Keychain, ) -> LbResult<EncryptedDocument>

pub fn access_mode( &self, owner: Owner, id: &Uuid, ) -> LbResult<Option<UserAccessMode>>

pub fn in_pending_share(&mut self, id: &Uuid) -> LbResult<bool>

pub fn all_children(&mut self) -> LbResult<&HashMap<Uuid, HashSet<Uuid>>>

pub fn calculate_deleted(&mut self, id: &Uuid) -> LbResult<bool>

pub fn decrypt_key( &mut self, id: &Uuid, keychain: &Keychain, ) -> LbResult<AESKey>

pub fn name(&mut self, id: &Uuid, keychain: &Keychain) -> LbResult<String>

pub fn name_using_links( &mut self, id: &Uuid, keychain: &Keychain, ) -> LbResult<String>

pub fn parent_using_links(&mut self, id: &Uuid) -> LbResult<Uuid>

pub fn linked_by(&mut self, id: &Uuid) -> LbResult<Option<Uuid>>

pub fn children(&mut self, id: &Uuid) -> LbResult<HashSet<Uuid>>

Returns ids of files whose parent is the argument. Does not include the argument. TODO could consider returning a reference to the underlying cached value

pub fn children_using_links(&mut self, id: &Uuid) -> LbResult<HashSet<Uuid>>

pub fn descendants(&mut self, id: &Uuid) -> LbResult<HashSet<Uuid>>

Returns ids of files for which the argument is an ancestor—the files’ children, recursively. Does not include the argument. This function tolerates cycles.

pub fn descendants_using_links(&mut self, id: &Uuid) -> LbResult<HashSet<Uuid>>

pub fn ancestors(&self, id: &Uuid) -> LbResult<HashSet<Uuid>>

Returns ids of files for which the argument is a descendent—the files’ parent, recursively. Does not include the argument. This function tolerates cycles.

pub fn pending_roots(&mut self, keychain: &Keychain) -> LbResult<Vec<Uuid>>

pub fn non_deleted_pending_files( &mut self, keychain: &Keychain, ) -> LbResult<Vec<Uuid>>

pub fn stage<T2: TreeLikeMut<F = T::F>>( self, staged: T2, ) -> LazyTree<StagedTree<T, T2>>

pub fn stage_removals( self, removed: HashSet<Uuid>, ) -> LazyTree<StagedTree<T, Option<T::F>>>

pub fn assert_names_decryptable(&mut self, keychain: &Keychain) -> LbResult<()>

impl<T> LazyTree<T>
where T: TreeLikeMut,

pub fn stage_and_promote<S: TreeLikeMut<F = T::F>>( &mut self, staged: S, ) -> LbResult<()>

pub fn stage_validate_and_promote<S: TreeLikeMut<F = T::F>>( &mut self, staged: S, owner: Owner, ) -> LbResult<()>

pub fn stage_removals_and_promote( &mut self, removed: HashSet<Uuid>, ) -> LbResult<()>

impl<Base, Staged> LazyTree<StagedTree<Base, Staged>>
where Base: TreeLikeMut, Staged: TreeLikeMut<F = Base::F>,

pub fn promote(self) -> LbResult<LazyTree<Base>>

impl<Base, Staged> LazyTree<StagedTree<Base, Staged>>
where Base: TreeLike, Staged: TreeLikeMut<F = Base::F>,

pub fn unstage(self) -> (LazyTree<Base>, Staged)

impl<T> LazyTree<T>
where T: TreeLike<F = SignedMeta>,

pub fn path_to_id( &mut self, path: &str, root: &Uuid, keychain: &Keychain, ) -> LbResult<Uuid>

pub fn id_to_path(&mut self, id: &Uuid, keychain: &Keychain) -> LbResult<String>

pub fn list_paths( &mut self, filter: Option<Filter>, keychain: &Keychain, ) -> LbResult<Vec<(Uuid, String)>>

impl<Base, Local> LazyTree<StagedTree<Base, Local>>
where Base: TreeLike<F = SignedMeta>, Local: TreeLikeMut<F = Base::F>,

pub fn create_link_at_path( &mut self, path: &str, target_id: Uuid, root: &Uuid, keychain: &Keychain, ) -> LbResult<Uuid>

pub fn create_at_path( &mut self, path: &str, root: &Uuid, keychain: &Keychain, ) -> LbResult<Uuid>

impl<'a> LazyTree<ServerTree<'a>>

pub fn stage_diff( self, changes: Vec<FileDiff<SignedFile>>, ) -> LbResult<LazyStaged1<ServerTree<'a>, Vec<ServerMeta>>>

Validates a diff prior to staging it. Performs individual validations, then validations that require a tree

pub fn stage_diff_v2( self, changes: Vec<FileDiff<SignedMeta>>, ) -> LbResult<LazyStaged1<ServerTree<'a>, Vec<ServerMeta>>>

impl<T, Base, Local> LazyTree<T>
where T: StagedTreeLike<Base = Base, Staged = Local>, Base: TreeLike<F = T::F>, Local: TreeLike<F = T::F>,

pub fn validate(&mut self, owner: Owner) -> LbResult<()>

pub fn assert_all_files_decryptable(&mut self, owner: Owner) -> LbResult<()>

pub fn assert_all_filenames_size_limit(&self) -> LbResult<()>

pub fn assert_only_folders_have_children(&self) -> LbResult<()>

pub fn assert_all_files_same_owner_as_parent(&mut self) -> LbResult<()>

pub fn assert_no_cycles(&mut self) -> LbResult<()>

pub fn assert_no_path_conflicts(&mut self) -> LbResult<()>

pub fn assert_no_shared_links(&self) -> LbResult<()>

pub fn assert_no_duplicate_links(&mut self) -> LbResult<()>

pub fn assert_no_broken_links(&mut self) -> LbResult<()>

pub fn assert_no_owned_links(&self) -> LbResult<()>

pub fn assert_no_root_changes(&mut self) -> LbResult<()>

pub fn assert_no_changes_to_deleted_files(&mut self) -> LbResult<()>

pub fn assert_changes_authorized(&mut self, owner: Owner) -> LbResult<()>

Trait Implementations§

impl<T: Clone + TreeLike> Clone for LazyTree<T>

fn clone(&self) -> LazyTree<T>

Returns a duplicate of the value. Read more

1.0.0§

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source. Read more

impl<T: Debug + TreeLike> Debug for LazyTree<T>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more

impl<T: TreeLike> TreeLike for LazyTree<T>

type F = <T as TreeLike>::F

fn ids(&self) -> Vec<Uuid>

fn maybe_find(&self, id: &Uuid) -> Option<&Self::F>

fn find(&self, id: &Uuid) -> LbResult<&Self::F>

fn maybe_find_parent<F2: FileLike>(&self, file: &F2) -> Option<&Self::F>

fn find_parent<F2: FileLike>(&self, file: &F2) -> LbResult<&Self::F>

fn all_files(&self) -> LbResult<Vec<&Self::F>>

fn stage<Staged>(&self, staged: Staged) -> StagedTree<&Self, Staged>
where Staged: TreeLike<F = Self::F>, Self: Sized,

fn to_staged<Staged>(self, staged: Staged) -> StagedTree<Self, Staged>
where Staged: TreeLike<F = Self::F>, Self: Sized,

fn as_lazy(&self) -> LazyTree<&Self>

fn to_lazy(self) -> LazyTree<Self>

Auto Trait Implementations§

impl<T> Freeze for LazyTree<T>
where T: Freeze,

impl<T> RefUnwindSafe for LazyTree<T>
where T: RefUnwindSafe,

impl<T> Send for LazyTree<T>
where T: Send,

impl<T> Sync for LazyTree<T>
where T: Sync,

impl<T> Unpin for LazyTree<T>
where T: Unpin,

impl<T> UnwindSafe for LazyTree<T>
where T: UnwindSafe,

Blanket Implementations§

impl<T> Any for T
where T: 'static + ?Sized,

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more

impl<T> Borrow<T> for T
where T: ?Sized,

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more

impl<T> BorrowMut<T> for T
where T: ?Sized,

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more

impl<T> CloneToUninit for T
where T: Clone,

unsafe fn clone_to_uninit(&self, dest: *mut u8)

🔬This is a nightly-only experimental API. (clone_to_uninit)

Performs copy-assignment from self to dest. Read more

impl<T> Downcast for T
where T: Any,

fn into_any(self: Box<T>) -> Box<dyn Any>

Converts Box<dyn Trait> (where Trait: Downcast) to Box<dyn Any>, which can then be downcast into Box<dyn ConcreteType> where ConcreteType implements Trait.

fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>

Converts Rc<Trait> (where Trait: Downcast) to Rc<Any>, which can then be further downcast into Rc<ConcreteType> where ConcreteType implements Trait.

fn as_any(&self) -> &(dyn Any + 'static)

Converts &Trait (where Trait: Downcast) to &Any. This is needed since Rust cannot generate &Any’s vtable from &Trait’s.

fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)

Converts &mut Trait (where Trait: Downcast) to &Any. This is needed since Rust cannot generate &mut Any’s vtable from &mut Trait’s.

impl<T> DowncastSend for T
where T: Any + Send,

fn into_any_send(self: Box<T>) -> Box<dyn Any + Send>

Converts Box<Trait> (where Trait: DowncastSend) to Box<dyn Any + Send>, which can then be downcast into Box<ConcreteType> where ConcreteType implements Trait.

impl<T> DowncastSync for T
where T: Any + Send + Sync,

fn into_any_sync(self: Box<T>) -> Box<dyn Any + Sync + Send>

Converts Box<Trait> (where Trait: DowncastSync) to Box<dyn Any + Send + Sync>, which can then be downcast into Box<ConcreteType> where ConcreteType implements Trait.

fn into_any_arc(self: Arc<T>) -> Arc<dyn Any + Sync + Send>

Converts Arc<Trait> (where Trait: DowncastSync) to Arc<Any>, which can then be downcast into Arc<ConcreteType> where ConcreteType implements Trait.

impl<T> From<T> for T

fn from(t: T) -> T

Returns the argument unchanged.

impl<T> Instrument for T

fn instrument(self, span: Span) -> Instrumented<Self>

Instruments this type with the provided Span, returning an Instrumented wrapper. Read more

fn in_current_span(self) -> Instrumented<Self>

Instruments this type with the current Span, returning an Instrumented wrapper. Read more

impl<T, U> Into for T
where U: From<T>,

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

impl<T> IntoEither for T

fn into_either(self, into_left: bool) -> Either<Self, Self>

Converts self into a Left variant of Either<Self, Self> if into_left is true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more

fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
where F: FnOnce(&Self) -> bool,

Converts self into a Left variant of Either<Self, Self> if into_left(&self) returns true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more

impl<T> Pointable for T

const ALIGN: usize

The alignment of pointer.

type Init = T

The type for initializers.

unsafe fn init(init: <T as Pointable>::Init) -> usize

Initializes a with the given initializer. Read more

unsafe fn deref<'a>(ptr: usize) -> &'a T

Dereferences the given pointer. Read more

unsafe fn deref_mut<'a>(ptr: usize) -> &'a mut T

Mutably dereferences the given pointer. Read more

unsafe fn drop(ptr: usize)

Drops the object pointed to by the given pointer. Read more

impl<T> Same for T

type Output = T

Should always be Self

impl<T> ToOwned for T
where T: Clone,

type Owned = T

The resulting type after obtaining ownership.

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more

impl<T, U> TryFrom for T
where U: Into<T>,

type Error = Infallible

The type returned in the event of a conversion error.

fn try_from(value: U) -> Result<T, <T as TryFrom>::Error>

Performs the conversion.

impl<T, U> TryInto for T
where U: TryFrom<T>,

type Error = >::Error

The type returned in the event of a conversion error.

fn try_into(self) -> Result<U, >::Error>

Performs the conversion.

impl<V, T> VZip<V> for T
where V: MultiLane<T>,

fn vzip(self) -> V

impl<T> WithSubscriber for T

fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self>
where S: Into<Dispatch>,

Attaches the provided Subscriber to this type, returning a WithDispatch wrapper. Read more

fn with_current_subscriber(self) -> WithDispatch<Self>

Attaches the current default Subscriber to this type, returning a WithDispatch wrapper. Read more