pub struct Bounds<Node: Debug + Eq + Hash> {
pub success: HashSet<Node>,
pub failure: HashSet<Node>,
}
Expand description
The upper and lower bounds of the search.
Fields§
§success: HashSet<Node>
The upper bounds of the search. The ancestors of this set have (or are
assumed to have) Status::Success
.
failure: HashSet<Node>
The lower bounds of the search. The ancestors of this set have (or are
assumed to have) Status::Failure
.
Trait Implementations§
impl<Node: Eq + Debug + Eq + Hash> Eq for Bounds<Node>
impl<Node: Debug + Eq + Hash> StructuralPartialEq for Bounds<Node>
Auto Trait Implementations§
impl<Node> Freeze for Bounds<Node>
impl<Node> RefUnwindSafe for Bounds<Node>where
Node: RefUnwindSafe,
impl<Node> Send for Bounds<Node>where
Node: Send,
impl<Node> Sync for Bounds<Node>where
Node: Sync,
impl<Node> Unpin for Bounds<Node>where
Node: Unpin,
impl<Node> UnwindSafe for Bounds<Node>where
Node: 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
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Compare self to
key
and return true
if they are equal.