Enum GraphNode 

pub enum GraphNode {
    Empty,
    Document(Document),
    Section(Section),
    Quote(Quote),
    BulletList(BulletList),
    OrderedList(OrderedList),
    Leaf(Leaf),
    Raw(RawLeaf),
    HorizontalRule(HorizontalRule),
    Reference(Reference),
    Table(Table),
}

Variants

Empty

Document(Document)

Section(Section)

Quote(Quote)

BulletList(BulletList)

OrderedList(OrderedList)

Leaf(Leaf)

Raw(RawLeaf)

HorizontalRule(HorizontalRule)

Reference(Reference)

Table(Table)

Implementations

impl GraphNode

pub fn prev_id(&self) -> MaybeNodeId

pub fn id(&self) -> NodeId

pub fn is_ref(&self) -> bool

pub fn is_empty(&self) -> bool

pub fn is_leaf(&self) -> bool

pub fn is_table(&self) -> bool

pub fn is_ordered_list(&self) -> bool

pub fn is_bullet_list(&self) -> bool

pub fn is_document(&self) -> bool

pub fn is_raw_leaf(&self) -> bool

pub fn is_list(&self) -> bool

pub fn is_quote(&self) -> bool

pub fn is_rule(&self) -> bool

pub fn is_section(&self) -> bool

pub fn is_reference(&self) -> bool

pub fn is_horizontal_rule(&self) -> bool

pub fn is_raw(&self) -> bool

pub fn is_root(&self) -> bool

pub fn is_reference_to(&self, key: &Key) -> bool

pub fn line_id(&self) -> MaybeLineId

pub fn next_id(&self) -> MaybeNodeId

pub fn to_symbol(&self) -> String

pub fn child_id(&self) -> MaybeNodeId

pub fn is_parent_of(&self, other: NodeId) -> bool

pub fn is_prev_of(&self, other: NodeId) -> bool

pub fn set_next_id(&mut self, next: NodeId)

pub fn set_child_id(&mut self, child: NodeId)

pub fn insertable(&self) -> bool

pub fn new_leaf(prev: NodeId, id: NodeId, line: LineId) -> GraphNode

pub fn new_raw_leaf( prev: NodeId, id: NodeId, content: String, lang: Option<String>, ) -> GraphNode

pub fn new_table( prev: NodeId, id: NodeId, header: Vec<LineId>, alignment: Vec<ColumnAlignment>, rows: Vec<Vec<LineId>>, ) -> GraphNode

pub fn new_ref( prev: NodeId, id: NodeId, key: Key, text: String, reference_type: ReferenceType, ) -> GraphNode

pub fn new_bullet_list(prev: NodeId, id: NodeId) -> GraphNode

pub fn new_ordered_list(prev: NodeId, id: NodeId) -> GraphNode

pub fn new_quote(prev: NodeId, id: NodeId) -> GraphNode

pub fn new_rule(prev: NodeId, id: NodeId) -> GraphNode

pub fn new_section(prev: NodeId, id: NodeId, line: LineId) -> GraphNode

pub fn new_root(key: Key, id: NodeId, metadata: Option<String>) -> GraphNode

pub fn is_ordered(&self) -> bool

pub fn key(&self) -> Option<Key>

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

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

pub fn table_header(&self) -> Option<Vec<LineId>>

pub fn table_rows(&self) -> Option<Vec<Vec<LineId>>>

pub fn table_alignment(&self) -> Option<Vec<ColumnAlignment>>

pub fn ref_key(&self) -> Option<Key>

pub fn ref_type(&self) -> Option<ReferenceType>

pub fn ref_text(&self) -> String

Trait Implementations

impl Clone for GraphNode

fn clone(&self) -> GraphNode

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for GraphNode

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

Formats the value using the given formatter.

impl PartialEq for GraphNode

fn eq(&self, other: &GraphNode) -> 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 GraphNode