#[non_exhaustive]pub struct Compared {
pub missing: Vec<Vec<u8>>,
pub extra: Vec<Vec<u8>>,
pub first: Option<Divergence>,
}Expand description
Rows the new side lacks, rows it invents, and the first ordering difference. Membership and order are reported separately because they fail for different reasons: a missing row is a writer nobody updated, a reordering is score drift.
use kevy_cli::Reply;
use kevy_cli::shadow::{Shape, compare, rows_of};
let old = rows_of(&Reply::Array(vec![Reply::Bulk(b"a".to_vec()), Reply::Bulk(b"b".to_vec())]), Shape::Flat);
let new = rows_of(&Reply::Array(vec![Reply::Bulk(b"a".to_vec()), Reply::Bulk(b"c".to_vec())]), Shape::Flat);
let c = compare(&old, &new);
assert_eq!((c.missing, c.extra), (vec![b"b".to_vec()], vec![b"c".to_vec()]));Fields (Non-exhaustive)§
This struct is marked as non-exhaustive
Non-exhaustive structs could have additional fields added in future. Therefore, non-exhaustive structs cannot be constructed in external crates using the traditional
Struct { .. } syntax; cannot be matched against without a wildcard ..; and struct update syntax will not work.missing: Vec<Vec<u8>>Rows the old path returns and the new one does not.
use kevy_cli::Reply;
use kevy_cli::shadow::{Shape, compare, rows_of};
let old = rows_of(&Reply::Array(vec![Reply::Bulk(b"a".to_vec()), Reply::Bulk(b"b".to_vec())]), Shape::Flat);
let new = rows_of(&Reply::Array(vec![Reply::Bulk(b"a".to_vec())]), Shape::Flat);
assert_eq!(compare(&old, &new).missing, [b"b".to_vec()]);extra: Vec<Vec<u8>>Rows the new path returns and the old one does not.
use kevy_cli::Reply;
use kevy_cli::shadow::{Shape, compare, rows_of};
let old = rows_of(&Reply::Array(vec![Reply::Bulk(b"a".to_vec())]), Shape::Flat);
let new = rows_of(&Reply::Array(vec![Reply::Bulk(b"a".to_vec()), Reply::Bulk(b"b".to_vec())]), Shape::Flat);
assert_eq!(compare(&old, &new).extra, [b"b".to_vec()]);first: Option<Divergence>The first position where the two orders differ, if any.
use kevy_cli::Reply;
use kevy_cli::shadow::{Shape, compare, rows_of};
let old = rows_of(&Reply::Array(vec![Reply::Bulk(b"a".to_vec()), Reply::Bulk(b"b".to_vec())]), Shape::Flat);
let new = rows_of(&Reply::Array(vec![Reply::Bulk(b"b".to_vec()), Reply::Bulk(b"a".to_vec())]), Shape::Flat);
let c = compare(&old, &new);
assert!(c.missing.is_empty() && c.extra.is_empty(), "same membership");
assert_eq!(c.first.map(|d| d.at), Some(0), "but not the same order");Trait Implementations§
impl Eq for Compared
impl StructuralPartialEq for Compared
Auto Trait Implementations§
impl Freeze for Compared
impl RefUnwindSafe for Compared
impl Send for Compared
impl Sync for Compared
impl Unpin for Compared
impl UnsafeUnpin for Compared
impl UnwindSafe for Compared
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