pub struct RefWithCost<'a, N, T: 'a> {
pub object: &'a T,
pub cost: N,
}
Expand description
A reference packed with a cost value.
Fields§
§object: &'a T
The reference to an object.
cost: N
The cost of the object.
Implementations§
Source§impl<'a, N, T> RefWithCost<'a, N, T>
impl<'a, N, T> RefWithCost<'a, N, T>
Sourcepub fn new(object: &'a T, cost: N) -> RefWithCost<'a, N, T>
pub fn new(object: &'a T, cost: N) -> RefWithCost<'a, N, T>
Creates a new reference packed with a cost value.
Trait Implementations§
Source§impl<'a, N: PartialOrd, T> Ord for RefWithCost<'a, N, T>
impl<'a, N: PartialOrd, T> Ord for RefWithCost<'a, N, T>
Source§fn cmp(&self, other: &RefWithCost<'a, N, T>) -> Ordering
fn cmp(&self, other: &RefWithCost<'a, N, T>) -> Ordering
1.21.0 · Source§fn max(self, other: Self) -> Selfwhere
Self: Sized,
fn max(self, other: Self) -> Selfwhere
Self: Sized,
Compares and returns the maximum of two values. Read more
Source§impl<'a, N: PartialEq, T> PartialEq for RefWithCost<'a, N, T>
impl<'a, N: PartialEq, T> PartialEq for RefWithCost<'a, N, T>
Source§impl<'a, N: PartialOrd, T> PartialOrd for RefWithCost<'a, N, T>
impl<'a, N: PartialOrd, T> PartialOrd for RefWithCost<'a, N, T>
impl<'a, N: PartialEq, T> Eq for RefWithCost<'a, N, T>
Auto Trait Implementations§
impl<'a, N, T> Freeze for RefWithCost<'a, N, T>where
N: Freeze,
impl<'a, N, T> RefUnwindSafe for RefWithCost<'a, N, T>where
N: RefUnwindSafe,
T: RefUnwindSafe,
impl<'a, N, T> Send for RefWithCost<'a, N, T>
impl<'a, N, T> Sync for RefWithCost<'a, N, T>
impl<'a, N, T> Unpin for RefWithCost<'a, N, T>where
N: Unpin,
impl<'a, N, T> UnwindSafe for RefWithCost<'a, N, T>where
N: UnwindSafe,
T: RefUnwindSafe,
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> Comparable<K> for Q
impl<Q, K> Comparable<K> for Q
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>
Convert
Box<dyn Trait>
(where Trait: Downcast
) to Box<dyn Any>
. Box<dyn Any>
can
then be further downcast
into Box<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>
Convert
Rc<Trait>
(where Trait: Downcast
) to Rc<Any>
. Rc<Any>
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)
Convert
&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)
Convert
&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> DowncastSync for T
impl<T> DowncastSync for T
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.Source§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
Source§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self
from the equivalent element of its
superset. Read moreSource§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if
self
is actually part of its subset T
(and can be converted to it).Source§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset
but without any property checks. Always succeeds.Source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self
to the equivalent element of its superset.