Struct NodeList 

pub struct NodeList<'gc> { /* private fields */ }

An ordered list of nodes used as a property in the AST.

Implemented as a linked list internally to avoid extra overhead that would exist if it were to allocate a Vec or some other structure that required allocating on the native heap.

Because this is just a Copy head pointer into context-allocated NodeListElements (juno model), it implements Copy much like any other pointer/reference, allowing the user to handle it much like &Node in many cases. Empty == null head.

Implementations

impl<'gc> NodeList<'gc>

pub fn empty() -> Self

Create a new empty list. Guaranteed to be fast, performs no allocations.

pub fn from_iter<'a, I: IntoIterator<Item = &'a Node<'a>>>( lock: &'a GCLock<'_, '_>, nodes: I, ) -> NodeList<'a>

Connect the provided pre-existing nodes into a NodeList via iteration. NodeList doesn’t implement FromIterator directly due to the GCLock requirement.

pub fn is_empty(&self) -> bool

Whether this NodeList has no elements. Cost: O(1)

pub fn iter(self) -> NodeListIter<'gc>

Iterate the list front to back. Cost: O(1) to start, O(1) per step.

Trait Implementations

impl<'gc> Clone for NodeList<'gc>

fn clone(&self) -> NodeList<'gc>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<'gc> Copy for NodeList<'gc>

impl<'gc> Debug for NodeList<'gc>

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

Formats the value using the given formatter.

impl<'gc> IntoIterator for NodeList<'gc>

type Item = &'gc Node<'gc>

The type of the elements being iterated over.

type IntoIter = NodeListIter<'gc>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.