Struct mega::Nodes

pub struct Nodes { /* private fields */ }

Represents a collection of nodes from MEGA.

Implementations

impl Nodes

pub fn len(&self) -> usize

Returns the number of nodes in this collection.

pub fn roots(&self) -> impl Iterator<Item = &Node>

Creates an iterator over all the root nodes.

pub fn get_node_by_handle(&self, handle: &str) -> Option<&Node>

Gets a node, identified by its handle.

pub fn get_node_by_path(&self, path: &str) -> Option<&Node>

Gets a node, identified by its path.

pub fn cloud_drive(&self) -> Option<&Node>

Gets the root node for the Cloud Drive.

pub fn inbox(&self) -> Option<&Node>

Gets the root node for the Inbox.

pub fn rubbish_bin(&self) -> Option<&Node>

Gets the root node for the Rubbish Bin.

pub fn iter(&self) -> impl Iterator<Item = &Node>

Creates a borrowing iterator over the nodes.

pub fn apply_events(&mut self, events: EventBatch) -> Result<()>

Trait Implementations

impl IntoIterator for Nodes

type Item = Node

The type of the elements being iterated over.

type IntoIter = IntoValues<String, Node>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.