pub struct PredicateHeap { /* private fields */ }Expand description
A max-heap of predicates. The keys are based on the trail positions of the predicates in the state, meaning predicates are popped in reverse trail order. Implied predicates are popped before the predicate on the trail that implies the predicate.
Implementations§
Source§impl PredicateHeap
impl PredicateHeap
Sourcepub fn is_empty(&self) -> bool
pub fn is_empty(&self) -> bool
See BinaryHeap::is_empty.
Sourcepub fn pop(&mut self) -> Option<Predicate>
pub fn pop(&mut self) -> Option<Predicate>
See BinaryHeap::pop.
Sourcepub fn push(&mut self, predicate: Predicate, state: &State)
pub fn push(&mut self, predicate: Predicate, state: &State)
Push a new predicate onto the heap.
Its priority will be based on its trail position in the given state. This heap will
return elements through Self::pop by reverse-trail order.
If the predicate is not true in the given state, this method panics.
Trait Implementations§
Source§impl Clone for PredicateHeap
impl Clone for PredicateHeap
Source§fn clone(&self) -> PredicateHeap
fn clone(&self) -> PredicateHeap
Returns a duplicate of the value. Read more
1.0.0 (const: unstable) · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source. Read moreSource§impl Debug for PredicateHeap
impl Debug for PredicateHeap
Source§impl Default for PredicateHeap
impl Default for PredicateHeap
Source§fn default() -> PredicateHeap
fn default() -> PredicateHeap
Returns the “default value” for a type. Read more
Auto Trait Implementations§
impl Freeze for PredicateHeap
impl RefUnwindSafe for PredicateHeap
impl Send for PredicateHeap
impl Sync for PredicateHeap
impl Unpin for PredicateHeap
impl UnsafeUnpin for PredicateHeap
impl UnwindSafe for PredicateHeap
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> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<T> Downcast for Twhere
T: Any,
impl<T> Downcast for Twhere
T: Any,
Source§fn into_any(self: Box<T>) -> Box<dyn Any>
fn into_any(self: Box<T>) -> Box<dyn Any>
Converts
Box<dyn Trait> (where Trait: Downcast) to Box<dyn Any>, which can then be
downcast into Box<dyn ConcreteType> where ConcreteType implements Trait.Source§fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>
fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>
Converts
Rc<Trait> (where Trait: Downcast) to Rc<Any>, which can then be further
downcast into Rc<ConcreteType> where ConcreteType implements Trait.Source§fn as_any(&self) -> &(dyn Any + 'static)
fn as_any(&self) -> &(dyn Any + 'static)
Converts
&Trait (where Trait: Downcast) to &Any. This is needed since Rust cannot
generate &Any’s vtable from &Trait’s.Source§fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
Converts
&mut Trait (where Trait: Downcast) to &Any. This is needed since Rust cannot
generate &mut Any’s vtable from &mut Trait’s.Source§impl<T> DowncastSend for T
impl<T> DowncastSend for T
Source§impl<T> DowncastSync for T
impl<T> DowncastSync for T
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