pub struct LearnedOrder {
pub producers: BTreeSet<TaskId>,
}Expand description
The tasks whose outputs a task consumed, in sorted order.
Fields§
§producers: BTreeSet<TaskId>The producers.
Trait Implementations§
Source§impl Clone for LearnedOrder
impl Clone for LearnedOrder
Source§impl Debug for LearnedOrder
impl Debug for LearnedOrder
Source§impl<'bytes, Ctx> Decode<'bytes, Ctx> for LearnedOrder
impl<'bytes, Ctx> Decode<'bytes, Ctx> for LearnedOrder
Source§impl<Ctx> Encode<Ctx> for LearnedOrder
impl<Ctx> Encode<Ctx> for LearnedOrder
impl Eq for LearnedOrder
Source§impl PartialEq for LearnedOrder
impl PartialEq for LearnedOrder
Source§impl Record for LearnedOrder
impl Record for LearnedOrder
impl StructuralPartialEq for LearnedOrder
Auto Trait Implementations§
impl Freeze for LearnedOrder
impl RefUnwindSafe for LearnedOrder
impl Send for LearnedOrder
impl Sync for LearnedOrder
impl Unpin for LearnedOrder
impl UnsafeUnpin for LearnedOrder
impl UnwindSafe for LearnedOrder
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,
§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Compare self to
key and return true if they are equal.