pub struct Arena<T> {
pub node_hierarchy: NodeHierarchy,
pub node_data: NodeDataContainer<T>,
}
Fields§
§node_hierarchy: NodeHierarchy
§node_data: NodeDataContainer<T>
Implementations§
Source§impl<T> Arena<T>
impl<T> Arena<T>
pub fn new() -> Arena<T>
pub fn with_capacity(cap: usize) -> Arena<T>
pub fn len(&self) -> usize
pub fn is_empty(&self) -> bool
Sourcepub fn linear_iter(&self) -> LinearIterator ⓘ
pub fn linear_iter(&self) -> LinearIterator ⓘ
Return an iterator over the indices in the internal arenas Vec
Sourcepub fn append_arena(&mut self, other: &mut Arena<T>)
pub fn append_arena(&mut self, other: &mut Arena<T>)
Appends another arena to the end of the current arena (by simply appending the two Vec of nodes) Can potentially mess up internal IDs, only use this if you know what you’re doing
Trait Implementations§
impl<T: Eq> Eq for Arena<T>
impl<T> StructuralPartialEq for Arena<T>
Auto Trait Implementations§
impl<T> Freeze for Arena<T>
impl<T> RefUnwindSafe for Arena<T>where
T: RefUnwindSafe,
impl<T> Send for Arena<T>where
T: Send,
impl<T> Sync for Arena<T>where
T: Sync,
impl<T> Unpin for Arena<T>where
T: Unpin,
impl<T> UnwindSafe for Arena<T>where
T: UnwindSafe,
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
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§unsafe fn clone_to_uninit(&self, dst: *mut T)
unsafe fn clone_to_uninit(&self, dst: *mut T)
🔬This is a nightly-only experimental API. (
clone_to_uninit
)