pub struct Reader {
pub hashes: Vec<InputHash>,
}Fields§
§hashes: Vec<InputHash>Implementations§
Source§impl Reader
impl Reader
Sourcepub fn each(
&mut self,
path: &Path,
required: &[&str],
each: impl FnMut(&Row) -> Result<()>,
) -> Result<()>
pub fn each( &mut self, path: &Path, required: &[&str], each: impl FnMut(&Row) -> Result<()>, ) -> Result<()>
Hash path, check its header, and hand each record to each in file order.
Sourcepub fn reread(
&self,
path: &Path,
required: &[&str],
each: impl FnMut(&Row) -> Result<()>,
) -> Result<()>
pub fn reread( &self, path: &Path, required: &[&str], each: impl FnMut(&Row) -> Result<()>, ) -> Result<()>
A second pass over a file this reader already hashed. The file must be unchanged, and it is not recorded again, so the manifest’s input list is the same as for a single pass.
pub fn table(&mut self, path: &Path, required: &[&str]) -> Result<Vec<Row>>
Sourcepub fn table_where(
&mut self,
path: &Path,
required: &[&str],
keep: impl Fn(&Row) -> bool,
) -> Result<Vec<Row>>
pub fn table_where( &mut self, path: &Path, required: &[&str], keep: impl Fn(&Row) -> bool, ) -> Result<Vec<Row>>
Like Reader::table, keeping only the rows keep accepts.
pub fn lines(&mut self, path: &Path) -> Result<BTreeSet<String>>
Trait Implementations§
Auto Trait Implementations§
impl Freeze for Reader
impl RefUnwindSafe for Reader
impl Send for Reader
impl Sync for Reader
impl Unpin for Reader
impl UnsafeUnpin for Reader
impl UnwindSafe for Reader
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
impl<ST, DT> CastableFrom<ST, Initialized, Initialized> for DT
impl<ST, DT> CastableFrom<ST, Uninit, Uninit> for DT
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
Converts
self into a Left variant of Either<Self, Self>
if into_left is true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
Converts
self into a Left variant of Either<Self, Self>
if into_left(&self) returns true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§impl<T> Pointable for T
impl<T> Pointable for T
impl<T> Read<Exclusive, BecauseExclusive> for Twhere
T: ?Sized,
Source§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
Source§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self from the equivalent element of its
superset. Read moreSource§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if
self is actually part of its subset T (and can be converted to it).Source§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset but without any property checks. Always succeeds.Source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.