pub enum LossyPath {
Heuristic,
}Expand description
Selection backend for opt-in lossy JSON pruning. Heuristic is the only Phase 1
implementation; a future Select (Tokenfold Select as the scorer) is Phase 2 and not
implemented — deliberately a single-variant enum for now rather than a bare bool, since the
CLI already speaks of this as choosing an algorithm (--lossy heuristic), not toggling a flag.
Variants§
Heuristic
Trait Implementations§
impl Copy for LossyPath
impl Eq for LossyPath
impl StructuralPartialEq for LossyPath
Auto Trait Implementations§
impl Freeze for LossyPath
impl RefUnwindSafe for LossyPath
impl Send for LossyPath
impl Sync for LossyPath
impl Unpin for LossyPath
impl UnsafeUnpin for LossyPath
impl UnwindSafe for LossyPath
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
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.