Struct Box 

pub struct Box<'a, T, A = &'a Arena>
where
    A: Allocator,
{ /* private fields */ }

An arena-allocated box that retains a reference to its allocator, enabling Clone support.

This type is intended for recursive AST nodes (e.g. color-mix() containing nested <color> values) where indirection is required to break the cycle, but the allocation should still live in the parsing arena.

Implementations

impl<'a, T, A> Box<'a, T, A>

where A: Allocator,

pub fn new_in(alloc: A, value: T) -> Box<'a, T, A>

Allocate value in the given alloc.

impl<'a, T> Box<'a, T>

pub fn leak(self) -> &'a mut T

Gives up ownership of the value. The value stays in the arena, thus its Drop does not run.

Trait Implementations

impl<'a, T, A> Clone for Box<'a, T, A>

where T: Clone, A: Allocator + Clone,

fn clone(&self) -> Box<'a, T, A>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<'a, T, A> Debug for Box<'a, T, A>

where T: Debug, A: Allocator,

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

Formats the value using the given formatter.

impl<'a, T, A> Deref for Box<'a, T, A>

where A: Allocator,

type Target = T

The resulting type after dereferencing.

fn deref(&self) -> &T

Dereferences the value.

impl<'a, T, A> DerefMut for Box<'a, T, A>

where A: Allocator,

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

Mutably dereferences the value.

impl<'a, T, A> Display for Box<'a, T, A>

where T: Display, A: Allocator,

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

Formats the value using the given formatter.

impl<'a, T, A> Drop for Box<'a, T, A>

where A: Allocator,

fn drop(&mut self)

Executes the destructor for this type.

fn pin_drop(self: Pin<&mut Self>)

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

Execute the destructor for this type, but different to Drop::drop, it requires self to be pinned.

impl<'a, T, A> Eq for Box<'a, T, A>

where T: Eq, A: Allocator,

impl<'a, T, A> Hash for Box<'a, T, A>

where T: Hash, A: Allocator,

fn hash<H>(&self, state: &mut H)

where H: Hasher,

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl<'a, M: NodeMetadata, T: NodeWithMetadata<M>, A: Allocator> NodeWithMetadata<M> for Box<'a, T, A>

fn self_metadata(&self) -> M

Returns the metadata contributed by this node itself, not including children. Most nodes don’t contribute metadata, so can simply return M::default(). Nodes like StyleRule or AtRules should return their own node kind flags here.

fn metadata(&self) -> M

Returns the complete aggregated metadata for this node (self + children). Default implementation merges children’s metadata with self_metadata().

impl<'a, T, A> Ord for Box<'a, T, A>

where T: Ord, A: Allocator,

fn cmp(&self, other: &Box<'a, T, A>) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized,

Restrict a value to a certain interval.

fn clamp_to<R>(self, range: R) -> Self

where Self: Sized, R: ClampBounds<Self>,

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

Restrict a value to a certain range.

impl<'a, T: Parse<'a>> Parse<'a> for Box<'a, T>

fn parse<I>(p: &mut Parser<'a, I>) -> Result<Self>

where I: Iterator<Item = Cursor> + Clone,

fn try_parse<I>(p: &mut Parser<'a, I>) -> Result<Self>

where I: Iterator<Item = Cursor> + Clone,

impl<'a, T, A> PartialEq for Box<'a, T, A>

where T: PartialEq, A: Allocator,

fn eq(&self, other: &Box<'a, T, A>) -> bool

Equality operator ==.

fn ne(&self, other: &Rhs) -> bool

Inequality operator !=.

impl<'a, T, A> PartialOrd for Box<'a, T, A>

where T: PartialOrd, A: Allocator,

fn partial_cmp(&self, other: &Box<'a, T, A>) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

fn lt(&self, other: &Rhs) -> bool

Tests less than (for self and other) and is used by the < operator.

fn le(&self, other: &Rhs) -> bool

Tests less than or equal to (for self and other) and is used by the <= operator.

fn gt(&self, other: &Rhs) -> bool

Tests greater than (for self and other) and is used by the > operator.

fn ge(&self, other: &Rhs) -> bool

Tests greater than or equal to (for self and other) and is used by the >= operator.

impl<'a, T: Peek<'a>, A: Allocator> Peek<'a> for Box<'a, T, A>

const PEEK_KINDSET: KindSet = T::PEEK_KINDSET

fn peek<I>(p: &Parser<'a, I>, c: Cursor) -> bool

where I: Iterator<Item = Cursor> + Clone,

impl<'a, T: SemanticEq, A: Allocator> SemanticEq for Box<'a, T, A>

fn semantic_eq(&self, other: &Self) -> bool

Returns true if self and other are semantically equal.

impl<'a, T: ToCursors, A: Allocator> ToCursors for Box<'a, T, A>

fn to_cursors(&self, s: &mut impl CursorSink)

impl<'a, T, A> ToSpan for Box<'a, T, A>

where T: ToSpan, A: Allocator,

fn to_span(&self) -> Span

Returns source span.