Enum Node 

pub enum Node {
    List {
        kind: ListKind,
        items: Vec<Item>,
    },
    Atom(String),
    Str(String),
    Prefixed {
        prefix: String,
        inner: Box<Node>,
    },
}

Variants

List

Fields

kind: ListKind

items: Vec<Item>

Atom(String)

Symbols, numbers, booleans (#t/#f), chars (#\x), keywords (#:k), #{...}# extended symbols, and .

Str(String)

Raw string literal INCLUDING surrounding quotes, escapes as written.

Prefixed

prefix is one of: ’ , ,@ #' # #, #,@ #~ #$ #$@ #+ (gexp syntax).

Fields

prefix: String

inner: Box<Node>

Implementations

impl Node

pub fn to_source(&self) -> String

Verbatim source text of this node.

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

For a list, the text of its first data child if that child is an Atom.

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

Symbol text, drilling through 'sym and (quote sym).

pub fn as_string_lit(&self) -> Option<String>

Unescaped contents of a string literal.

pub fn list_nodes(&self) -> impl Iterator<Item = &Node>

Data children of a list, trivia skipped. Empty for non-lists.

impl Node

pub fn data_len(&self) -> usize

Number of data children (trivia excluded).

pub fn data_child(&self, data_index: usize) -> Option<&Node>

pub fn data_child_mut(&mut self, data_index: usize) -> Option<&mut Node>

pub fn position_of<F: Fn(&Node) -> bool>(&self, pred: F) -> Option<usize>

Data index of the first child matching PRED.

pub fn insert_child(&mut self, data_index: usize, node: Node)

Insert NODE before the DATA_INDEX-th data child; trivia stays attached to its original neighbor. Out-of-range appends.

pub fn push_child(&mut self, node: Node)

Insert NODE after the last data child (before trailing trivia/close).

pub fn replace_child(&mut self, data_index: usize, node: Node) -> bool

pub fn remove_child( &mut self, data_index: usize, take_leading_trivia: bool, ) -> Option<Node>

Remove the DATA_INDEX-th data child. With TAKE_LEADING_TRIVIA, the comments and blanks between the previous data child and this one go with it; otherwise only directly adjacent whitespace is dropped.

impl Node

pub fn to_pretty(&self, indent: usize) -> String

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 Display for Node

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

Formats the value using the given formatter.

impl Eq for Node

impl PartialEq for Node

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

Tests for self and other values to be equal, and is used by ==.

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

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl StructuralPartialEq for Node