Struct MatchedNodes 

pub struct MatchedNodes { /* private fields */ }

Container for a set of branch nodes matched to a base node.

In the Java implementation, this uses a HashSet with identity-based equality. We achieve the same by using node IDs for hashing.

Implementations

impl MatchedNodes

pub fn new(owner: Weak<RefCell<NodeInner>>) -> Self

Creates a new container for matched nodes.

Arguments

• owner - Weak reference to the base node that owns this container.

pub fn owner(&self) -> &Weak<RefCell<NodeInner>>

Returns a weak reference to the owner base node.

pub fn add_match(&mut self, node: NodeRef)

Adds a branch node to the match set.

Arguments

• node - The branch node to add.

pub fn del_match(&mut self, node: &NodeRef)

Removes a branch node from the match set.

Arguments

• node - The branch node to remove.

pub fn clear_matches(&mut self)

Clears all matches.

pub fn matches(&self) -> &[NodeRef]

Returns the matched nodes.

pub fn match_count(&self) -> usize

Returns the number of matched nodes.

pub fn contains(&self, node: &NodeRef) -> bool

Checks if a node is in the match set.

pub fn full_match(&self) -> Option<NodeRef>

Gets the first node that is fully matched to the owner.

A full match means both content and children match (MATCH_FULL).

Trait Implementations

impl Clone for MatchedNodes

fn clone(&self) -> MatchedNodes

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for MatchedNodes

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

Formats the value using the given formatter.

impl Default for MatchedNodes

fn default() -> Self

Returns the “default value” for a type.