pub struct UnreadableKey {
pub collections: BTreeSet<String>,
pub paths: Vec<String>,
pub longest: usize,
}Expand description
What unreadable_unit_keys knows about one unreadable unit.
Fields§
§collections: BTreeSet<String>core and/or mode: the collections holding an unreadable file.
paths: Vec<String>The unreadable collection-relative paths, byte-sorted and unique.
longest: usizeThe longest host path length among paths.
Trait Implementations§
Source§impl Clone for UnreadableKey
impl Clone for UnreadableKey
Source§impl Debug for UnreadableKey
impl Debug for UnreadableKey
Source§impl Default for UnreadableKey
impl Default for UnreadableKey
impl Eq for UnreadableKey
Source§impl PartialEq for UnreadableKey
impl PartialEq for UnreadableKey
impl StructuralPartialEq for UnreadableKey
Auto Trait Implementations§
impl Freeze for UnreadableKey
impl RefUnwindSafe for UnreadableKey
impl Send for UnreadableKey
impl Sync for UnreadableKey
impl Unpin for UnreadableKey
impl UnsafeUnpin for UnreadableKey
impl UnwindSafe for UnreadableKey
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.