pub struct Findings {
pub findings: BTreeMap<String, Vec<String>>,
pub declared: BTreeMap<String, [String; 2]>,
}Expand description
One step: what foreseen.changes said, and the one axis it was not given.
Fields§
§findings: BTreeMap<String, Vec<String>>{node: [finding, ...]}. A node with nothing said about it is absent.
declared: BTreeMap<String, [String; 2]>{node: [before, after]} — the readable form of a declaration that
moved, so a report can print Embed(0.5) → Embed(0.9) rather than the
two digests the fold turned it into.
Implementations§
Source§impl Findings
impl Findings
Sourcepub fn the_edit(&self) -> Vec<&str>
pub fn the_edit(&self) -> Vec<&str>
Where somebody typed, with what merely inherited it left out.
Without this separation, inserting one node in a graph of forty reports forty changes and says nothing about which edit caused them.
Sourcepub fn not_comparable(&self) -> Vec<&str>
pub fn not_comparable(&self) -> Vec<&str>
The nodes whose numbers cannot be compared with the ones from before.
A retrained node is not one of them, and neither is what sits under it: its results moved without it becoming another variant, which is what a trial is.
Trait Implementations§
Source§impl<'de> Deserialize<'de> for Findings
impl<'de> Deserialize<'de> for Findings
Source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read more
Auto Trait Implementations§
impl Freeze for Findings
impl RefUnwindSafe for Findings
impl Send for Findings
impl Sync for Findings
impl Unpin for Findings
impl UnsafeUnpin for Findings
impl UnwindSafe for Findings
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