pub struct GraphNodePointer<'a> { /* private fields */ }Implementations§
Trait Implementations§
Source§impl<'a> NodeIter<'a> for GraphNodePointer<'a>
impl<'a> NodeIter<'a> for GraphNodePointer<'a>
fn next(&self) -> Option<Self>
fn child(&self) -> Option<Self>
fn node(&self) -> Option<Node>
fn to_markdown(self, parent: &str, options: &MarkdownOptions) -> String
fn to_markdown_skip_frontmatter( self, parent: &str, options: &MarkdownOptions, ) -> String
fn plain_text(&self) -> String
fn to_default_markdown(self) -> String
fn ref_type(&self) -> Option<ReferenceType>
fn lang(&self) -> Option<String>
fn table_header(&self) -> Option<Vec<GraphInlines>>
fn table_alignment(&self) -> Option<Vec<ColumnAlignment>>
fn table_rows(&self) -> Option<Vec<Vec<GraphInlines>>>
fn content(&self) -> Option<String>
fn ref_text(&self) -> Option<String>
fn ref_key2(&self) -> Option<Key>
fn inlines(&self) -> GraphInlines
fn is_list(&self) -> bool
fn is_document(&self) -> bool
fn is_section(&self) -> bool
fn is_ordered_list(&self) -> bool
fn is_bullet_list(&self) -> bool
fn is_reference(&self) -> bool
fn is_horizontal_rule(&self) -> bool
fn is_raw(&self) -> bool
fn is_leaf(&self) -> bool
fn is_quote(&self) -> bool
Source§impl<'a> NodePointer<'a> for GraphNodePointer<'a>
impl<'a> NodePointer<'a> for GraphNodePointer<'a>
fn id(&self) -> Option<NodeId>
fn next_id(&self) -> Option<NodeId>
fn child_id(&self) -> Option<NodeId>
fn prev_id(&self) -> Option<NodeId>
fn to_node(&self, id: NodeId) -> Self
fn to_key(&self, key: Key) -> Option<Self>
fn at(&self, id: NodeId) -> bool
fn node_key(&self) -> Key
fn is_header(&self) -> bool
fn collect_tree(self) -> Tree
fn squash_tree(self, depth: u8) -> Tree
fn to_prev(&self) -> Option<Self>
fn to_next(&self) -> Option<Self>
fn to_child(&self) -> Option<Self>
fn get_next_sections(&self) -> Vec<NodeId> ⓘ
fn ref_key(&self) -> Option<Key>
fn document_key(&self) -> Option<Key>
fn is_primary_section(&self) -> bool
fn to_parent(&self) -> Option<Self>
fn to_self(&self) -> Option<Self>
fn get_list(&self) -> Option<Self>
fn get_top_level_list(&self) -> Option<Self>
fn to_document(&self) -> Option<Self>
fn is_parent_of(&self, other: NodeId) -> bool
fn get_sub_nodes(&self) -> Vec<NodeId> ⓘ
fn get_all_sub_nodes(&self) -> Vec<NodeId> ⓘ
fn get_next_nodes(&self) -> Vec<NodeId> ⓘ
fn get_sub_sections(&self) -> Vec<NodeId> ⓘ
fn get_all_sub_headers(&self) -> Vec<NodeId> ⓘ
fn to_first_section_at_the_same_level(&self) -> Self
fn is_prev_of(&self, other: NodeId) -> bool
fn is_in_list(&self) -> bool
fn get_section(&self) -> Option<Self>
Auto Trait Implementations§
impl<'a> Freeze for GraphNodePointer<'a>
impl<'a> RefUnwindSafe for GraphNodePointer<'a>
impl<'a> Send for GraphNodePointer<'a>
impl<'a> Sync for GraphNodePointer<'a>
impl<'a> Unpin for GraphNodePointer<'a>
impl<'a> UnwindSafe for GraphNodePointer<'a>
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left is true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left(&self) returns true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read more