pub struct Parser<'a, const MAX_NODES: usize = 0, const MAX_STACK: usize = 0, const MAX_ROOTS: usize = 0, const MAX_IDS: usize = 0, const MAX_CLASSES: usize = 0, const MAX_SELECTOR_NODES: usize = 0> { /* private fields */ }Expand description
The main HTML parser
Users of this library are not supposed to directly construct this struct.
Instead, users must call tl::parse() and use the returned VDom.
Implementations§
Source§impl<'a, const MAX_NODES: usize, const MAX_STACK: usize, const MAX_ROOTS: usize, const MAX_IDS: usize, const MAX_CLASSES: usize, const MAX_SELECTOR_NODES: usize> Parser<'a, MAX_NODES, MAX_STACK, MAX_ROOTS, MAX_IDS, MAX_CLASSES, MAX_SELECTOR_NODES>
impl<'a, const MAX_NODES: usize, const MAX_STACK: usize, const MAX_ROOTS: usize, const MAX_IDS: usize, const MAX_CLASSES: usize, const MAX_SELECTOR_NODES: usize> Parser<'a, MAX_NODES, MAX_STACK, MAX_ROOTS, MAX_IDS, MAX_CLASSES, MAX_SELECTOR_NODES>
Sourcepub fn resolve_node_id(&self, id: InnerNodeHandle) -> Option<&Node<'a>>
pub fn resolve_node_id(&self, id: InnerNodeHandle) -> Option<&Node<'a>>
Resolves an internal Node ID obtained from a NodeHandle to a Node
Sourcepub fn resolve_node_id_mut(
&mut self,
id: InnerNodeHandle,
) -> Option<&mut Node<'a>>
pub fn resolve_node_id_mut( &mut self, id: InnerNodeHandle, ) -> Option<&mut Node<'a>>
Resolves an internal Node ID obtained from a NodeHandle to a Node
Trait Implementations§
Source§impl<'a, const MAX_NODES: usize, const MAX_STACK: usize, const MAX_ROOTS: usize, const MAX_IDS: usize, const MAX_CLASSES: usize, const MAX_SELECTOR_NODES: usize> Debug for Parser<'a, MAX_NODES, MAX_STACK, MAX_ROOTS, MAX_IDS, MAX_CLASSES, MAX_SELECTOR_NODES>
impl<'a, const MAX_NODES: usize, const MAX_STACK: usize, const MAX_ROOTS: usize, const MAX_IDS: usize, const MAX_CLASSES: usize, const MAX_SELECTOR_NODES: usize> Debug for Parser<'a, MAX_NODES, MAX_STACK, MAX_ROOTS, MAX_IDS, MAX_CLASSES, MAX_SELECTOR_NODES>
Source§impl<'a, const MAX_NODES: usize, const MAX_STACK: usize, const MAX_ROOTS: usize, const MAX_IDS: usize, const MAX_CLASSES: usize, const MAX_SELECTOR_NODES: usize> From<Parser<'a, MAX_NODES, MAX_STACK, MAX_ROOTS, MAX_IDS, MAX_CLASSES, MAX_SELECTOR_NODES>> for VDom<'a, MAX_NODES, MAX_STACK, MAX_ROOTS, MAX_IDS, MAX_CLASSES, MAX_SELECTOR_NODES>
impl<'a, const MAX_NODES: usize, const MAX_STACK: usize, const MAX_ROOTS: usize, const MAX_IDS: usize, const MAX_CLASSES: usize, const MAX_SELECTOR_NODES: usize> From<Parser<'a, MAX_NODES, MAX_STACK, MAX_ROOTS, MAX_IDS, MAX_CLASSES, MAX_SELECTOR_NODES>> for VDom<'a, MAX_NODES, MAX_STACK, MAX_ROOTS, MAX_IDS, MAX_CLASSES, MAX_SELECTOR_NODES>
Auto Trait Implementations§
impl<'a, const MAX_NODES: usize = 0, const MAX_STACK: usize = 0, const MAX_ROOTS: usize = 0, const MAX_IDS: usize = 0, const MAX_CLASSES: usize = 0, const MAX_SELECTOR_NODES: usize = 0> !Send for Parser<'a, MAX_NODES, MAX_STACK, MAX_ROOTS, MAX_IDS, MAX_CLASSES, MAX_SELECTOR_NODES>
impl<'a, const MAX_NODES: usize = 0, const MAX_STACK: usize = 0, const MAX_ROOTS: usize = 0, const MAX_IDS: usize = 0, const MAX_CLASSES: usize = 0, const MAX_SELECTOR_NODES: usize = 0> !Sync for Parser<'a, MAX_NODES, MAX_STACK, MAX_ROOTS, MAX_IDS, MAX_CLASSES, MAX_SELECTOR_NODES>
impl<'a, const MAX_NODES: usize, const MAX_STACK: usize, const MAX_ROOTS: usize, const MAX_IDS: usize, const MAX_CLASSES: usize, const MAX_SELECTOR_NODES: usize> Freeze for Parser<'a, MAX_NODES, MAX_STACK, MAX_ROOTS, MAX_IDS, MAX_CLASSES, MAX_SELECTOR_NODES>where
InlineVec<NodeHandle, MAX_STACK>: Freeze,
InlineVec<Node<'a>, MAX_NODES>: Freeze,
InlineVec<NodeHandle, MAX_ROOTS>: Freeze,
InlineHashMap<Bytes<'a>, NodeHandle, MAX_IDS>: Freeze,
InlineHashMap<Bytes<'a>, InlineVec<NodeHandle, MAX_NODES>, MAX_CLASSES>: Freeze,
impl<'a, const MAX_NODES: usize, const MAX_STACK: usize, const MAX_ROOTS: usize, const MAX_IDS: usize, const MAX_CLASSES: usize, const MAX_SELECTOR_NODES: usize> RefUnwindSafe for Parser<'a, MAX_NODES, MAX_STACK, MAX_ROOTS, MAX_IDS, MAX_CLASSES, MAX_SELECTOR_NODES>where
InlineVec<NodeHandle, MAX_STACK>: RefUnwindSafe,
InlineVec<Node<'a>, MAX_NODES>: RefUnwindSafe,
InlineVec<NodeHandle, MAX_ROOTS>: RefUnwindSafe,
InlineHashMap<Bytes<'a>, NodeHandle, MAX_IDS>: RefUnwindSafe,
InlineHashMap<Bytes<'a>, InlineVec<NodeHandle, MAX_NODES>, MAX_CLASSES>: RefUnwindSafe,
impl<'a, const MAX_NODES: usize, const MAX_STACK: usize, const MAX_ROOTS: usize, const MAX_IDS: usize, const MAX_CLASSES: usize, const MAX_SELECTOR_NODES: usize> Unpin for Parser<'a, MAX_NODES, MAX_STACK, MAX_ROOTS, MAX_IDS, MAX_CLASSES, MAX_SELECTOR_NODES>where
InlineVec<NodeHandle, MAX_STACK>: Unpin,
InlineVec<Node<'a>, MAX_NODES>: Unpin,
InlineVec<NodeHandle, MAX_ROOTS>: Unpin,
InlineHashMap<Bytes<'a>, NodeHandle, MAX_IDS>: Unpin,
InlineHashMap<Bytes<'a>, InlineVec<NodeHandle, MAX_NODES>, MAX_CLASSES>: Unpin,
impl<'a, const MAX_NODES: usize, const MAX_STACK: usize, const MAX_ROOTS: usize, const MAX_IDS: usize, const MAX_CLASSES: usize, const MAX_SELECTOR_NODES: usize> UnsafeUnpin for Parser<'a, MAX_NODES, MAX_STACK, MAX_ROOTS, MAX_IDS, MAX_CLASSES, MAX_SELECTOR_NODES>where
InlineVec<NodeHandle, MAX_STACK>: UnsafeUnpin,
InlineVec<Node<'a>, MAX_NODES>: UnsafeUnpin,
InlineVec<NodeHandle, MAX_ROOTS>: UnsafeUnpin,
InlineHashMap<Bytes<'a>, NodeHandle, MAX_IDS>: UnsafeUnpin,
InlineHashMap<Bytes<'a>, InlineVec<NodeHandle, MAX_NODES>, MAX_CLASSES>: UnsafeUnpin,
impl<'a, const MAX_NODES: usize, const MAX_STACK: usize, const MAX_ROOTS: usize, const MAX_IDS: usize, const MAX_CLASSES: usize, const MAX_SELECTOR_NODES: usize> UnwindSafe for Parser<'a, MAX_NODES, MAX_STACK, MAX_ROOTS, MAX_IDS, MAX_CLASSES, MAX_SELECTOR_NODES>where
InlineVec<NodeHandle, MAX_STACK>: UnwindSafe,
InlineVec<Node<'a>, MAX_NODES>: UnwindSafe,
InlineVec<NodeHandle, MAX_ROOTS>: UnwindSafe,
InlineHashMap<Bytes<'a>, NodeHandle, MAX_IDS>: UnwindSafe,
InlineHashMap<Bytes<'a>, InlineVec<NodeHandle, MAX_NODES>, MAX_CLASSES>: UnwindSafe,
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