pub struct Remembered<'a> {
pub tree: &'a str,
pub kept: &'a dyn Store,
pub goal: Option<Goal>,
}Expand description
What it takes to read what is already known of an investigation: its name, where it is kept, and which way is better.
The three travel together because they come out of one soma-tree.toml and
none means anything without the others: a store without the tree’s name
returns another investigation’s records, and a score without the direction
does not say whether it is good.
Fields§
§tree: &'a str§kept: &'a dyn Store§goal: Option<Goal>Auto Trait Implementations§
impl<'a> Freeze for Remembered<'a>
impl<'a> !RefUnwindSafe for Remembered<'a>
impl<'a> Send for Remembered<'a>
impl<'a> Sync for Remembered<'a>
impl<'a> Unpin for Remembered<'a>
impl<'a> UnsafeUnpin for Remembered<'a>
impl<'a> !UnwindSafe for Remembered<'a>
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