Struct Node 

pub struct Node { /* private fields */ }

An AST node: an insertion-ordered string-keyed map.

Like Value, every traversal of it is iterative rather than derived.

Implementations

impl Node

pub fn new() -> Self

An empty node.

pub fn node_type(&self) -> Option<&str>

The node’s type discriminator, if it has one.

pub fn get(&self, key: &str) -> Option<&Value>

The value at key, if the key is present.

pub fn get_mut(&mut self, key: &str) -> Option<&mut Value>

A mutable reference to the value at key, if the key is present.

pub fn set(&mut self, key: impl Into<String>, value: impl Into<Value>)

Set key, keeping its existing position when it is already present (as assigning to a JavaScript object property does).

pub fn push_to(&mut self, key: &str, value: Value)

Append to the list at key, creating the list if it is absent.

pub fn iter(&self) -> impl Iterator<Item = (&str, &Value)>

The entries, in insertion order.

pub fn len(&self) -> usize

How many keys the node holds, Undefined ones included.

pub fn is_empty(&self) -> bool

Whether the node holds no keys at all.

pub fn to_json(&self) -> String

This node as JSON. Keys holding Value::Undefined are omitted.

Trait Implementations

impl Clone for Node

fn clone(&self) -> Node

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Node

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

Formats the value using the given formatter.

impl Default for Node

fn default() -> Self

Returns the “default value” for a type.

impl Drop for Node

Dismantle a node iteratively when it is dropped.

An AST is as deep as the CSS that produced it, and a derived drop would recurse once per level — so a stylesheet nested a few thousand rules deep would abort the process, on nothing worse than untrusted input, at the moment the tree went out of scope. The engine keeps its own rule stack for the same reason; this is the other half of that promise.

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 From<Node> for Value

fn from(n: Node) -> Self

Converts to this type from the input type.

impl PartialEq for Node

fn eq(&self, other: &Node) -> bool

Equality operator ==.

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

Inequality operator !=.