pub enum CacheEligibility {
Eligible,
TransientSource,
Bypassed,
}Expand description
Whether a node’s result can be cached, and if not, why.
Variants§
Eligible
Its key names everything it depends on.
TransientSource
A source under it has no stable key, so its key is unique to this graph.
Bypassed
It, something it is drawn from, or something it is drawn into asks
for CacheIntent::Bypass.
Trait Implementations§
Source§impl Clone for CacheEligibility
impl Clone for CacheEligibility
impl Copy for CacheEligibility
Source§impl Debug for CacheEligibility
impl Debug for CacheEligibility
impl Eq for CacheEligibility
Source§impl PartialEq for CacheEligibility
impl PartialEq for CacheEligibility
impl StructuralPartialEq for CacheEligibility
Auto Trait Implementations§
impl Freeze for CacheEligibility
impl RefUnwindSafe for CacheEligibility
impl Send for CacheEligibility
impl Sync for CacheEligibility
impl Unpin for CacheEligibility
impl UnsafeUnpin for CacheEligibility
impl UnwindSafe for CacheEligibility
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
impl<ST, DT> CastableFrom<ST, Initialized, Initialized> for DT
impl<ST, DT> CastableFrom<ST, Uninit, Uninit> for DT
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
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.