Struct VisitedSet 

pub struct VisitedSet { /* private fields */ }

Tracks which (peer_id, goal_hash) pairs have been visited to prevent loops.

When a (peer_id, goal) pair is first visited try_visit returns true. Subsequent visits return false, signalling a loop.

Implementations

impl VisitedSet

pub fn new(max_entries: usize) -> Self

Create a new VisitedSet that holds at most max_entries pairs.

pub fn try_visit(&mut self, peer_id: &str, goal: &Term) -> bool

Attempt to record a visit for (peer_id, goal).

Returns true if this is the first visit (no loop), or false if the pair has already been seen (loop detected) or the set is full.

pub fn len(&self) -> usize

Return the number of recorded visits.

pub fn is_empty(&self) -> bool

Return true if no visits have been recorded.

pub fn contains(&self, peer_id: &str, goal: &Term) -> bool

Check whether (peer_id, goal) is already in the visited set without modifying it.