Struct rinecs::storage::Forest

pub struct Forest<T> { /* fields omitted */ }

Trait Implementations

impl<'a, T: 'a> HierarchicalStorage<'a, T> for Forest<T>

unsafe fn insert_child(&mut self, parent_guid: usize, guid: usize, value: T)

unsafe fn get_node(&self, guid: usize) -> NodeRef<'_, T>

unsafe fn get_node_mut(&mut self, guid: usize) -> NodeRefMut<'_, T>

unsafe fn fast_get_node(&self, idx: NodeId) -> NodeRef<'_, T>

unsafe fn fast_get_node_mut(&mut self, idx: NodeId) -> NodeRefMut<'_, T>

fn ordered_ids(&self) -> ReadGuardRef<'_, Vec<OrderedId<NodeId>>>

unsafe fn guid_for(&self, nodeid: NodeId) -> usize

unsafe fn ordered_fast_index(&self, guid: usize) -> NodeId

impl<'a, T: 'a> Storage<'a, T> for Forest<T>

type Get = &'a T

type GetMut = &'a mut T

type DerefTarget = T

type IdedIter = AllIdedData<'a, T>

type Iter = AllData<'a, T>

type IterMut = AllDataMut<'a, T>

fn new() -> Forest<T>

fn with_capacity(capacity: usize) -> Forest<T>

fn insert(&mut self, guid: usize, t: T)

fn remove(&mut self, guid: usize)

unsafe fn get(&self, guid: usize) -> &'a T

unsafe fn get_mut(&mut self, guid: usize) -> &'a mut T

unsafe fn fast_get(&self, guid: usize) -> &'a T

unsafe fn fast_get_mut(&mut self, guid: usize) -> &'a mut T

fn fast_index(&self, guid: usize) -> usize

fn guid_from_fast_index(&self, idx: usize) -> usize

fn contains(&self, guid: usize) -> bool

fn ided_iter(&self) -> Self::IdedIter

fn iter(&self) -> Self::Iter

fn iter_mut(&mut self) -> Self::IterMut

fn update(&mut self)

fn tracks_changes() -> bool

fn storage_changed(&self) -> bool

impl<T: Send> Send for Forest<T>

impl<T: Sync> Sync for Forest<T>