From 4ee40f73a2dcefb6be0b1ea32dbfdecc31de240c Mon Sep 17 00:00:00 2001 From: sylvestre Date: Fri, 23 Jun 2023 03:03:16 +0000 Subject: [PATCH] deploy: f0e8d44e6e64ee3354f95864c0a25b74cf1c1151 --- dev/implementors/core/clone/trait.Clone.js | 4 +- dev/implementors/core/cmp/trait.Eq.js | 6 +- dev/implementors/core/cmp/trait.PartialEq.js | 6 +- dev/implementors/core/convert/trait.From.js | 4 +- dev/implementors/core/error/trait.Error.js | 2 +- dev/implementors/core/fmt/trait.Debug.js | 10 +- dev/implementors/core/fmt/trait.Display.js | 2 +- .../iter/traits/iterator/trait.Iterator.js | 2 +- dev/implementors/core/marker/trait.Copy.js | 6 +- .../core/marker/trait.StructuralEq.js | 6 +- .../core/marker/trait.StructuralPartialEq.js | 6 +- dev/search-index.js | 8 +- dev/uu_chgrp/entries/struct.Group.html | 2 +- dev/uu_chgrp/entries/struct.Passwd.html | 2 +- dev/uu_chown/entries/struct.Group.html | 2 +- dev/uu_chown/entries/struct.Passwd.html | 2 +- dev/uu_chown/struct.Group.html | 2 +- dev/uu_chown/struct.Passwd.html | 2 +- dev/uu_cp/enum.Error.html | 2 +- .../format/struct.WhitespaceSplitter.html | 254 ++++++++++-------- dev/uu_tail/chunks/struct.ReverseChunks.html | 254 ++++++++++-------- dev/uucore/encoding/enum.DecodeError.html | 2 +- dev/uucore/entries/struct.Group.html | 2 +- dev/uucore/entries/struct.Passwd.html | 2 +- dev/uucore/error/struct.ClapErrorWrapper.html | 2 +- dev/uucore/error/struct.UIoError.html | 2 +- dev/uucore/error/struct.USimpleError.html | 2 +- dev/uucore/error/struct.UUsageError.html | 2 +- dev/uucore/error/trait.FromIo.html | 4 +- dev/uucore/error/trait.UError.html | 4 +- dev/uucore/lines/struct.Lines.html | 254 ++++++++++-------- .../parse_size/enum.ParseSizeError.html | 2 +- dev/uucore/perms/entries/struct.Group.html | 2 +- dev/uucore/perms/entries/struct.Passwd.html | 2 +- dev/uucore/utmpx/struct.UtmpxIter.html | 254 ++++++++++-------- 35 files changed, 596 insertions(+), 524 deletions(-) diff --git a/dev/implementors/core/clone/trait.Clone.js b/dev/implementors/core/clone/trait.Clone.js index 702b10a07..2e9065e06 100644 --- a/dev/implementors/core/clone/trait.Clone.js +++ b/dev/implementors/core/clone/trait.Clone.js @@ -1,5 +1,5 @@ (function() {var implementors = { -"uu_cp":[["impl Clone for ClobberMode"],["impl Clone for SparseMode"],["impl Clone for ReflinkMode"],["impl Clone for OverwriteMode"]], +"uu_cp":[["impl Clone for OverwriteMode"],["impl Clone for ClobberMode"],["impl Clone for ReflinkMode"],["impl Clone for SparseMode"]], "uu_dd":[["impl Clone for Alarm"]], "uu_factor":[["impl Clone for Factors"]], "uu_install":[["impl Clone for MainFunction"]], @@ -10,5 +10,5 @@ "uu_sort":[["impl Clone for GeneralF64ParseResult"],["impl Clone for GlobalSettings"],["impl<'a> Clone for Line<'a>"]], "uu_stty":[["impl<T: Clone> Clone for Flag<T>"]], "uu_tail":[["impl Clone for FollowMode"],["impl Clone for BytesChunk"],["impl Clone for Signum"]], -"uucore":[["impl Clone for MissingHandling"],["impl Clone for BackupMode"],["impl Clone for ResolveMode"],["impl Clone for FsUsage"],["impl Clone for Format"],["impl Clone for Group"],["impl Clone for Quotes"],["impl Clone for UpdateMode"],["impl Clone for Verbosity"],["impl Clone for MountInfo"],["impl Clone for VerbosityLevel"],["impl Clone for Passwd"]] +"uucore":[["impl Clone for Verbosity"],["impl Clone for BackupMode"],["impl Clone for MissingHandling"],["impl Clone for Quotes"],["impl Clone for Passwd"],["impl Clone for Group"],["impl Clone for ResolveMode"],["impl Clone for MountInfo"],["impl Clone for UpdateMode"],["impl Clone for VerbosityLevel"],["impl Clone for FsUsage"],["impl Clone for Format"]] };if (window.register_implementors) {window.register_implementors(implementors);} else {window.pending_implementors = implementors;}})() \ No newline at end of file diff --git a/dev/implementors/core/cmp/trait.Eq.js b/dev/implementors/core/cmp/trait.Eq.js index 64356768f..0b464ac2a 100644 --- a/dev/implementors/core/cmp/trait.Eq.js +++ b/dev/implementors/core/cmp/trait.Eq.js @@ -1,5 +1,5 @@ (function() {var implementors = { -"uu_cp":[["impl Eq for SparseMode"],["impl Eq for OverwriteMode"],["impl Eq for ClobberMode"],["impl Eq for Preserve"],["impl Eq for ReflinkMode"]], +"uu_cp":[["impl Eq for OverwriteMode"],["impl Eq for ReflinkMode"],["impl Eq for Preserve"],["impl Eq for SparseMode"],["impl Eq for ClobberMode"]], "uu_dircolors":[["impl Eq for OutputFmt"]], "uu_factor":[["impl Eq for Factors"]], "uu_install":[["impl Eq for MainFunction"]], @@ -7,6 +7,6 @@ "uu_ls":[["impl Eq for Format"]], "uu_mv":[["impl Eq for OverwriteMode"]], "uu_numfmt":[["impl Eq for FormatOptions"]], -"uu_tail":[["impl Eq for FollowMode"],["impl Eq for Signum"],["impl Eq for BytesChunk"],["impl Eq for FilterMode"]], -"uucore":[["impl Eq for FileInformation"],["impl Eq for UpdateMode"],["impl Eq for BackupError"],["impl Eq for ResolveMode"],["impl Eq for Range"],["impl Eq for ParseSizeError"],["impl Eq for TraverseSymlinks"],["impl Eq for Verbosity"],["impl Eq for VerbosityLevel"],["impl Eq for MissingHandling"],["impl Eq for BackupMode"]] +"uu_tail":[["impl Eq for FilterMode"],["impl Eq for FollowMode"],["impl Eq for Signum"],["impl Eq for BytesChunk"]], +"uucore":[["impl Eq for ParseSizeError"],["impl Eq for MissingHandling"],["impl Eq for FileInformation"],["impl Eq for BackupError"],["impl Eq for Range"],["impl Eq for TraverseSymlinks"],["impl Eq for Verbosity"],["impl Eq for VerbosityLevel"],["impl Eq for ResolveMode"],["impl Eq for BackupMode"],["impl Eq for UpdateMode"]] };if (window.register_implementors) {window.register_implementors(implementors);} else {window.pending_implementors = implementors;}})() \ No newline at end of file diff --git a/dev/implementors/core/cmp/trait.PartialEq.js b/dev/implementors/core/cmp/trait.PartialEq.js index 9f16ff6a0..4af38f71c 100644 --- a/dev/implementors/core/cmp/trait.PartialEq.js +++ b/dev/implementors/core/cmp/trait.PartialEq.js @@ -1,5 +1,5 @@ (function() {var implementors = { -"uu_cp":[["impl PartialEq<OverwriteMode> for OverwriteMode"],["impl PartialEq<ReflinkMode> for ReflinkMode"],["impl PartialEq<ClobberMode> for ClobberMode"],["impl PartialEq<SparseMode> for SparseMode"],["impl PartialEq<Preserve> for Preserve"]], +"uu_cp":[["impl PartialEq<OverwriteMode> for OverwriteMode"],["impl PartialEq<SparseMode> for SparseMode"],["impl PartialEq<ReflinkMode> for ReflinkMode"],["impl PartialEq<Preserve> for Preserve"],["impl PartialEq<ClobberMode> for ClobberMode"]], "uu_dircolors":[["impl PartialEq<OutputFmt> for OutputFmt"]], "uu_factor":[["impl PartialEq<Factors> for Factors"]], "uu_install":[["impl PartialEq<MainFunction> for MainFunction"]], @@ -8,6 +8,6 @@ "uu_mv":[["impl PartialEq<OverwriteMode> for OverwriteMode"]], "uu_numfmt":[["impl PartialEq<FormatOptions> for FormatOptions"]], "uu_sort":[["impl PartialEq<GeneralF64ParseResult> for GeneralF64ParseResult"]], -"uu_tail":[["impl PartialEq<FilterMode> for FilterMode"],["impl PartialEq<FollowMode> for FollowMode"],["impl PartialEq<BytesChunk> for BytesChunk"],["impl PartialEq<Signum> for Signum"]], -"uucore":[["impl PartialEq<FileInformation> for FileInformation"],["impl PartialEq<MissingHandling> for MissingHandling"],["impl PartialEq<UpdateMode> for UpdateMode"],["impl PartialEq<ResolveMode> for ResolveMode"],["impl PartialEq<ParseSizeError> for ParseSizeError"],["impl PartialEq<VerbosityLevel> for VerbosityLevel"],["impl PartialEq<BackupMode> for BackupMode"],["impl PartialEq<Range> for Range"],["impl PartialEq<TraverseSymlinks> for TraverseSymlinks"],["impl PartialEq<Verbosity> for Verbosity"],["impl PartialEq<BackupError> for BackupError"]] +"uu_tail":[["impl PartialEq<BytesChunk> for BytesChunk"],["impl PartialEq<Signum> for Signum"],["impl PartialEq<FollowMode> for FollowMode"],["impl PartialEq<FilterMode> for FilterMode"]], +"uucore":[["impl PartialEq<MissingHandling> for MissingHandling"],["impl PartialEq<BackupMode> for BackupMode"],["impl PartialEq<TraverseSymlinks> for TraverseSymlinks"],["impl PartialEq<Range> for Range"],["impl PartialEq<ResolveMode> for ResolveMode"],["impl PartialEq<Verbosity> for Verbosity"],["impl PartialEq<BackupError> for BackupError"],["impl PartialEq<ParseSizeError> for ParseSizeError"],["impl PartialEq<UpdateMode> for UpdateMode"],["impl PartialEq<VerbosityLevel> for VerbosityLevel"],["impl PartialEq<FileInformation> for FileInformation"]] };if (window.register_implementors) {window.register_implementors(implementors);} else {window.pending_implementors = implementors;}})() \ No newline at end of file diff --git a/dev/implementors/core/convert/trait.From.js b/dev/implementors/core/convert/trait.From.js index 877a1e040..3ed26fba5 100644 --- a/dev/implementors/core/convert/trait.From.js +++ b/dev/implementors/core/convert/trait.From.js @@ -1,4 +1,4 @@ (function() {var implementors = { -"uu_cp":[["impl<'a> From<Context<String, Error>> for Error"],["impl From<String> for Error"],["impl<'a> From<Context<&'a str, Error>> for Error"],["impl From<Error> for Error"],["impl From<StripPrefixError> for Error"],["impl From<&'static str> for Error"],["impl From<Error> for Error"]], -"uucore":[["impl From<Error<RichFormatter>> for Box<dyn UError>"],["impl<T> From<T> for Box<dyn UError>where\n T: UError + 'static,"],["impl From<Errno> for UIoError"],["impl From<Error> for Box<dyn UError>"],["impl From<Errno> for Box<dyn UError>"],["impl From<DecodeError> for DecodeError"],["impl From<i32> for Box<dyn UError>"],["impl From<Error> for UIoError"],["impl From<Error> for DecodeError"],["impl From<DecodeError> for DecodeError"]] +"uu_cp":[["impl From<&'static str> for Error"],["impl From<Error> for Error"],["impl From<StripPrefixError> for Error"],["impl<'a> From<Context<String, Error>> for Error"],["impl<'a> From<Context<&'a str, Error>> for Error"],["impl From<Error> for Error"],["impl From<String> for Error"]], +"uucore":[["impl From<Errno> for UIoError"],["impl From<Error> for DecodeError"],["impl From<i32> for Box<dyn UError>"],["impl From<DecodeError> for DecodeError"],["impl From<Error<RichFormatter>> for Box<dyn UError>"],["impl<T> From<T> for Box<dyn UError>where\n T: UError + 'static,"],["impl From<Error> for Box<dyn UError>"],["impl From<DecodeError> for DecodeError"],["impl From<Error> for UIoError"],["impl From<Errno> for Box<dyn UError>"]] };if (window.register_implementors) {window.register_implementors(implementors);} else {window.pending_implementors = implementors;}})() \ No newline at end of file diff --git a/dev/implementors/core/error/trait.Error.js b/dev/implementors/core/error/trait.Error.js index 7058e906b..1945c8236 100644 --- a/dev/implementors/core/error/trait.Error.js +++ b/dev/implementors/core/error/trait.Error.js @@ -1,5 +1,5 @@ (function() {var implementors = { "uu_cp":[["impl Error for Error"]], "uu_numfmt":[["impl Error for NumfmtError"]], -"uucore":[["impl Error for UIoError"],["impl Error for ExitCode"],["impl Error for ParseSizeError"],["impl Error for DecodeError"],["impl Error for USimpleError"],["impl Error for BackupError"],["impl Error for ClapErrorWrapper"],["impl Error for UUsageError"]] +"uucore":[["impl Error for ClapErrorWrapper"],["impl Error for ParseSizeError"],["impl Error for USimpleError"],["impl Error for ExitCode"],["impl Error for BackupError"],["impl Error for UUsageError"],["impl Error for DecodeError"],["impl Error for UIoError"]] };if (window.register_implementors) {window.register_implementors(implementors);} else {window.pending_implementors = implementors;}})() \ No newline at end of file diff --git a/dev/implementors/core/fmt/trait.Debug.js b/dev/implementors/core/fmt/trait.Debug.js index b1aeab37c..10f2c09dd 100644 --- a/dev/implementors/core/fmt/trait.Debug.js +++ b/dev/implementors/core/fmt/trait.Debug.js @@ -1,14 +1,14 @@ (function() {var implementors = { -"uu_cp":[["impl Debug for Preserve"],["impl Debug for Attributes"],["impl Debug for Error"]], +"uu_cp":[["impl Debug for Error"],["impl Debug for Attributes"],["impl Debug for Preserve"]], "uu_dd":[["impl Debug for Alarm"]], "uu_dircolors":[["impl Debug for OutputFmt"]], "uu_factor":[["impl Debug for Factors"]], "uu_ln":[["impl Debug for OverwriteMode"]], "uu_ls":[["impl Debug for Format"]], -"uu_numfmt":[["impl Debug for FormatOptions"],["impl Debug for NumfmtError"]], +"uu_numfmt":[["impl Debug for NumfmtError"],["impl Debug for FormatOptions"]], "uu_sort":[["impl<'a> Debug for Line<'a>"],["impl Debug for GeneralF64ParseResult"]], "uu_stat":[["impl Debug for OutputType"]], -"uu_stty":[["impl Debug for TermSize"],["impl<T: Debug> Debug for Flag<T>"]], -"uu_tail":[["impl Debug for FilterMode"],["impl Debug for Settings"],["impl Debug for LinesChunk"],["impl Debug for VerificationResult"],["impl Debug for BytesChunk"],["impl Debug for FollowMode"],["impl Debug for Signum"]], -"uucore":[["impl Debug for UUsageError"],["impl Debug for Group"],["impl Debug for UIoError"],["impl Debug for UpdateMode"],["impl Debug for FsUsage"],["impl Debug for Verbosity"],["impl Debug for MissingHandling"],["impl Debug for USimpleError"],["impl Debug for VerbosityLevel"],["impl Debug for Passwd"],["impl Debug for ParseSizeError"],["impl Debug for BackupError"],["impl Debug for Range"],["impl Debug for ClapErrorWrapper"],["impl Debug for BackupMode"],["impl Debug for ResolveMode"],["impl Debug for ExitCode"],["impl Debug for MountInfo"],["impl Debug for DecodeError"]] +"uu_stty":[["impl<T: Debug> Debug for Flag<T>"],["impl Debug for TermSize"]], +"uu_tail":[["impl Debug for BytesChunk"],["impl Debug for Signum"],["impl Debug for LinesChunk"],["impl Debug for Settings"],["impl Debug for FollowMode"],["impl Debug for FilterMode"],["impl Debug for VerificationResult"]], +"uucore":[["impl Debug for BackupMode"],["impl Debug for ParseSizeError"],["impl Debug for UpdateMode"],["impl Debug for Passwd"],["impl Debug for Range"],["impl Debug for DecodeError"],["impl Debug for ExitCode"],["impl Debug for VerbosityLevel"],["impl Debug for FsUsage"],["impl Debug for UUsageError"],["impl Debug for BackupError"],["impl Debug for USimpleError"],["impl Debug for MountInfo"],["impl Debug for Verbosity"],["impl Debug for UIoError"],["impl Debug for MissingHandling"],["impl Debug for ResolveMode"],["impl Debug for ClapErrorWrapper"],["impl Debug for Group"]] };if (window.register_implementors) {window.register_implementors(implementors);} else {window.pending_implementors = implementors;}})() \ No newline at end of file diff --git a/dev/implementors/core/fmt/trait.Display.js b/dev/implementors/core/fmt/trait.Display.js index c5c011caf..b3fc6a110 100644 --- a/dev/implementors/core/fmt/trait.Display.js +++ b/dev/implementors/core/fmt/trait.Display.js @@ -2,5 +2,5 @@ "uu_cp":[["impl Display for Error"]], "uu_factor":[["impl Display for Factors"]], "uu_numfmt":[["impl Display for NumfmtError"]], -"uucore":[["impl Display for ParseSizeError"],["impl Display for ExitCode"],["impl Display for UIoError"],["impl Display for DecodeError"],["impl Display for USimpleError"],["impl Display for ClapErrorWrapper"],["impl Display for UUsageError"],["impl Display for BackupError"]] +"uucore":[["impl Display for ExitCode"],["impl Display for ClapErrorWrapper"],["impl Display for UIoError"],["impl Display for UUsageError"],["impl Display for DecodeError"],["impl Display for USimpleError"],["impl Display for ParseSizeError"],["impl Display for BackupError"]] };if (window.register_implementors) {window.register_implementors(implementors);} else {window.pending_implementors = implementors;}})() \ No newline at end of file diff --git a/dev/implementors/core/iter/traits/iterator/trait.Iterator.js b/dev/implementors/core/iter/traits/iterator/trait.Iterator.js index 52f1fc04b..aabdbb046 100644 --- a/dev/implementors/core/iter/traits/iterator/trait.Iterator.js +++ b/dev/implementors/core/iter/traits/iterator/trait.Iterator.js @@ -1,5 +1,5 @@ (function() {var implementors = { "uu_numfmt":[["impl<'a> Iterator for WhitespaceSplitter<'a>"]], "uu_tail":[["impl<'a> Iterator for ReverseChunks<'a>"]], -"uucore":[["impl Iterator for UtmpxIter"],["impl<B: BufRead> Iterator for Lines<B>"]] +"uucore":[["impl<B: BufRead> Iterator for Lines<B>"],["impl Iterator for UtmpxIter"]] };if (window.register_implementors) {window.register_implementors(implementors);} else {window.pending_implementors = implementors;}})() \ No newline at end of file diff --git a/dev/implementors/core/marker/trait.Copy.js b/dev/implementors/core/marker/trait.Copy.js index d50dff77c..7e2fd8e7e 100644 --- a/dev/implementors/core/marker/trait.Copy.js +++ b/dev/implementors/core/marker/trait.Copy.js @@ -1,9 +1,9 @@ (function() {var implementors = { -"uu_cp":[["impl Copy for ReflinkMode"],["impl Copy for ClobberMode"],["impl Copy for SparseMode"],["impl Copy for OverwriteMode"]], +"uu_cp":[["impl Copy for ReflinkMode"],["impl Copy for SparseMode"],["impl Copy for ClobberMode"],["impl Copy for OverwriteMode"]], "uu_kill":[["impl Copy for Mode"]], "uu_numfmt":[["impl Copy for RoundMethod"]], "uu_sort":[["impl Copy for GeneralF64ParseResult"]], "uu_stty":[["impl<T: Copy> Copy for Flag<T>"]], -"uu_tail":[["impl Copy for Signum"],["impl Copy for FollowMode"]], -"uucore":[["impl Copy for ResolveMode"],["impl Copy for BackupMode"],["impl Copy for MissingHandling"],["impl Copy for Quotes"],["impl Copy for Format"]] +"uu_tail":[["impl Copy for FollowMode"],["impl Copy for Signum"]], +"uucore":[["impl Copy for MissingHandling"],["impl Copy for ResolveMode"],["impl Copy for BackupMode"],["impl Copy for Format"],["impl Copy for Quotes"]] };if (window.register_implementors) {window.register_implementors(implementors);} else {window.pending_implementors = implementors;}})() \ No newline at end of file diff --git a/dev/implementors/core/marker/trait.StructuralEq.js b/dev/implementors/core/marker/trait.StructuralEq.js index bb53cd4e5..3c4bc00e4 100644 --- a/dev/implementors/core/marker/trait.StructuralEq.js +++ b/dev/implementors/core/marker/trait.StructuralEq.js @@ -1,5 +1,5 @@ (function() {var implementors = { -"uu_cp":[["impl StructuralEq for ReflinkMode"],["impl StructuralEq for SparseMode"],["impl StructuralEq for Preserve"],["impl StructuralEq for OverwriteMode"],["impl StructuralEq for ClobberMode"]], +"uu_cp":[["impl StructuralEq for SparseMode"],["impl StructuralEq for ReflinkMode"],["impl StructuralEq for Preserve"],["impl StructuralEq for OverwriteMode"],["impl StructuralEq for ClobberMode"]], "uu_dircolors":[["impl StructuralEq for OutputFmt"]], "uu_factor":[["impl StructuralEq for Factors"]], "uu_install":[["impl StructuralEq for MainFunction"]], @@ -7,6 +7,6 @@ "uu_ls":[["impl StructuralEq for Format"]], "uu_mv":[["impl StructuralEq for OverwriteMode"]], "uu_numfmt":[["impl StructuralEq for FormatOptions"]], -"uu_tail":[["impl StructuralEq for BytesChunk"],["impl StructuralEq for FilterMode"],["impl StructuralEq for FollowMode"],["impl StructuralEq for Signum"]], -"uucore":[["impl StructuralEq for BackupError"],["impl StructuralEq for ResolveMode"],["impl StructuralEq for VerbosityLevel"],["impl StructuralEq for TraverseSymlinks"],["impl StructuralEq for BackupMode"],["impl StructuralEq for ParseSizeError"],["impl StructuralEq for UpdateMode"],["impl StructuralEq for Range"],["impl StructuralEq for Verbosity"],["impl StructuralEq for MissingHandling"]] +"uu_tail":[["impl StructuralEq for FollowMode"],["impl StructuralEq for Signum"],["impl StructuralEq for BytesChunk"],["impl StructuralEq for FilterMode"]], +"uucore":[["impl StructuralEq for Range"],["impl StructuralEq for BackupError"],["impl StructuralEq for ParseSizeError"],["impl StructuralEq for VerbosityLevel"],["impl StructuralEq for MissingHandling"],["impl StructuralEq for Verbosity"],["impl StructuralEq for ResolveMode"],["impl StructuralEq for TraverseSymlinks"],["impl StructuralEq for BackupMode"],["impl StructuralEq for UpdateMode"]] };if (window.register_implementors) {window.register_implementors(implementors);} else {window.pending_implementors = implementors;}})() \ No newline at end of file diff --git a/dev/implementors/core/marker/trait.StructuralPartialEq.js b/dev/implementors/core/marker/trait.StructuralPartialEq.js index 1d2ee401d..5e8daca7f 100644 --- a/dev/implementors/core/marker/trait.StructuralPartialEq.js +++ b/dev/implementors/core/marker/trait.StructuralPartialEq.js @@ -1,5 +1,5 @@ (function() {var implementors = { -"uu_cp":[["impl StructuralPartialEq for Preserve"],["impl StructuralPartialEq for ClobberMode"],["impl StructuralPartialEq for ReflinkMode"],["impl StructuralPartialEq for OverwriteMode"],["impl StructuralPartialEq for SparseMode"]], +"uu_cp":[["impl StructuralPartialEq for Preserve"],["impl StructuralPartialEq for OverwriteMode"],["impl StructuralPartialEq for ClobberMode"],["impl StructuralPartialEq for SparseMode"],["impl StructuralPartialEq for ReflinkMode"]], "uu_dircolors":[["impl StructuralPartialEq for OutputFmt"]], "uu_factor":[["impl StructuralPartialEq for Factors"]], "uu_install":[["impl StructuralPartialEq for MainFunction"]], @@ -8,6 +8,6 @@ "uu_mv":[["impl StructuralPartialEq for OverwriteMode"]], "uu_numfmt":[["impl StructuralPartialEq for FormatOptions"]], "uu_sort":[["impl StructuralPartialEq for GeneralF64ParseResult"]], -"uu_tail":[["impl StructuralPartialEq for BytesChunk"],["impl StructuralPartialEq for FollowMode"],["impl StructuralPartialEq for FilterMode"],["impl StructuralPartialEq for Signum"]], -"uucore":[["impl StructuralPartialEq for MissingHandling"],["impl StructuralPartialEq for TraverseSymlinks"],["impl StructuralPartialEq for BackupMode"],["impl StructuralPartialEq for VerbosityLevel"],["impl StructuralPartialEq for BackupError"],["impl StructuralPartialEq for Range"],["impl StructuralPartialEq for ResolveMode"],["impl StructuralPartialEq for UpdateMode"],["impl StructuralPartialEq for Verbosity"],["impl StructuralPartialEq for ParseSizeError"]] +"uu_tail":[["impl StructuralPartialEq for BytesChunk"],["impl StructuralPartialEq for FilterMode"],["impl StructuralPartialEq for Signum"],["impl StructuralPartialEq for FollowMode"]], +"uucore":[["impl StructuralPartialEq for ResolveMode"],["impl StructuralPartialEq for Verbosity"],["impl StructuralPartialEq for BackupError"],["impl StructuralPartialEq for VerbosityLevel"],["impl StructuralPartialEq for ParseSizeError"],["impl StructuralPartialEq for UpdateMode"],["impl StructuralPartialEq for TraverseSymlinks"],["impl StructuralPartialEq for Range"],["impl StructuralPartialEq for BackupMode"],["impl StructuralPartialEq for MissingHandling"]] };if (window.register_implementors) {window.register_implementors(implementors);} else {window.pending_implementors = implementors;}})() \ No newline at end of file diff --git a/dev/search-index.js b/dev/search-index.js index 2114a9efc..f31a1175c 100644 --- a/dev/search-index.js +++ b/dev/search-index.js @@ -106,13 +106,13 @@ var searchIndex = JSON.parse('{\ "uu_basenc":{"doc":"","t":"FF","n":["uu_app","uumain"],"q":[[0,"uu_basenc"]],"d":["",""],"i":[0,0],"f":[[[],1],[2,3]],"c":[],"p":[[3,"Command"],[8,"Args"],[15,"i32"]]},\ "uu_cat":{"doc":"","t":"FF","n":["uu_app","uumain"],"q":[[0,"uu_cat"]],"d":["",""],"i":[0,0],"f":[[[],1],[2,3]],"c":[],"p":[[3,"Command"],[8,"Args"],[15,"i32"]]},\ "uu_chcon":{"doc":"","t":"AFFHHHHHHHHAAAHHHHHHH","n":["options","uu_app","uumain","HELP","RANGE","RECURSIVE","REFERENCE","ROLE","TYPE","USER","VERBOSE","dereference","preserve_root","sym_links","DEREFERENCE","NO_DEREFERENCE","NO_PRESERVE_ROOT","PRESERVE_ROOT","FOLLOW_ARG_DIR_SYM_LINK","FOLLOW_DIR_SYM_LINKS","NO_FOLLOW_SYM_LINKS"],"q":[[0,"uu_chcon"],[3,"uu_chcon::options"],[14,"uu_chcon::options::dereference"],[16,"uu_chcon::options::preserve_root"],[18,"uu_chcon::options::sym_links"]],"d":["","","","","","","","","","","","","","","","","","","","",""],"i":[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],"f":[0,[[],1],[2,3],0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],"c":[],"p":[[3,"Command"],[8,"Args"],[15,"i32"]]},\ -"uu_chgrp":{"doc":"","t":"AFFDIDLLLLLLLLLLLLLFFMMFFLLKLLLLMMLLLLLLLLMFMMMMF","n":["entries","uu_app","uumain","Group","Locate","Passwd","belongs_to","borrow","borrow","borrow_mut","borrow_mut","clone","clone","clone_into","clone_into","fmt","fmt","from","from","get_groups","get_groups_gnu","gid","gid","gid2grp","grp2gid","into","into","locate","locate","locate","locate","locate","name","name","to_owned","to_owned","try_from","try_from","try_into","try_into","type_id","type_id","uid","uid2usr","user_dir","user_info","user_passwd","user_shell","usr2uid"],"q":[[0,"uu_chgrp"],[3,"uu_chgrp::entries"]],"d":["Get password/group file entry","","","","Fetch desired entry.","","This is a wrapper function for libc::getgrouplist.","","","","","","","","","","","Returns the argument unchanged.","Returns the argument unchanged.","From: …","The list of group IDs returned from GNU’s groups and GNU…","AKA passwd.pw_gid","AKA group.gr_gid","","","Calls U::from(self).","Calls U::from(self).","","","","","","AKA passwd.pw_name","AKA group.gr_name","","","","","","","","","AKA passwd.pw_uid","","AKA passwd.pw_dir","AKA passwd.pw_gecos","AKA passwd.pw_passwd","AKA passwd.pw_shell",""],"i":[0,0,0,0,0,0,4,4,8,4,8,4,8,4,8,4,8,4,8,0,0,4,8,0,0,4,8,18,4,4,8,8,4,8,4,8,4,8,4,8,4,8,4,0,4,4,4,4,0],"f":[0,[[],1],[2,3],0,0,0,[4,[[7,[5,6]]]],[[]],[[]],[[]],[[]],[4,4],[8,8],[[]],[[]],[[4,9],[[11,[10]]]],[[8,9],[[11,[10]]]],[[]],[[]],[[],[[11,[[7,[5,6]],12]]]],[[[13,[5]]],[[11,[[7,[5,6]],12]]]],0,0,[5,[[11,[14,12]]]],[15,[[11,[5,12]]]],[[]],[[]],[[],[[11,[16,12]]]],[15,[[11,[4,12]]]],[5,[[11,[4,12]]]],[5,[[11,[8,12]]]],[15,[[11,[8,12]]]],0,0,[[]],[[]],[[],11],[[],11],[[],11],[[],11],[[],17],[[],17],0,[5,[[11,[14,12]]]],0,0,0,0,[15,[[11,[5,12]]]]],"c":[],"p":[[3,"Command"],[8,"Args"],[15,"i32"],[3,"Passwd"],[15,"u32"],[3,"Global"],[3,"Vec"],[3,"Group"],[3,"Formatter"],[3,"Error"],[4,"Result"],[3,"Error"],[4,"Option"],[3,"String"],[15,"str"],[8,"Sized"],[3,"TypeId"],[8,"Locate"]]},\ +"uu_chgrp":{"doc":"","t":"AFFDIDLLLLLLLLLLLLLFFMMFFLLKLLLLMMLLLLLLLLMFMMMMF","n":["entries","uu_app","uumain","Group","Locate","Passwd","belongs_to","borrow","borrow","borrow_mut","borrow_mut","clone","clone","clone_into","clone_into","fmt","fmt","from","from","get_groups","get_groups_gnu","gid","gid","gid2grp","grp2gid","into","into","locate","locate","locate","locate","locate","name","name","to_owned","to_owned","try_from","try_from","try_into","try_into","type_id","type_id","uid","uid2usr","user_dir","user_info","user_passwd","user_shell","usr2uid"],"q":[[0,"uu_chgrp"],[3,"uu_chgrp::entries"]],"d":["Get password/group file entry","","","","Fetch desired entry.","","This is a wrapper function for libc::getgrouplist.","","","","","","","","","","","Returns the argument unchanged.","Returns the argument unchanged.","From: …","The list of group IDs returned from GNU’s groups and GNU…","AKA passwd.pw_gid","AKA group.gr_gid","","","Calls U::from(self).","Calls U::from(self).","","","","","","AKA passwd.pw_name","AKA group.gr_name","","","","","","","","","AKA passwd.pw_uid","","AKA passwd.pw_dir","AKA passwd.pw_gecos","AKA passwd.pw_passwd","AKA passwd.pw_shell",""],"i":[0,0,0,0,0,0,4,4,8,4,8,4,8,4,8,4,8,4,8,0,0,4,8,0,0,4,8,18,4,4,8,8,4,8,4,8,4,8,4,8,4,8,4,0,4,4,4,4,0],"f":[0,[[],1],[2,3],0,0,0,[4,[[7,[5,6]]]],[[]],[[]],[[]],[[]],[4,4],[8,8],[[]],[[]],[[4,9],[[11,[10]]]],[[8,9],[[11,[10]]]],[[]],[[]],[[],[[11,[[7,[5,6]],12]]]],[[[13,[5]]],[[11,[[7,[5,6]],12]]]],0,0,[5,[[11,[14,12]]]],[15,[[11,[5,12]]]],[[]],[[]],[[],[[11,[16,12]]]],[5,[[11,[4,12]]]],[15,[[11,[4,12]]]],[15,[[11,[8,12]]]],[5,[[11,[8,12]]]],0,0,[[]],[[]],[[],11],[[],11],[[],11],[[],11],[[],17],[[],17],0,[5,[[11,[14,12]]]],0,0,0,0,[15,[[11,[5,12]]]]],"c":[],"p":[[3,"Command"],[8,"Args"],[15,"i32"],[3,"Passwd"],[15,"u32"],[3,"Global"],[3,"Vec"],[3,"Group"],[3,"Formatter"],[3,"Error"],[4,"Result"],[3,"Error"],[4,"Option"],[3,"String"],[15,"str"],[8,"Sized"],[3,"TypeId"],[8,"Locate"]]},\ "uu_chmod":{"doc":"","t":"FF","n":["uu_app","uumain"],"q":[[0,"uu_chmod"]],"d":["",""],"i":[0,0],"f":[[[],1],[2,3]],"c":[],"p":[[3,"Command"],[8,"Args"],[15,"i32"]]},\ -"uu_chown":{"doc":"","t":"DIDLLLLLLLLLALLLLMMLLKLLLLMMLLLLLLLLMMMMMFFDIDFFMMFFKMMMFMMMMF","n":["Group","Locate","Passwd","belongs_to","borrow","borrow","borrow_mut","borrow_mut","clone","clone","clone_into","clone_into","entries","fmt","fmt","from","from","gid","gid","into","into","locate","locate","locate","locate","locate","name","name","to_owned","to_owned","try_from","try_from","try_into","try_into","type_id","type_id","uid","user_dir","user_info","user_passwd","user_shell","uu_app","uumain","Group","Locate","Passwd","get_groups","get_groups_gnu","gid","gid","gid2grp","grp2gid","locate","name","name","uid","uid2usr","user_dir","user_info","user_passwd","user_shell","usr2uid"],"q":[[0,"uu_chown"],[43,"uu_chown::entries"]],"d":["","Fetch desired entry.","","This is a wrapper function for libc::getgrouplist.","","","","","","","","","Get password/group file entry","","","Returns the argument unchanged.","Returns the argument unchanged.","AKA passwd.pw_gid","AKA group.gr_gid","Calls U::from(self).","Calls U::from(self).","","","","","","AKA passwd.pw_name","AKA group.gr_name","","","","","","","","","AKA passwd.pw_uid","AKA passwd.pw_dir","AKA passwd.pw_gecos","AKA passwd.pw_passwd","AKA passwd.pw_shell","","","","Fetch desired entry.","","From: …","The list of group IDs returned from GNU’s groups and GNU…","AKA passwd.pw_gid","AKA group.gr_gid","","","","AKA passwd.pw_name","AKA group.gr_name","AKA passwd.pw_uid","","AKA passwd.pw_dir","AKA passwd.pw_gecos","AKA passwd.pw_passwd","AKA passwd.pw_shell",""],"i":[0,0,0,1,1,5,1,5,1,5,1,5,0,1,5,1,5,1,5,1,5,18,1,1,5,5,1,5,1,5,1,5,1,5,1,5,1,1,1,1,1,0,0,0,0,0,0,0,1,5,0,0,18,1,5,1,0,1,1,1,1,0],"f":[0,0,0,[1,[[4,[2,3]]]],[[]],[[]],[[]],[[]],[1,1],[5,5],[[]],[[]],0,[[1,6],[[8,[7]]]],[[5,6],[[8,[7]]]],[[]],[[]],0,0,[[]],[[]],[[],[[8,[9,10]]]],[11,[[8,[1,10]]]],[2,[[8,[1,10]]]],[2,[[8,[5,10]]]],[11,[[8,[5,10]]]],0,0,[[]],[[]],[[],8],[[],8],[[],8],[[],8],[[],12],[[],12],0,0,0,0,0,[[],13],[14,15],0,0,0,[[],[[8,[[4,[2,3]],10]]]],[[[16,[2]]],[[8,[[4,[2,3]],10]]]],0,0,[2,[[8,[17,10]]]],[11,[[8,[2,10]]]],[[],[[8,[9,10]]]],0,0,0,[2,[[8,[17,10]]]],0,0,0,0,[11,[[8,[2,10]]]]],"c":[],"p":[[3,"Passwd"],[15,"u32"],[3,"Global"],[3,"Vec"],[3,"Group"],[3,"Formatter"],[3,"Error"],[4,"Result"],[8,"Sized"],[3,"Error"],[15,"str"],[3,"TypeId"],[3,"Command"],[8,"Args"],[15,"i32"],[4,"Option"],[3,"String"],[8,"Locate"]]},\ +"uu_chown":{"doc":"","t":"DIDLLLLLLLLLALLLLMMLLKLLLLMMLLLLLLLLMMMMMFFDIDFFMMFFKMMMFMMMMF","n":["Group","Locate","Passwd","belongs_to","borrow","borrow","borrow_mut","borrow_mut","clone","clone","clone_into","clone_into","entries","fmt","fmt","from","from","gid","gid","into","into","locate","locate","locate","locate","locate","name","name","to_owned","to_owned","try_from","try_from","try_into","try_into","type_id","type_id","uid","user_dir","user_info","user_passwd","user_shell","uu_app","uumain","Group","Locate","Passwd","get_groups","get_groups_gnu","gid","gid","gid2grp","grp2gid","locate","name","name","uid","uid2usr","user_dir","user_info","user_passwd","user_shell","usr2uid"],"q":[[0,"uu_chown"],[43,"uu_chown::entries"]],"d":["","Fetch desired entry.","","This is a wrapper function for libc::getgrouplist.","","","","","","","","","Get password/group file entry","","","Returns the argument unchanged.","Returns the argument unchanged.","AKA passwd.pw_gid","AKA group.gr_gid","Calls U::from(self).","Calls U::from(self).","","","","","","AKA passwd.pw_name","AKA group.gr_name","","","","","","","","","AKA passwd.pw_uid","AKA passwd.pw_dir","AKA passwd.pw_gecos","AKA passwd.pw_passwd","AKA passwd.pw_shell","","","","Fetch desired entry.","","From: …","The list of group IDs returned from GNU’s groups and GNU…","AKA passwd.pw_gid","AKA group.gr_gid","","","","AKA passwd.pw_name","AKA group.gr_name","AKA passwd.pw_uid","","AKA passwd.pw_dir","AKA passwd.pw_gecos","AKA passwd.pw_passwd","AKA passwd.pw_shell",""],"i":[0,0,0,1,1,5,1,5,1,5,1,5,0,1,5,1,5,1,5,1,5,18,1,1,5,5,1,5,1,5,1,5,1,5,1,5,1,1,1,1,1,0,0,0,0,0,0,0,1,5,0,0,18,1,5,1,0,1,1,1,1,0],"f":[0,0,0,[1,[[4,[2,3]]]],[[]],[[]],[[]],[[]],[1,1],[5,5],[[]],[[]],0,[[1,6],[[8,[7]]]],[[5,6],[[8,[7]]]],[[]],[[]],0,0,[[]],[[]],[[],[[8,[9,10]]]],[2,[[8,[1,10]]]],[11,[[8,[1,10]]]],[2,[[8,[5,10]]]],[11,[[8,[5,10]]]],0,0,[[]],[[]],[[],8],[[],8],[[],8],[[],8],[[],12],[[],12],0,0,0,0,0,[[],13],[14,15],0,0,0,[[],[[8,[[4,[2,3]],10]]]],[[[16,[2]]],[[8,[[4,[2,3]],10]]]],0,0,[2,[[8,[17,10]]]],[11,[[8,[2,10]]]],[[],[[8,[9,10]]]],0,0,0,[2,[[8,[17,10]]]],0,0,0,0,[11,[[8,[2,10]]]]],"c":[],"p":[[3,"Passwd"],[15,"u32"],[3,"Global"],[3,"Vec"],[3,"Group"],[3,"Formatter"],[3,"Error"],[4,"Result"],[8,"Sized"],[3,"Error"],[15,"str"],[3,"TypeId"],[3,"Command"],[8,"Args"],[15,"i32"],[4,"Option"],[3,"String"],[8,"Locate"]]},\ "uu_chroot":{"doc":"","t":"FF","n":["uu_app","uumain"],"q":[[0,"uu_chroot"]],"d":["",""],"i":[0,0],"f":[[[],1],[2,3]],"c":[],"p":[[3,"Command"],[8,"Args"],[15,"i32"]]},\ "uu_cksum":{"doc":"","t":"FF","n":["uu_app","uumain"],"q":[[0,"uu_cksum"]],"d":["",""],"i":[0,0],"f":[[[],1],[2,3]],"c":[],"p":[[3,"Command"],[8,"Args"],[15,"i32"]]},\ "uu_comm":{"doc":"","t":"FF","n":["uu_app","uumain"],"q":[[0,"uu_comm"]],"d":["",""],"i":[0,0],"f":[[[],1],[2,3]],"c":[],"p":[[3,"Command"],[8,"Args"],[15,"i32"]]},\ -"uu_cp":{"doc":"","t":"NNNDNNNNENEGNENNNNNNNNNNNNNNNDEEENNGGENNNGGENNNLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLFLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLFFFM","n":["Always","Always","AttrOnly","Attributes","Auto","Auto","Backup","Clobber","ClobberMode","Copy","CopyMode","CopyResult","Directory","Error","Error","File","Force","Interactive","InvalidArgument","IoErr","IoErrContext","Link","Never","Never","No","NoClobber","NotADirectory","NotAllFilesCopied","NotImplemented","Options","OverwriteMode","Preserve","ReflinkMode","RemoveDestination","Skipped","Source","SourceSlice","SparseMode","Standard","StripPrefixError","SymLink","Target","TargetSlice","TargetType","Update","WalkDirErr","Yes","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","clone","clone","clone","clone","clone_into","clone_into","clone_into","clone_into","code","eq","eq","eq","eq","eq","fmt","fmt","fmt","fmt","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","into","into","into","into","into","into","into","into","into","into","localize_to_target","provide","source","to_owned","to_owned","to_owned","to_owned","to_string","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","uu_app","uumain","verify_target_type","required"],"q":[[0,"uu_cp"],[153,"uu_cp::Preserve"]],"d":["","","","","","","Invalid arguments to backup","Default Always overwrite existing files","Specifies whether when overwrite files","","","","","","General copy error","","","Prompt before overwriting a file","Result of a skipped file","Simple io::Error wrapper","Wrapper for io::Error with path context","","","","","Never overwrite a file","","Represents the state when a non-fatal error has occurred …","All standard options are included as an an implementation …","Re-usable, extensible copy options","Specifies whether when overwrite files","","Possible arguments for --reflink.","","Result of a skipped file Currently happens when “no” …","","","Possible arguments for --sparse.","","Simple std::path::StripPrefixError wrapper","","","","Specifies the expected file type of copy target","","Simple walkdir::Error wrapper","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","","","","","Returns the argument unchanged.","","","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Remove the root prefix from source and prefix it with …","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","Generate an error message if target is not the correct …",""],"i":[3,4,29,0,3,4,5,2,0,29,0,0,28,0,5,28,1,2,5,5,5,29,3,4,8,2,5,5,5,0,0,0,0,1,5,0,0,0,1,5,29,0,0,0,29,5,8,28,29,30,5,1,2,3,4,11,8,28,29,30,5,1,2,3,4,11,8,1,2,3,4,1,2,3,4,5,1,2,3,4,8,5,5,11,8,28,29,30,5,5,5,5,5,5,5,5,1,2,3,4,11,8,28,29,30,5,1,2,3,4,11,8,0,5,5,1,2,3,4,5,28,29,30,5,1,2,3,4,11,8,28,29,30,5,1,2,3,4,11,8,28,29,30,5,1,2,3,4,11,8,0,0,0,31],"f":[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[1,1],[2,2],[3,3],[4,4],[[]],[[]],[[]],[[]],[5,6],[[1,1],7],[[2,2],7],[[3,3],7],[[4,4],7],[[8,8],7],[[5,9],10],[[5,9],10],[[11,9],10],[[8,9],10],[[]],[[]],[[]],[12,5],[[[14,[13,12]]],5],[13,5],[[[14,[15,12]]],5],[[]],[16,5],[17,5],[15,5],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[18,18,18],[[20,[19]]]],[21],[5,[[23,[22]]]],[[]],[[]],[[]],[[]],[[],15],[[],24],[[],24],[[],24],[[],24],[[],24],[[],24],[[],24],[[],24],[[],24],[[],24],[[],24],[[],24],[[],24],[[],24],[[],24],[[],24],[[],24],[[],24],[[],24],[[],24],[[],25],[[],25],[[],25],[[],25],[[],25],[[],25],[[],25],[[],25],[[],25],[[],25],[[],26],[27,6],[[18,28],20],0],"c":[],"p":[[4,"ClobberMode"],[4,"OverwriteMode"],[4,"ReflinkMode"],[4,"SparseMode"],[4,"Error"],[15,"i32"],[15,"bool"],[4,"Preserve"],[3,"Formatter"],[6,"Result"],[3,"Attributes"],[3,"Error"],[15,"str"],[3,"Context"],[3,"String"],[3,"Error"],[3,"StripPrefixError"],[3,"Path"],[3,"PathBuf"],[6,"CopyResult"],[3,"Demand"],[8,"Error"],[4,"Option"],[4,"Result"],[3,"TypeId"],[3,"Command"],[8,"Args"],[4,"TargetType"],[4,"CopyMode"],[3,"Options"],[13,"Yes"]]},\ +"uu_cp":{"doc":"","t":"NNNDNNNNENEGNENNNNNNNNNNNNNNNDEEENNGGENNNGGENNNLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLFLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLFFFM","n":["Always","Always","AttrOnly","Attributes","Auto","Auto","Backup","Clobber","ClobberMode","Copy","CopyMode","CopyResult","Directory","Error","Error","File","Force","Interactive","InvalidArgument","IoErr","IoErrContext","Link","Never","Never","No","NoClobber","NotADirectory","NotAllFilesCopied","NotImplemented","Options","OverwriteMode","Preserve","ReflinkMode","RemoveDestination","Skipped","Source","SourceSlice","SparseMode","Standard","StripPrefixError","SymLink","Target","TargetSlice","TargetType","Update","WalkDirErr","Yes","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","clone","clone","clone","clone","clone_into","clone_into","clone_into","clone_into","code","eq","eq","eq","eq","eq","fmt","fmt","fmt","fmt","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","into","into","into","into","into","into","into","into","into","into","localize_to_target","provide","source","to_owned","to_owned","to_owned","to_owned","to_string","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","uu_app","uumain","verify_target_type","required"],"q":[[0,"uu_cp"],[153,"uu_cp::Preserve"]],"d":["","","","","","","Invalid arguments to backup","Default Always overwrite existing files","Specifies whether when overwrite files","","","","","","General copy error","","","Prompt before overwriting a file","Result of a skipped file","Simple io::Error wrapper","Wrapper for io::Error with path context","","","","","Never overwrite a file","","Represents the state when a non-fatal error has occurred …","All standard options are included as an an implementation …","Re-usable, extensible copy options","Specifies whether when overwrite files","","Possible arguments for --reflink.","","Result of a skipped file Currently happens when “no” …","","","Possible arguments for --sparse.","","Simple std::path::StripPrefixError wrapper","","","","Specifies the expected file type of copy target","","Simple walkdir::Error wrapper","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","","","","Returns the argument unchanged.","","","","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Remove the root prefix from source and prefix it with …","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","Generate an error message if target is not the correct …",""],"i":[3,4,29,0,3,4,5,2,0,29,0,0,28,0,5,28,1,2,5,5,5,29,3,4,8,2,5,5,5,0,0,0,0,1,5,0,0,0,1,5,29,0,0,0,29,5,8,28,29,30,5,1,2,3,4,11,8,28,29,30,5,1,2,3,4,11,8,1,2,3,4,1,2,3,4,5,1,2,3,4,8,5,5,11,8,28,29,30,5,5,5,5,5,5,5,5,1,2,3,4,11,8,28,29,30,5,1,2,3,4,11,8,0,5,5,1,2,3,4,5,28,29,30,5,1,2,3,4,11,8,28,29,30,5,1,2,3,4,11,8,28,29,30,5,1,2,3,4,11,8,0,0,0,31],"f":[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[1,1],[2,2],[3,3],[4,4],[[]],[[]],[[]],[[]],[5,6],[[1,1],7],[[2,2],7],[[3,3],7],[[4,4],7],[[8,8],7],[[5,9],10],[[5,9],10],[[11,9],10],[[8,9],10],[[]],[[]],[[]],[12,5],[13,5],[14,5],[[]],[15,5],[16,5],[[[17,[16,14]]],5],[[[17,[15,14]]],5],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[18,18,18],[[20,[19]]]],[21],[5,[[23,[22]]]],[[]],[[]],[[]],[[]],[[],15],[[],24],[[],24],[[],24],[[],24],[[],24],[[],24],[[],24],[[],24],[[],24],[[],24],[[],24],[[],24],[[],24],[[],24],[[],24],[[],24],[[],24],[[],24],[[],24],[[],24],[[],25],[[],25],[[],25],[[],25],[[],25],[[],25],[[],25],[[],25],[[],25],[[],25],[[],26],[27,6],[[18,28],20],0],"c":[],"p":[[4,"ClobberMode"],[4,"OverwriteMode"],[4,"ReflinkMode"],[4,"SparseMode"],[4,"Error"],[15,"i32"],[15,"bool"],[4,"Preserve"],[3,"Formatter"],[6,"Result"],[3,"Attributes"],[3,"Error"],[3,"StripPrefixError"],[3,"Error"],[3,"String"],[15,"str"],[3,"Context"],[3,"Path"],[3,"PathBuf"],[6,"CopyResult"],[3,"Demand"],[8,"Error"],[4,"Option"],[4,"Result"],[3,"TypeId"],[3,"Command"],[8,"Args"],[4,"TargetType"],[4,"CopyMode"],[3,"Options"],[13,"Yes"]]},\ "uu_csplit":{"doc":"","t":"DLLFLLLLLFF","n":["CsplitOptions","borrow","borrow_mut","csplit","from","into","try_from","try_into","type_id","uu_app","uumain"],"q":[[0,"uu_csplit"]],"d":["Command line options for csplit.","","","Splits a file into severals according to the command line …","Returns the argument unchanged.","Calls U::from(self).","","","","",""],"i":[0,1,1,0,1,1,1,1,1,0,0],"f":[0,[[]],[[]],[[1,[2,[0]],3],[[4,[0]]]],[[]],[[]],[[],4],[[],4],[[],5],[[],6],[7,8]],"c":[],"p":[[3,"CsplitOptions"],[3,"Vec"],[8,"BufRead"],[4,"Result"],[3,"TypeId"],[3,"Command"],[8,"Args"],[15,"i32"]]},\ "uu_cut":{"doc":"","t":"FF","n":["uu_app","uumain"],"q":[[0,"uu_cut"]],"d":["",""],"i":[0,0],"f":[[[],1],[2,3]],"c":[],"p":[[3,"Command"],[8,"Args"],[15,"i32"]]},\ "uu_date":{"doc":"","t":"FF","n":["uu_app","uumain"],"q":[[0,"uu_date"]],"d":["",""],"i":[0,0],"f":[[[],1],[2,3]],"c":[],"p":[[3,"Command"],[8,"Args"],[15,"i32"]]},\ @@ -202,7 +202,7 @@ var searchIndex = JSON.parse('{\ "uu_who":{"doc":"","t":"FF","n":["uu_app","uumain"],"q":[[0,"uu_who"]],"d":["",""],"i":[0,0],"f":[[[],1],[2,3]],"c":[],"p":[[3,"Command"],[8,"Args"],[15,"i32"]]},\ "uu_whoami":{"doc":"","t":"FF","n":["uu_app","uumain"],"q":[[0,"uu_whoami"]],"d":["",""],"i":[0,0],"f":[[[],1],[2,3]],"c":[],"p":[[3,"Command"],[8,"Args"],[15,"i32"]]},\ "uu_yes":{"doc":"","t":"FFF","n":["exec","uu_app","uumain"],"q":[[0,"uu_yes"]],"d":["","",""],"i":[0,0,0],"f":[[[],1],[[],2],[3,4]],"c":[],"p":[[6,"Result"],[3,"Command"],[8,"Args"],[15,"i32"]]},\ -"uucore":{"doc":"","t":"IFAOLLOOAAAAFFAAFOOOOAXAAAAAAAAAAOAAFAFOOOOAAOAFAANRHENENNNNNALLLLLLLFFLLLLLLLFLLLLLLLLLLLLHHHFFFIDLLLLLLLLLLLLLLLFFKLLLLLNNNNNNNDNEGNEENNNLLLLLLLLLLFLFLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLFFDIDLLLLLLLLLLLLLFFMMFFLLKLLLLMMLLLLLLLLMFMMMMFDDIIIDGDDLLLLLLLLLLLLLLLLMMLLLLLLLLLLLLLLLLLFLLLLLKMMLLLLLLLLLFFLLLLLLLLLLLLLLLLLLLLOLLLKNDNNENNNEFFLLLLLLFLLLLFFFLLLLLLLLLLLOLFLLLLFFFLFFLLLLLLLLLLLIIDDDFKLMMMKKLMMLLLLLLLLLLLLMMMLMMMMMMMMMMMMMMMMMMMMMMLLLKLKLLLLKLMKLLLLLKLMMMKLLKFFFFMFDFLLLKLKLLLLLLLLLLDLLLLLFLLLLFFFFFFFFFFFNNEDNMMLLLLMLMLLLLLLLLLFLLLLLLLLLLLFNNNDNDNENNNENNNDELLLLLLLLLLLLFLLLLMMMMMALLLLMMMLLLLLLLLMLLLLLLMAMMMMLLMLLLLLLLLLLLLLLLLLLMFDIDFFMMFFKMMMFMMMMFRRRRRRRAAAARRRRRRRRRRRGGLFFFFIFFFFKKKNNNNEENNLLLLLLFLLLLLLLLLLLMMMMMDLLLFFLLLLLMLMLLLLDLLMLLLLLLLLHHFFFFFDDDDIDDDDDDDDDDDDDDDLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLFLLLLLLLLLLLLLLLLLLLLLKLLLLLLLLLLLLLLLLLLKLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLKLLLLLLLLLLLLLLLLLLLKLLLLLLLLLLLLLLLLLLLLKLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLNNNEALLLLFLLLLLLLLHHFFRRRHRRRRRRRRRRRDDLLLLLLFLLLFLLLLLLLLLLLLFLLLLLLLLLFF","n":["Args","args_os","backup_control","bin","collect_ignore","collect_lossy","crash","crash_if_err","display","encoding","entries","error","execution_phrase","format_usage","fs","fsext","get_utility_is_second_arg","has","help_about","help_section","help_usage","lines","main","memo","mode","os","panic","parse_glob","parse_size","parse_time","perms","pipes","process","prompt_yes","quoting_style","ranges","read_yes","ringbuffer","set_utility_is_second_arg","show","show_error","show_if_err","show_warning","signals","sum","uio_error","update_control","util_name","utmpx","version_cmp","AmbiguousArgument","BACKUP_CONTROL_LONG_HELP","BACKUP_CONTROL_VALUES","BackupError","BackupImpossible","BackupMode","ExistingBackup","InvalidArgument","NoBackup","NumberedBackup","SimpleBackup","arguments","borrow","borrow","borrow_mut","borrow_mut","clone","clone_into","code","determine_backup_mode","determine_backup_suffix","eq","eq","fmt","fmt","fmt","from","from","get_backup_path","into","into","provide","to_owned","to_string","try_from","try_from","try_into","try_into","type_id","type_id","usage","OPT_BACKUP","OPT_BACKUP_NO_ARG","OPT_SUFFIX","backup","backup_no_args","suffix","Quotable","Quoted","borrow","borrow_mut","clone","clone_into","external","fmt","fmt","force","from","from","into","maybe_quote","maybe_quote","native","native_raw","print_verbatim","println_verbatim","quote","to_owned","to_string","try_from","try_into","type_id","Base16","Base2Lsbf","Base2Msbf","Base32","Base32Hex","Base64","Base64Url","Data","Decode","DecodeError","DecodeResult","DecodeZ85","EncodeError","Format","Io","Z85","Z85InputLenNotMultipleOf4","borrow","borrow","borrow","borrow","borrow_mut","borrow_mut","borrow_mut","borrow_mut","clone","clone_into","decode","decode","encode","encode","fmt","fmt","from","from","from","from","from","from","from","ignore_garbage","into","into","into","into","line_wrap","new","provide","source","to_owned","to_string","try_from","try_from","try_from","try_from","try_into","try_into","try_into","try_into","type_id","type_id","type_id","type_id","wrap_print","wrap_write","Group","Locate","Passwd","belongs_to","borrow","borrow","borrow_mut","borrow_mut","clone","clone","clone_into","clone_into","fmt","fmt","from","from","get_groups","get_groups_gnu","gid","gid","gid2grp","grp2gid","into","into","locate","locate","locate","locate","locate","name","name","to_owned","to_owned","try_from","try_from","try_into","try_into","type_id","type_id","uid","uid2usr","user_dir","user_info","user_passwd","user_shell","usr2uid","ClapErrorWrapper","ExitCode","FromIo","UClapError","UError","UIoError","UResult","USimpleError","UUsageError","borrow","borrow","borrow","borrow","borrow","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","code","code","code","code","code","code","code","code","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","from","from","from","from","from","from","from","get_exit_code","into","into","into","into","into","map_err_context","message","message","new","new","new","new","provide","provide","provide","provide","provide","set_exit_code","strip_errno","to_string","to_string","to_string","to_string","to_string","try_from","try_from","try_from","try_from","try_from","try_into","try_into","try_into","try_into","try_into","type_id","type_id","type_id","type_id","type_id","uio_error","usage","usage","usage","with_exit_code","Existing","FileInformation","Logical","Missing","MissingHandling","None","Normal","Physical","ResolveMode","are_hardlinks_or_one_way_symlink_to_same_file","are_hardlinks_to_same_file","borrow","borrow","borrow","borrow_mut","borrow_mut","borrow_mut","canonicalize","clone","clone","clone_into","clone_into","dir_strip_dot_for_creation","display_permissions","display_permissions_unix","eq","eq","eq","file_size","fmt","fmt","from","from","from","from_file","from_path","has","hash","infos_refer_to_same_file","inode","into","into","into","is_symlink_loop","make_path_relative_to","normalize_path","number_of_links","paths_refer_to_same_file","resolve_relative_path","to_owned","to_owned","try_from","try_from","try_from","try_into","try_into","try_into","type_id","type_id","type_id","BirthTime","FsMeta","FsUsage","MountInfo","StatFs","StatFs","avail_blocks","avail_blocks","bavail","bavail_top_bit_set","bfree","birth","block_size","block_size","blocks","blocksize","borrow","borrow","borrow","borrow_mut","borrow_mut","borrow_mut","clone","clone","clone","clone_into","clone_into","clone_into","dev_id","dev_name","dummy","eq","f_bavail","f_bavail","f_bfree","f_bfree","f_blocks","f_blocks","f_bsize","f_bsize","f_ffree","f_ffree","f_files","f_files","f_frsize","f_frsize","f_fsid","f_fsid","f_namelen","f_namelen","f_type","f_type","ffree","files","fmt","fmt","fmt","free_blocks","free_blocks","free_file_nodes","free_file_nodes","from","from","from","fs_type","fs_type","fs_type","fsid","fsid","hash","into","into","into","io_size","io_size","mount_dir","mount_option","mount_root","namelen","namelen","new","pretty_birth","pretty_filetype","pretty_fstype","pretty_time","read_fs_list","remote","statfs","statfs_fn","statfs_fn","to_owned","to_owned","to_owned","total_blocks","total_blocks","total_file_nodes","total_file_nodes","try_from","try_from","try_from","try_into","try_into","try_into","type_id","type_id","type_id","Lines","borrow","borrow_mut","from","into","into_iter","lines","next","try_from","try_into","type_id","printf","sprintf","get_umask","parse_mode","parse_numeric","parse_symbolic","strip_minus_from_mode","is_wsl_1","is_wsl_2","mute_sigpipe_panic","from_str","InvalidSuffix","ParseFailure","ParseSizeError","Parser","SizeTooBig","allow_list","b_byte_count","borrow","borrow","borrow_mut","borrow_mut","capital_b_bytes","default","default_unit","description","eq","fmt","fmt","from","from","into","into","parse","parse_size","provide","to_string","try_from","try_from","try_into","try_into","type_id","type_id","with_allow_list","with_b_byte_count","with_default_unit","from_str","All","All","Changes","ChownExecutor","First","GidUidOwnerFilter","Group","IfFrom","None","Normal","Silent","TraverseSymlinks","User","UserGroup","Verbose","Verbosity","VerbosityLevel","borrow","borrow","borrow","borrow","borrow","borrow","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","chown_base","clone","clone","clone_into","clone_into","dereference","dest_gid","dest_gid","dest_uid","dest_uid","entries","eq","eq","eq","exec","files","filter","filter","fmt","fmt","from","from","from","from","from","from","groups_only","into","into","into","into","into","into","level","options","preserve_root","raw_owner","raw_owner","recursive","to_owned","to_owned","traverse_symlinks","try_from","try_from","try_from","try_from","try_from","try_from","try_into","try_into","try_into","try_into","try_into","try_into","type_id","type_id","type_id","type_id","type_id","type_id","verbosity","wrap_chown","Group","Locate","Passwd","get_groups","get_groups_gnu","gid","gid","gid2grp","grp2gid","locate","name","name","uid","uid2usr","user_dir","user_info","user_passwd","user_shell","usr2uid","ARG_FILES","ARG_GROUP","ARG_OWNER","FROM","HELP","RECURSIVE","REFERENCE","dereference","preserve_root","traverse","verbosity","DEREFERENCE","NO_DEREFERENCE","NO_PRESERVE","PRESERVE","EVERY","NO_TRAVERSE","TRAVERSE","CHANGES","QUIET","SILENT","VERBOSE","Error","Result","map_err_context","pipe","splice","splice_exact","vmsplice","ChildExt","getegid","geteuid","getgid","getuid","send_signal","send_signal_group","wait_or_timeout","C","Double","Literal","None","Quotes","QuotingStyle","Shell","Single","borrow","borrow","borrow_mut","borrow_mut","clone","clone_into","escape_name","from","from","into","into","to_owned","try_from","try_from","try_into","try_into","type_id","type_id","always_quote","escape","quotes","show_control","show_control","Range","borrow","borrow_mut","cmp","complement","contain","eq","fmt","from","from_list","from_str","high","into","low","partial_cmp","try_from","try_into","type_id","RingBuffer","borrow","borrow_mut","data","from","from_iter","into","new","push_back","try_from","try_into","type_id","ALL_SIGNALS","DEFAULT_SIGNAL","enable_pipe_errors","ignore_interrupts","is_signal","signal_by_name_or_value","signal_name_by_value","BSD","Blake2b","Blake3","CRC","Digest","DigestWriter","Md5","SYSV","Sha1","Sha224","Sha256","Sha384","Sha3_224","Sha3_256","Sha3_384","Sha3_512","Sha512","Shake128","Shake256","Sm3","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","div_ceil","finalize","flush","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","hash_finalize","hash_finalize","hash_finalize","hash_finalize","hash_finalize","hash_finalize","hash_finalize","hash_finalize","hash_finalize","hash_finalize","hash_finalize","hash_finalize","hash_finalize","hash_finalize","hash_finalize","hash_finalize","hash_finalize","hash_finalize","hash_finalize","hash_update","hash_update","hash_update","hash_update","hash_update","hash_update","hash_update","hash_update","hash_update","hash_update","hash_update","hash_update","hash_update","hash_update","hash_update","hash_update","hash_update","hash_update","hash_update","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","new","new","new","new","new","new","new","new","new","new","new","new","new","new","new","new","new","new","new","new","output_bits","output_bits","output_bits","output_bits","output_bits","output_bits","output_bits","output_bits","output_bits","output_bits","output_bits","output_bits","output_bits","output_bits","output_bits","output_bits","output_bits","output_bits","output_bits","output_bytes","output_bytes","reset","reset","reset","reset","reset","reset","reset","reset","reset","reset","reset","reset","reset","reset","reset","reset","reset","reset","reset","result_str","result_str","result_str","result_str","result_str","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","with_output_bytes","write","ReplaceAll","ReplaceIfOlder","ReplaceNone","UpdateMode","arguments","borrow","borrow_mut","clone","clone_into","determine_update_mode","eq","fmt","from","into","to_owned","try_from","try_into","type_id","OPT_UPDATE","OPT_UPDATE_NO_ARG","update","update_no_args","ACCOUNTING","BOOT_TIME","DEAD_PROCESS","DEFAULT_FILE","EMPTY","INIT_PROCESS","LOGIN_PROCESS","NEW_TIME","OLD_TIME","RUN_LVL","USER_PROCESS","UT_HOSTSIZE","UT_IDSIZE","UT_LINESIZE","UT_NAMESIZE","Utmpx","UtmpxIter","borrow","borrow","borrow_mut","borrow_mut","canon_host","drop","endutxent","exit_status","from","from","getutxent","host","into","into","into_inner","into_iter","is_user_process","iter_all_records","iter_all_records_from","login_time","next","pid","record_type","setutxent","terminal_suffix","try_from","try_from","try_into","try_into","tty_device","type_id","type_id","user","utmpxname","version_cmp"],"q":[[0,"uucore"],[50,"uucore::backup_control"],[91,"uucore::backup_control::arguments"],[97,"uucore::display"],[122,"uucore::encoding"],[187,"uucore::entries"],[233,"uucore::error"],[322,"uucore::fs"],[382,"uucore::fsext"],[488,"uucore::lines"],[499,"uucore::memo"],[501,"uucore::mode"],[506,"uucore::os"],[508,"uucore::panic"],[509,"uucore::parse_glob"],[510,"uucore::parse_size"],[545,"uucore::parse_time"],[546,"uucore::perms"],[637,"uucore::perms::entries"],[656,"uucore::perms::options"],[667,"uucore::perms::options::dereference"],[669,"uucore::perms::options::preserve_root"],[671,"uucore::perms::options::traverse"],[674,"uucore::perms::options::verbosity"],[678,"uucore::pipes"],[685,"uucore::process"],[693,"uucore::quoting_style"],[719,"uucore::quoting_style::QuotingStyle"],[724,"uucore::ranges"],[742,"uucore::ringbuffer"],[754,"uucore::signals"],[761,"uucore::sum"],[1022,"uucore::update_control"],[1040,"uucore::update_control::arguments"],[1044,"uucore::utmpx"],[1095,"uucore::version_cmp"]],"d":["","","Implement GNU-style backup functionality.","","Collects the iterator into a Vec<String>, removing any …","Collects the iterator into a Vec<String>, lossily …","Display an error and std::process::exit","Unwrap a std::result::Result, crashing instead of …","","","Get password/group file entry","All utils return exit with an exit code. Usually, the …","Derive the complete execution phrase for “usage”.","Generate the usage string for clap.","Set of functions to manage files and symlinks","Set of functions to manage file systems","","","Get the about text from the help file.","Reads a section from a file of the util as a str literal.","Get the usage from the help file.","Iterate over lines, including the line ending character(s).","","Main entry point for our implementation of printf.","Set of functions to parse modes","","Custom panic hooks that allow silencing certain types of …","Parsing a glob Pattern from a string.","","Parsing a duration from a string.","Common functions to manage permissions","","Set of functions to manage IDs","Prompt the user with a formatted string and returns true …","","","Read a line from stdin and check whether the first …","A fixed-size ring buffer.","","Display a crate::error::UError and set global exit code.","Show an error to stderr in a similar style to GNU …","Display an error and set global exit code in error case.","Print a warning message to stderr.","","Implementations of digest functions, like md5 and sha1.","Shorthand to construct UIoError-instances.","Implement GNU-style update functionality.","Derive the utility name.","Aims to provide platform-independent methods to obtain …","","An ambiguous argument (e.g. ‘n’) was given as backup …","","","Backup error types.","Currently unused","Available backup modes.","Argument ‘existing’, ‘nil’","An invalid argument (e.g. ‘foo’) was given as backup …","Argument ‘none’, ‘off’","Argument ‘numbered’, ‘t’","Argument ‘simple’, ‘never’","Arguments for backup-related functionality.","","","","","","","","Determine the “mode” for the backup operation to …","Obtain the suffix to use for a backup.","","","","","","Returns the argument unchanged.","Returns the argument unchanged.","","Calls U::from(self).","Calls U::from(self).","","","","","","","","","","","","","","‘–backup’ argument","‘-b’ argument","‘-S, –suffix’ argument","An extension trait to apply quoting to strings.","A wrapper around string types for displaying with quoting …","","","","","When quoting for PowerShell, toggle whether to quote for …","","","Toggle forced quoting. If true, quotes are added even if …","","Returns the argument unchanged.","Calls U::from(self).","Like quote(), but don’t actually add quotes unless …","Like quote(), but don’t actually add quotes unless …","Quote a string with the default style for the platform.","Quote an OsStr with the default style for the platform.","Like println_verbatim, without the trailing newline.","Print a path (or OsStr-like object) directly to stdout, …","Returns an object that implements Display for printing …","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","Returns the argument unchanged.","Returns the argument unchanged.","","","","Returns the argument unchanged.","Returns the argument unchanged.","","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","","","","","","","","","","","","","","","","","","","","","","Fetch desired entry.","","This is a wrapper function for libc::getgrouplist.","","","","","","","","","","","Returns the argument unchanged.","Returns the argument unchanged.","From: …","The list of group IDs returned from GNU’s groups and GNU…","AKA passwd.pw_gid","AKA group.gr_gid","","","Calls U::from(self).","Calls U::from(self).","","","","","","AKA passwd.pw_name","AKA group.gr_name","","","","","","","","","AKA passwd.pw_uid","","AKA passwd.pw_dir","AKA passwd.pw_gecos","AKA passwd.pw_passwd","AKA passwd.pw_shell","","A wrapper for clap::Error that implements UError","A special error type that does not print any message when …","Enables the conversion from std::io::Error to UError and …","Extension trait for clap::Error to adjust the exit code.","Custom errors defined by the utils and uucore.","Wrapper type around std::io::Error.","Result type that should be returned by all utils.","A simple error type with an exit code and a message that …","","","","","","","","","","","","Error code of a custom error.","Error code of a custom error.","","","","","","","","","","","","","","","","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","","","Returns the argument unchanged.","Returns the argument unchanged.","Get the last exit code set with set_exit_code. The default …","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","","","","","","","","","","","","","Set the exit code for the program if uumain returns Ok(()).","Strip the trailing “ (os error XX)“ from io error …","","","","","","","","","","","","","","","","","","","","","Shorthand to construct UIoError-instances.","Print usage help to a custom error.","Print usage help to a custom error.","","","Resolve symbolic links, ignoring errors on the final …","Information to uniquely identify a file","Resolve ‘..’ elements before symlinks","Resolve symbolic links, ignoring errors on the non-final …","Controls how symbolic links should be handled when …","Do not resolve any symbolic links.","Return an error if any part of the path is missing.","Resolve symlinks as encountered when processing the path","Controls when symbolic links are resolved","Checks if either two paths are hard links to the same file …","Checks if two paths are hard links to the same file.","","","","","","","Return the canonical, absolute form of a path.","","","","","For some programs like install or mkdir, dir/. can be …","Display the permissions of a file On non unix like system, …","Display the permissions of a file on a unix like system","","","","","","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Get information from a currently open file","Get information for a given path.","","","Checks if p1 and p2 are the same file information. If …","","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Checks if there is a symlink loop in the given path.","Converts absolute path to be relative to absolute to path.","Normalize a path by removing relative information For …","","Checks if p1 and p2 are the same file. If error happens …","resolve a relative path","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","","","","","","","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","","","","","","","","","","","","","Read file system list.","","","","","","","","","","","","","","","","","","","","","An iterator over the lines of an instance of BufRead.","","","Returns the argument unchanged.","Calls U::from(self).","","Returns an iterator over the lines, including line ending …","","","","","Write a formatted string to stdout.","Create a new formatted string.","","","","","","Test if the program is running under WSL","","Terminate without error on panics that occur due to broken …","Parse a glob Pattern from a string.","","","","Parser for sizes in SI or IEC units (multiples of 1000 or …","","Whitelist for the suffix","Whether to treat “b” as a “byte count” instead of …","","","","","Whether to treat the suffix “B” as meaning “bytes”.","","Default unit when no suffix is provided","","","","","Returns the argument unchanged.","Returns the argument unchanged.","Calls U::from(self).","Calls U::from(self).","Parse a size string into a number of bytes.","Parse a size string into a number of bytes.","","","","","","","","","","","","Parse a duration from a string.","","","","","","","","","","","","","","","","","The various level of verbosity","","","","","","","","","","","","","Base implementation for chgrp and chown.","","","","","","","","","","Get password/group file entry","","","","","","","","","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","","","","","","","","","","","","","","","","","","","","","","","","","","","","","Perform the change of owner on a path with the various …","","Fetch desired entry.","","From: …","The list of group IDs returned from GNU’s groups and GNU…","AKA passwd.pw_gid","AKA group.gr_gid","","","","AKA passwd.pw_name","AKA group.gr_name","AKA passwd.pw_uid","","AKA passwd.pw_dir","AKA passwd.pw_gecos","AKA passwd.pw_passwd","AKA passwd.pw_shell","","","","","","","","","","","","","","","","","","","","","","","","Nix’s main error type.","Nix Result Type","","A wrapper around nix::unistd::pipe that ensures the pipe …","Less noisy wrapper around nix::fcntl::splice.","Splice wrapper which fully finishes the write.","Copy data from bytes into target, which must be a pipe.","Missing methods for Child objects","getegid() returns the effective group ID of the calling …","geteuid() returns the effective user ID of the calling …","getgid() returns the real group ID of the calling process.","getuid() returns the real user ID of the calling process.","Send a signal to a Child process.","Send a signal to a process group.","Wait for a process to finish or return after the specified …","","","","","","","","","","","","","","","","Returns the argument unchanged.","Returns the argument unchanged.","Calls U::from(self).","Calls U::from(self).","","","","","","","","","","","","","","","","","","Test if at least one of the given Ranges contain the …","","","Returns the argument unchanged.","","Parse a string of the form a-b into a Range","","Calls U::from(self).","","","","","","A fixed-size ring buffer backed by a VecDeque.","","","","Returns the argument unchanged.","","Calls U::from(self).","","Append a value to the end of the ring buffer.","","","","","","","","","","","","first element of the tuple is the blake2b state second is …","","","","A struct that writes to a digest.","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","Return a new Blake2b instance with a custom output bytes …","","","","","","","","","","","Determine the “mode” for the update operation to …","","","Returns the argument unchanged.","Calls U::from(self).","","","","","","","","","","","","","","","","","","","","","","","","","Iterator of login records","","","","","Canonicalize host name using DNS","","","A.K.A. ut.ut_exit","Returns the argument unchanged.","Returns the argument unchanged.","","A.K.A. ut.ut_host","Calls U::from(self).","Calls U::from(self).","Consumes the Utmpx, returning the underlying C struct utmpx","","","Iterate through all the utmp records.","Iterate through all the utmp records from a specific file.","A.K.A. ut.ut_tv","","A.K.A. ut.ut_pid","A.K.A. ut.ut_type","","A.K.A. ut.ut_id","","","","","A.K.A. ut.ut_line","","","A.K.A. ut.ut_user","",""],"i":[0,0,0,0,78,78,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,7,0,0,0,7,0,6,7,6,6,6,0,6,7,6,7,6,6,7,0,0,6,7,6,7,7,6,7,0,6,7,7,6,7,6,7,6,7,6,7,7,0,0,0,0,0,0,0,0,20,20,20,20,20,20,20,20,20,20,20,22,22,20,20,0,0,22,20,20,20,20,20,27,27,27,27,27,27,27,0,32,0,0,32,0,0,32,27,31,31,30,32,27,31,30,32,27,27,27,0,30,0,30,32,32,31,30,32,32,32,32,27,30,31,30,32,27,30,30,32,32,27,32,31,30,32,27,31,30,32,27,31,30,32,27,0,0,0,0,0,39,39,41,39,41,39,41,39,41,39,41,39,41,0,0,39,41,0,0,39,41,117,39,39,41,41,39,41,39,41,39,41,39,41,39,41,39,0,39,39,39,39,0,0,0,0,0,0,0,0,0,0,44,45,48,46,47,44,45,48,46,47,52,52,44,45,46,47,44,45,44,44,45,45,48,48,46,46,47,47,44,45,48,48,48,46,47,0,44,45,48,46,47,118,44,45,44,45,48,46,44,45,48,46,47,0,0,44,45,48,46,47,44,45,48,46,47,44,45,48,46,47,44,45,48,46,47,0,52,52,45,119,55,0,56,55,0,56,55,56,0,0,0,59,55,56,59,55,56,0,55,56,55,56,0,0,0,59,55,56,59,55,56,59,55,56,59,59,0,59,0,59,59,55,56,0,0,0,59,0,0,55,56,59,55,56,59,55,56,59,55,56,0,0,0,0,0,0,120,65,68,68,68,121,120,65,68,68,67,68,65,67,68,65,67,68,65,67,68,65,67,67,67,65,65,65,65,65,65,65,65,65,65,65,65,65,65,65,65,65,65,65,65,65,68,68,67,68,65,120,65,120,65,67,68,65,120,65,67,120,65,65,67,68,65,120,65,67,67,67,120,65,68,121,0,0,0,0,67,0,0,0,67,68,65,120,65,120,65,67,68,65,67,68,65,67,68,65,0,71,71,71,71,71,0,71,71,71,71,0,0,0,0,0,0,0,0,0,0,0,75,75,0,0,75,74,74,74,75,74,75,74,74,74,75,75,75,75,74,75,74,75,74,0,75,75,74,75,74,75,74,75,74,74,74,0,122,81,79,0,81,0,122,0,81,79,79,0,122,122,79,0,0,122,82,123,79,80,81,122,82,123,79,80,81,0,79,80,79,80,82,82,123,82,123,0,79,80,81,82,82,82,123,79,80,122,82,123,79,80,81,80,122,82,123,79,80,81,80,0,82,82,123,82,79,80,82,122,82,123,79,80,81,122,82,123,79,80,81,122,82,123,79,80,81,82,0,0,0,0,0,0,39,41,0,0,117,39,41,39,0,39,39,39,39,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,49,0,0,0,0,0,0,0,0,0,124,124,124,86,85,86,85,0,0,86,85,86,85,86,85,85,85,0,86,85,86,85,85,86,85,86,85,86,85,125,125,126,125,127,0,87,87,87,0,0,87,87,87,87,87,87,87,87,87,87,87,87,0,89,89,89,89,89,89,89,89,89,89,89,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,92,93,94,95,96,97,98,99,100,101,102,103,104,105,106,107,108,109,91,92,93,94,95,96,97,98,99,100,101,102,103,104,105,106,107,108,109,91,0,91,91,92,93,94,95,96,97,98,99,100,101,102,103,104,105,106,107,108,109,91,110,92,93,94,95,96,97,98,99,100,101,102,103,104,105,106,107,108,109,110,92,93,94,95,96,97,98,99,100,101,102,103,104,105,106,107,108,109,92,93,94,95,96,97,98,99,100,101,102,103,104,105,106,107,108,109,91,110,92,93,94,95,96,97,98,99,100,101,102,103,104,105,106,107,108,109,91,110,92,93,94,95,96,97,98,99,100,101,102,103,104,105,106,107,108,109,110,110,110,92,93,94,95,96,97,98,99,100,101,102,103,104,105,106,107,108,109,110,110,95,96,97,92,93,94,95,96,97,98,99,100,101,102,103,104,105,106,107,108,109,91,92,93,94,95,96,97,98,99,100,101,102,103,104,105,106,107,108,109,91,92,93,94,95,96,97,98,99,100,101,102,103,104,105,106,107,108,109,91,92,91,111,111,111,0,0,111,111,111,111,0,111,111,111,111,111,111,111,111,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,112,113,112,113,112,113,0,112,112,113,0,112,112,113,112,113,112,112,112,112,113,112,112,0,112,112,113,112,113,112,112,113,112,0,0],"f":[0,[[],1],0,0,[[],[[3,[2]]]],[[],[[3,[2]]]],0,0,0,0,0,0,[[],4],[4,2],0,0,[[],5],0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,[[],5],0,[[]],0,0,0,0,0,0,0,0,[[],4],0,0,0,0,0,0,0,0,0,0,0,0,0,0,[[]],[[]],[[]],[[]],[6,6],[[]],[7,8],[9,[[10,[6]]]],[9,2],[[6,6],5],[[7,7],5],[[6,11],12],[[7,11],12],[[7,11],12],[[]],[[]],[[6,13,4],[[15,[14]]]],[[]],[[]],[16],[[]],[[],2],[[],17],[[],17],[[],17],[[],17],[[],18],[[],18],[7,5],0,0,0,[[],19],[[],19],[[],19],0,0,[[]],[[]],[20,20],[[]],[[20,5],20],[[20,11],[[17,[21]]]],[[20,11],[[17,[21]]]],[[20,5],20],[[[0,[22,23]]],20],[[]],[[]],[[],20],[[],20],[4,20],[24,20],[[[25,[24]]],26],[[[25,[24]]],26],[[],20],[[]],[[],2],[[],17],[[],17],[[],18],0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[27,27],[[]],[27,28],[[[30,[29]]],28],[27,[[17,[2,31]]]],[[[30,[29]]],[[17,[2,31]]]],[[32,11],12],[[32,11],12],[[]],[[]],[33,32],[34,32],[35,32],[[]],[[]],[[[30,[29]],5],[[30,[29]]]],[[]],[[]],[[]],[[]],[[[30,[29]],36],[[30,[29]]]],[[29,27],[[30,[29]]]],[16],[32,[[15,[37]]]],[[]],[[],2],[[],17],[[],17],[[],17],[[],17],[[],17],[[],17],[[],17],[[],17],[[],18],[[],18],[[],18],[[],18],[[[30,[29]],4]],[[38,36,4],26],0,0,0,[39,[[3,[40]]]],[[]],[[]],[[]],[[]],[39,39],[41,41],[[]],[[]],[[39,11],12],[[41,11],12],[[]],[[]],[[],[[26,[[3,[40]]]]]],[[[15,[42]]],[[26,[[3,[40]]]]]],0,0,[40,[[26,[2]]]],[4,[[26,[40]]]],[[]],[[]],[[],[[26,[23]]]],[43,[[26,[39]]]],[4,[[26,[39]]]],[4,[[26,[41]]]],[40,[[26,[41]]]],0,0,[[]],[[]],[[],17],[[],17],[[],17],[[],17],[[],18],[[],18],0,[43,[[26,[2]]]],0,0,0,0,[4,[[26,[43]]]],0,0,0,0,0,0,0,0,0,[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[],8],[[],8],[44,8],[45,8],[46,8],[47,8],0,0,[[44,11],12],[[44,11],[[17,[21]]]],[[45,11],[[17,[21]]]],[[45,11],12],[[48,11],12],[[48,11],[[17,[21]]]],[[46,11],12],[[46,11],[[17,[21]]]],[[47,11],[[17,[21]]]],[[47,11],12],[[]],[[]],[[]],[33,48],[49,48],[[]],[[]],[[],8],[[]],[[]],[[]],[[]],[[]],[50],0,0,[[8,[51,[2]]],[[53,[52]]]],[[8,[51,[2]]],[[53,[52]]]],[[54,[51,[2]]],[[53,[52]]]],[8,[[53,[52]]]],[16],[16],[16],[16],[16],[8],[33,2],[[],2],[[],2],[[],2],[[],2],[[],2],[[],17],[[],17],[[],17],[[],17],[[],17],[[],17],[[],17],[[],17],[[],17],[[],17],[[],18],[[],18],[[],18],[[],18],[[],18],0,[[],5],[[],5],[45,5],[8],0,0,0,0,0,0,0,0,0,[[13,13],5],[[13,13],5],[[]],[[]],[[]],[[]],[[]],[[]],[[[25,[13]],55,56],[[26,[14]]]],[55,55],[56,56],[[]],[[]],[13,14],[[57,5],2],[[58,5],2],[[59,59],5],[[55,55],5],[[56,56],5],[59,60],[[55,11],12],[[56,11],12],[[]],[[]],[[]],[61,[[26,[59]]]],[[[25,[13]],5],[[26,[59]]]],0,[[59,62]],[[[26,[59]],[26,[59]]],5],[59,60],[[]],[[]],[[]],[13,5],[[[25,[13]],[25,[13]]],14],[13,14],[59,60],[[[25,[13]],[25,[13]],5],5],[13,[[63,[13]]]],[[]],[[]],[[],17],[[],17],[[],17],[[],17],[[],17],[[],17],[[],18],[[],18],[[],18],0,0,0,0,0,[[64,65],8],[[],60],[65,60],0,0,0,[[],60],[[],66],[65,66],0,0,[[]],[[]],[[]],[[]],[[]],[[]],[67,67],[68,68],[65,65],[[]],[[]],[[]],0,0,0,[[65,65],5],0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,[[67,11],12],[[68,11],12],[[65,11],[[17,[21]]]],[[],60],[65,60],[[],60],[65,60],[[]],[[]],[[]],[[],66],[65,66],0,[[],60],[65,60],[[65,62]],[[]],[[]],[[]],[[],60],[65,60],0,0,0,[[],60],[65,60],[65,68],[[],2],[[58,60],4],[66,[[63,[4]]]],[[66,66],2],[[],[[17,[[3,[67]],33]]]],0,[[[51,[[3,[69]]]]],[[17,[65,2]]]],0,[[64,65],8],[[]],[[]],[[]],[[],60],[65,60],[[],60],[65,60],[[],17],[[],17],[[],17],[[],17],[[],17],[[],17],[[],18],[[],18],[[],18],0,[[]],[[]],[[]],[[]],[[]],[[70,69],[[71,[70]]]],[[[71,[70]]],[[15,[[26,[[3,[69]]]]]]]],[[],17],[[],17],[[],18],[4,10],[4,[[10,[2]]]],[[],42],[4,[[17,[58,2]]]],[[42,4,5],[[17,[42,2]]]],[[42,4,42,5],[[17,[42,2]]]],[[[3,[2]]],5],[[],5],[[],5],[[]],[4,[[17,[72,73]]]],0,0,0,0,0,0,0,[[]],[[]],[[]],[[]],0,[[],74],0,[75,4],[[75,75],5],[[75,11],12],[[75,11],[[17,[21]]]],[[]],[[]],[[]],[[]],[[74,4],[[17,[60,75]]]],[4,[[17,[60,75]]]],[16],[[],2],[[],17],[[],17],[[],17],[[],17],[[],18],[[],18],[74,74],[[74,5],74],[[74,4],74],[4,[[17,[76,2]]]],0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[77,78,4,5],10],[79,79],[80,80],[[]],[[]],0,0,0,0,0,0,[[79,79],5],[[80,80],5],[[81,81],5],[82,10],0,0,0,[[79,11],12],[[80,11],12],[[]],[[]],[[]],[[]],[[]],[[]],0,[[]],[[]],[[]],[[]],[[]],[[]],0,0,0,0,0,0,[[]],[[]],0,[[],17],[[],17],[[],17],[[],17],[[],17],[[],17],[[],17],[[],17],[[],17],[[],17],[[],17],[[],17],[[],18],[[],18],[[],18],[[],18],[[],18],[[],18],0,[[[25,[13]],57,[15,[42]],[15,[42]],5,80],[[17,[2,2]]]],0,0,0,[[],[[26,[[3,[40]]]]]],[[[15,[42]]],[[26,[[3,[40]]]]]],0,0,[40,[[26,[2]]]],[4,[[26,[40]]]],[[],[[26,[23]]]],0,0,0,[43,[[26,[2]]]],0,0,0,0,[4,[[26,[43]]]],0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,[[49,50],10],[[],83],[[61,61,36],[[83,[36]]]],[[61,61,36],83],[61,[[83,[36]]]],0,[[],40],[[],43],[[],40],[[],43],[36,26],[36,26],[76,[[26,[[15,[84]]]]]],0,0,0,0,0,0,0,0,[[]],[[]],[[]],[[]],[85,85],[[]],[[24,86],2],[[]],[[]],[[]],[[]],[[]],[[],17],[[],17],[[],17],[[],17],[[],18],[[],18],0,0,0,0,0,0,[[]],[[]],[[87,87],88],[[],[[3,[87]]]],[36,5],[[87,87],5],[[87,11],12],[[]],[4,[[17,[[3,[87]],2]]]],[4,[[17,[87,4]]]],0,[[]],0,[[87,87],[[15,[88]]]],[[],17],[[],17],[[],18],0,[[]],[[]],0,[[]],[[1,36],89],[[]],[36,89],[89,15],[[],17],[[],17],[[],18],0,0,[[],[[17,[90]]]],[[],[[17,[90]]]],[36,5],[4,[[15,[36]]]],[36,[[15,[4]]]],0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[36,36],36],[91,5],[91,26],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[92],[93],[94],[95],[96],[97],[98],[99],[100],[101],[102],[103],[104],[105],[106],[107],[108],[109],[[]],[92],[93],[94],[95],[96],[97],[98],[99],[100],[101],[102],[103],[104],[105],[106],[107],[108],[109],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[],23],[[],92],[[],93],[[],94],[[],95],[[],96],[[],97],[[],98],[[],99],[[],100],[[],101],[[],102],[[],103],[[],104],[[],105],[[],106],[[],107],[[],108],[[],109],[[[53,[110]],5],91],[[],36],[92,36],[93,36],[94,36],[95,36],[96,36],[97,36],[98,36],[99,36],[100,36],[101,36],[102,36],[103,36],[104,36],[105,36],[106,36],[107,36],[108,36],[109,36],[[],36],[[],36],[[]],[92],[93],[94],[95],[96],[97],[98],[99],[100],[101],[102],[103],[104],[105],[106],[107],[108],[109],[[],2],[[],2],[95,2],[96,2],[97,2],[[],17],[[],17],[[],17],[[],17],[[],17],[[],17],[[],17],[[],17],[[],17],[[],17],[[],17],[[],17],[[],17],[[],17],[[],17],[[],17],[[],17],[[],17],[[],17],[[],17],[[],17],[[],17],[[],17],[[],17],[[],17],[[],17],[[],17],[[],17],[[],17],[[],17],[[],17],[[],17],[[],17],[[],17],[[],17],[[],17],[[],17],[[],17],[[],18],[[],18],[[],18],[[],18],[[],18],[[],18],[[],18],[[],18],[[],18],[[],18],[[],18],[[],18],[[],18],[[],18],[[],18],[[],18],[[],18],[[],18],[[],18],[36,92],[91,[[26,[36]]]],0,0,0,0,0,[[]],[[]],[111,111],[[]],[9,111],[[111,111],5],[[111,11],12],[[]],[[]],[[]],[[],17],[[],17],[[],18],0,0,[[],19],[[],19],0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,[[]],[[]],[[]],[[]],[112,[[26,[2]]]],[113],[[]],[112],[[]],[[]],[[],114],[112,2],[[]],[[]],[112,114],[[]],[112,5],[[],113],[[[25,[13]]],113],[112,115],[113,15],[112,8],[112,116],[[]],[112,2],[[],17],[[],17],[[],17],[[],17],[112,2],[[],18],[[],18],[112,2],[64,8],[[4,4],88]],"c":[],"p":[[8,"Iterator"],[3,"String"],[3,"Vec"],[15,"str"],[15,"bool"],[4,"BackupMode"],[4,"BackupError"],[15,"i32"],[3,"ArgMatches"],[6,"UResult"],[3,"Formatter"],[6,"Result"],[3,"Path"],[3,"PathBuf"],[4,"Option"],[3,"Demand"],[4,"Result"],[3,"TypeId"],[3,"Arg"],[3,"Quoted"],[3,"Error"],[8,"Quotable"],[8,"Sized"],[3,"OsStr"],[8,"AsRef"],[6,"Result"],[4,"Format"],[6,"DecodeResult"],[8,"Read"],[3,"Data"],[4,"EncodeError"],[4,"DecodeError"],[3,"Error"],[4,"DecodeError"],[3,"DecodeError"],[15,"usize"],[8,"Error"],[8,"Write"],[3,"Passwd"],[6,"gid_t"],[3,"Group"],[15,"u32"],[6,"uid_t"],[3,"USimpleError"],[3,"UUsageError"],[3,"ExitCode"],[3,"ClapErrorWrapper"],[3,"UIoError"],[6,"Error"],[8,"FnOnce"],[8,"Into"],[8,"UError"],[3,"Box"],[4,"ErrorKind"],[4,"MissingHandling"],[4,"ResolveMode"],[3,"Metadata"],[6,"mode_t"],[3,"FileInformation"],[15,"u64"],[8,"AsRawFd"],[8,"Hasher"],[4,"Cow"],[15,"i8"],[3,"statfs_fn"],[15,"i64"],[3,"MountInfo"],[3,"FsUsage"],[15,"u8"],[8,"BufRead"],[3,"Lines"],[3,"Pattern"],[3,"PatternError"],[3,"Parser"],[4,"ParseSizeError"],[3,"Duration"],[3,"Command"],[8,"Args"],[4,"VerbosityLevel"],[3,"Verbosity"],[4,"TraverseSymlinks"],[3,"ChownExecutor"],[6,"Result"],[3,"ExitStatus"],[4,"Quotes"],[4,"QuotingStyle"],[3,"Range"],[4,"Ordering"],[3,"RingBuffer"],[4,"Errno"],[3,"DigestWriter"],[3,"Blake2b"],[3,"Blake3"],[3,"Sm3"],[3,"CRC"],[3,"BSD"],[3,"SYSV"],[3,"Md5"],[3,"Sha1"],[3,"Sha224"],[3,"Sha256"],[3,"Sha384"],[3,"Sha512"],[3,"Sha3_224"],[3,"Sha3_256"],[3,"Sha3_384"],[3,"Sha3_512"],[3,"Shake128"],[3,"Shake256"],[8,"Digest"],[4,"UpdateMode"],[3,"Utmpx"],[3,"UtmpxIter"],[3,"utmpx"],[3,"OffsetDateTime"],[15,"i16"],[8,"Locate"],[8,"FromIo"],[8,"UClapError"],[8,"FsMeta"],[8,"BirthTime"],[4,"IfFrom"],[3,"GidUidOwnerFilter"],[8,"ChildExt"],[13,"Shell"],[13,"C"],[13,"Literal"]]},\ +"uucore":{"doc":"","t":"IFAOLLOOAAAAFFAAFOOOOAXAAAAAAAAAAOAAFAFOOOOAAOAFAANRHENENNNNNALLLLLLLFFLLLLLLLFLLLLLLLLLLLLHHHFFFIDLLLLLLLLLLLLLLLFFKLLLLLNNNNNNNDNEGNEENNNLLLLLLLLLLFLFLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLFFDIDLLLLLLLLLLLLLFFMMFFLLKLLLLMMLLLLLLLLMFMMMMFDDIIIDGDDLLLLLLLLLLLLLLLLMMLLLLLLLLLLLLLLLLLFLLLLLKMMLLLLLLLLLFFLLLLLLLLLLLLLLLLLLLLOLLLKNDNNENNNEFFLLLLLLFLLLLFFFLLLLLLLLLLLOLFLLLLFFFLFFLLLLLLLLLLLIIDDDFKLMMMKKLMMLLLLLLLLLLLLMMMLMMMMMMMMMMMMMMMMMMMMMMLLLKLKLLLLKLMKLLLLLKLMMMKLLKFFFFMFDFLLLKLKLLLLLLLLLLDLLLLLFLLLLFFFFFFFFFFFNNEDNMMLLLLMLMLLLLLLLLLFLLLLLLLLLLLFNNNDNDNENNNENNNDELLLLLLLLLLLLFLLLLMMMMMALLLLMMMLLLLLLLLMLLLLLLMAMMMMLLMLLLLLLLLLLLLLLLLLLMFDIDFFMMFFKMMMFMMMMFRRRRRRRAAAARRRRRRRRRRRGGLFFFFIFFFFKKKNNNNEENNLLLLLLFLLLLLLLLLLLMMMMMDLLLFFLLLLLMLMLLLLDLLMLLLLLLLLHHFFFFFDDDDIDDDDDDDDDDDDDDDLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLFLLLLLLLLLLLLLLLLLLLLLKLLLLLLLLLLLLLLLLLLKLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLKLLLLLLLLLLLLLLLLLLLKLLLLLLLLLLLLLLLLLLLLKLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLNNNEALLLLFLLLLLLLLHHFFRRRHRRRRRRRRRRRDDLLLLLLFLLLFLLLLLLLLLLLLFLLLLLLLLLFF","n":["Args","args_os","backup_control","bin","collect_ignore","collect_lossy","crash","crash_if_err","display","encoding","entries","error","execution_phrase","format_usage","fs","fsext","get_utility_is_second_arg","has","help_about","help_section","help_usage","lines","main","memo","mode","os","panic","parse_glob","parse_size","parse_time","perms","pipes","process","prompt_yes","quoting_style","ranges","read_yes","ringbuffer","set_utility_is_second_arg","show","show_error","show_if_err","show_warning","signals","sum","uio_error","update_control","util_name","utmpx","version_cmp","AmbiguousArgument","BACKUP_CONTROL_LONG_HELP","BACKUP_CONTROL_VALUES","BackupError","BackupImpossible","BackupMode","ExistingBackup","InvalidArgument","NoBackup","NumberedBackup","SimpleBackup","arguments","borrow","borrow","borrow_mut","borrow_mut","clone","clone_into","code","determine_backup_mode","determine_backup_suffix","eq","eq","fmt","fmt","fmt","from","from","get_backup_path","into","into","provide","to_owned","to_string","try_from","try_from","try_into","try_into","type_id","type_id","usage","OPT_BACKUP","OPT_BACKUP_NO_ARG","OPT_SUFFIX","backup","backup_no_args","suffix","Quotable","Quoted","borrow","borrow_mut","clone","clone_into","external","fmt","fmt","force","from","from","into","maybe_quote","maybe_quote","native","native_raw","print_verbatim","println_verbatim","quote","to_owned","to_string","try_from","try_into","type_id","Base16","Base2Lsbf","Base2Msbf","Base32","Base32Hex","Base64","Base64Url","Data","Decode","DecodeError","DecodeResult","DecodeZ85","EncodeError","Format","Io","Z85","Z85InputLenNotMultipleOf4","borrow","borrow","borrow","borrow","borrow_mut","borrow_mut","borrow_mut","borrow_mut","clone","clone_into","decode","decode","encode","encode","fmt","fmt","from","from","from","from","from","from","from","ignore_garbage","into","into","into","into","line_wrap","new","provide","source","to_owned","to_string","try_from","try_from","try_from","try_from","try_into","try_into","try_into","try_into","type_id","type_id","type_id","type_id","wrap_print","wrap_write","Group","Locate","Passwd","belongs_to","borrow","borrow","borrow_mut","borrow_mut","clone","clone","clone_into","clone_into","fmt","fmt","from","from","get_groups","get_groups_gnu","gid","gid","gid2grp","grp2gid","into","into","locate","locate","locate","locate","locate","name","name","to_owned","to_owned","try_from","try_from","try_into","try_into","type_id","type_id","uid","uid2usr","user_dir","user_info","user_passwd","user_shell","usr2uid","ClapErrorWrapper","ExitCode","FromIo","UClapError","UError","UIoError","UResult","USimpleError","UUsageError","borrow","borrow","borrow","borrow","borrow","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","code","code","code","code","code","code","code","code","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","from","from","from","from","from","from","from","get_exit_code","into","into","into","into","into","map_err_context","message","message","new","new","new","new","provide","provide","provide","provide","provide","set_exit_code","strip_errno","to_string","to_string","to_string","to_string","to_string","try_from","try_from","try_from","try_from","try_from","try_into","try_into","try_into","try_into","try_into","type_id","type_id","type_id","type_id","type_id","uio_error","usage","usage","usage","with_exit_code","Existing","FileInformation","Logical","Missing","MissingHandling","None","Normal","Physical","ResolveMode","are_hardlinks_or_one_way_symlink_to_same_file","are_hardlinks_to_same_file","borrow","borrow","borrow","borrow_mut","borrow_mut","borrow_mut","canonicalize","clone","clone","clone_into","clone_into","dir_strip_dot_for_creation","display_permissions","display_permissions_unix","eq","eq","eq","file_size","fmt","fmt","from","from","from","from_file","from_path","has","hash","infos_refer_to_same_file","inode","into","into","into","is_symlink_loop","make_path_relative_to","normalize_path","number_of_links","paths_refer_to_same_file","resolve_relative_path","to_owned","to_owned","try_from","try_from","try_from","try_into","try_into","try_into","type_id","type_id","type_id","BirthTime","FsMeta","FsUsage","MountInfo","StatFs","StatFs","avail_blocks","avail_blocks","bavail","bavail_top_bit_set","bfree","birth","block_size","block_size","blocks","blocksize","borrow","borrow","borrow","borrow_mut","borrow_mut","borrow_mut","clone","clone","clone","clone_into","clone_into","clone_into","dev_id","dev_name","dummy","eq","f_bavail","f_bavail","f_bfree","f_bfree","f_blocks","f_blocks","f_bsize","f_bsize","f_ffree","f_ffree","f_files","f_files","f_frsize","f_frsize","f_fsid","f_fsid","f_namelen","f_namelen","f_type","f_type","ffree","files","fmt","fmt","fmt","free_blocks","free_blocks","free_file_nodes","free_file_nodes","from","from","from","fs_type","fs_type","fs_type","fsid","fsid","hash","into","into","into","io_size","io_size","mount_dir","mount_option","mount_root","namelen","namelen","new","pretty_birth","pretty_filetype","pretty_fstype","pretty_time","read_fs_list","remote","statfs","statfs_fn","statfs_fn","to_owned","to_owned","to_owned","total_blocks","total_blocks","total_file_nodes","total_file_nodes","try_from","try_from","try_from","try_into","try_into","try_into","type_id","type_id","type_id","Lines","borrow","borrow_mut","from","into","into_iter","lines","next","try_from","try_into","type_id","printf","sprintf","get_umask","parse_mode","parse_numeric","parse_symbolic","strip_minus_from_mode","is_wsl_1","is_wsl_2","mute_sigpipe_panic","from_str","InvalidSuffix","ParseFailure","ParseSizeError","Parser","SizeTooBig","allow_list","b_byte_count","borrow","borrow","borrow_mut","borrow_mut","capital_b_bytes","default","default_unit","description","eq","fmt","fmt","from","from","into","into","parse","parse_size","provide","to_string","try_from","try_from","try_into","try_into","type_id","type_id","with_allow_list","with_b_byte_count","with_default_unit","from_str","All","All","Changes","ChownExecutor","First","GidUidOwnerFilter","Group","IfFrom","None","Normal","Silent","TraverseSymlinks","User","UserGroup","Verbose","Verbosity","VerbosityLevel","borrow","borrow","borrow","borrow","borrow","borrow","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","chown_base","clone","clone","clone_into","clone_into","dereference","dest_gid","dest_gid","dest_uid","dest_uid","entries","eq","eq","eq","exec","files","filter","filter","fmt","fmt","from","from","from","from","from","from","groups_only","into","into","into","into","into","into","level","options","preserve_root","raw_owner","raw_owner","recursive","to_owned","to_owned","traverse_symlinks","try_from","try_from","try_from","try_from","try_from","try_from","try_into","try_into","try_into","try_into","try_into","try_into","type_id","type_id","type_id","type_id","type_id","type_id","verbosity","wrap_chown","Group","Locate","Passwd","get_groups","get_groups_gnu","gid","gid","gid2grp","grp2gid","locate","name","name","uid","uid2usr","user_dir","user_info","user_passwd","user_shell","usr2uid","ARG_FILES","ARG_GROUP","ARG_OWNER","FROM","HELP","RECURSIVE","REFERENCE","dereference","preserve_root","traverse","verbosity","DEREFERENCE","NO_DEREFERENCE","NO_PRESERVE","PRESERVE","EVERY","NO_TRAVERSE","TRAVERSE","CHANGES","QUIET","SILENT","VERBOSE","Error","Result","map_err_context","pipe","splice","splice_exact","vmsplice","ChildExt","getegid","geteuid","getgid","getuid","send_signal","send_signal_group","wait_or_timeout","C","Double","Literal","None","Quotes","QuotingStyle","Shell","Single","borrow","borrow","borrow_mut","borrow_mut","clone","clone_into","escape_name","from","from","into","into","to_owned","try_from","try_from","try_into","try_into","type_id","type_id","always_quote","escape","quotes","show_control","show_control","Range","borrow","borrow_mut","cmp","complement","contain","eq","fmt","from","from_list","from_str","high","into","low","partial_cmp","try_from","try_into","type_id","RingBuffer","borrow","borrow_mut","data","from","from_iter","into","new","push_back","try_from","try_into","type_id","ALL_SIGNALS","DEFAULT_SIGNAL","enable_pipe_errors","ignore_interrupts","is_signal","signal_by_name_or_value","signal_name_by_value","BSD","Blake2b","Blake3","CRC","Digest","DigestWriter","Md5","SYSV","Sha1","Sha224","Sha256","Sha384","Sha3_224","Sha3_256","Sha3_384","Sha3_512","Sha512","Shake128","Shake256","Sm3","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","div_ceil","finalize","flush","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","hash_finalize","hash_finalize","hash_finalize","hash_finalize","hash_finalize","hash_finalize","hash_finalize","hash_finalize","hash_finalize","hash_finalize","hash_finalize","hash_finalize","hash_finalize","hash_finalize","hash_finalize","hash_finalize","hash_finalize","hash_finalize","hash_finalize","hash_update","hash_update","hash_update","hash_update","hash_update","hash_update","hash_update","hash_update","hash_update","hash_update","hash_update","hash_update","hash_update","hash_update","hash_update","hash_update","hash_update","hash_update","hash_update","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","new","new","new","new","new","new","new","new","new","new","new","new","new","new","new","new","new","new","new","new","output_bits","output_bits","output_bits","output_bits","output_bits","output_bits","output_bits","output_bits","output_bits","output_bits","output_bits","output_bits","output_bits","output_bits","output_bits","output_bits","output_bits","output_bits","output_bits","output_bytes","output_bytes","reset","reset","reset","reset","reset","reset","reset","reset","reset","reset","reset","reset","reset","reset","reset","reset","reset","reset","reset","result_str","result_str","result_str","result_str","result_str","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","with_output_bytes","write","ReplaceAll","ReplaceIfOlder","ReplaceNone","UpdateMode","arguments","borrow","borrow_mut","clone","clone_into","determine_update_mode","eq","fmt","from","into","to_owned","try_from","try_into","type_id","OPT_UPDATE","OPT_UPDATE_NO_ARG","update","update_no_args","ACCOUNTING","BOOT_TIME","DEAD_PROCESS","DEFAULT_FILE","EMPTY","INIT_PROCESS","LOGIN_PROCESS","NEW_TIME","OLD_TIME","RUN_LVL","USER_PROCESS","UT_HOSTSIZE","UT_IDSIZE","UT_LINESIZE","UT_NAMESIZE","Utmpx","UtmpxIter","borrow","borrow","borrow_mut","borrow_mut","canon_host","drop","endutxent","exit_status","from","from","getutxent","host","into","into","into_inner","into_iter","is_user_process","iter_all_records","iter_all_records_from","login_time","next","pid","record_type","setutxent","terminal_suffix","try_from","try_from","try_into","try_into","tty_device","type_id","type_id","user","utmpxname","version_cmp"],"q":[[0,"uucore"],[50,"uucore::backup_control"],[91,"uucore::backup_control::arguments"],[97,"uucore::display"],[122,"uucore::encoding"],[187,"uucore::entries"],[233,"uucore::error"],[322,"uucore::fs"],[382,"uucore::fsext"],[488,"uucore::lines"],[499,"uucore::memo"],[501,"uucore::mode"],[506,"uucore::os"],[508,"uucore::panic"],[509,"uucore::parse_glob"],[510,"uucore::parse_size"],[545,"uucore::parse_time"],[546,"uucore::perms"],[637,"uucore::perms::entries"],[656,"uucore::perms::options"],[667,"uucore::perms::options::dereference"],[669,"uucore::perms::options::preserve_root"],[671,"uucore::perms::options::traverse"],[674,"uucore::perms::options::verbosity"],[678,"uucore::pipes"],[685,"uucore::process"],[693,"uucore::quoting_style"],[719,"uucore::quoting_style::QuotingStyle"],[724,"uucore::ranges"],[742,"uucore::ringbuffer"],[754,"uucore::signals"],[761,"uucore::sum"],[1022,"uucore::update_control"],[1040,"uucore::update_control::arguments"],[1044,"uucore::utmpx"],[1095,"uucore::version_cmp"]],"d":["","","Implement GNU-style backup functionality.","","Collects the iterator into a Vec<String>, removing any …","Collects the iterator into a Vec<String>, lossily …","Display an error and std::process::exit","Unwrap a std::result::Result, crashing instead of …","","","Get password/group file entry","All utils return exit with an exit code. Usually, the …","Derive the complete execution phrase for “usage”.","Generate the usage string for clap.","Set of functions to manage files and symlinks","Set of functions to manage file systems","","","Get the about text from the help file.","Reads a section from a file of the util as a str literal.","Get the usage from the help file.","Iterate over lines, including the line ending character(s).","","Main entry point for our implementation of printf.","Set of functions to parse modes","","Custom panic hooks that allow silencing certain types of …","Parsing a glob Pattern from a string.","","Parsing a duration from a string.","Common functions to manage permissions","","Set of functions to manage IDs","Prompt the user with a formatted string and returns true …","","","Read a line from stdin and check whether the first …","A fixed-size ring buffer.","","Display a crate::error::UError and set global exit code.","Show an error to stderr in a similar style to GNU …","Display an error and set global exit code in error case.","Print a warning message to stderr.","","Implementations of digest functions, like md5 and sha1.","Shorthand to construct UIoError-instances.","Implement GNU-style update functionality.","Derive the utility name.","Aims to provide platform-independent methods to obtain …","","An ambiguous argument (e.g. ‘n’) was given as backup …","","","Backup error types.","Currently unused","Available backup modes.","Argument ‘existing’, ‘nil’","An invalid argument (e.g. ‘foo’) was given as backup …","Argument ‘none’, ‘off’","Argument ‘numbered’, ‘t’","Argument ‘simple’, ‘never’","Arguments for backup-related functionality.","","","","","","","","Determine the “mode” for the backup operation to …","Obtain the suffix to use for a backup.","","","","","","Returns the argument unchanged.","Returns the argument unchanged.","","Calls U::from(self).","Calls U::from(self).","","","","","","","","","","","","","","‘–backup’ argument","‘-b’ argument","‘-S, –suffix’ argument","An extension trait to apply quoting to strings.","A wrapper around string types for displaying with quoting …","","","","","When quoting for PowerShell, toggle whether to quote for …","","","Toggle forced quoting. If true, quotes are added even if …","Returns the argument unchanged.","","Calls U::from(self).","Like quote(), but don’t actually add quotes unless …","Like quote(), but don’t actually add quotes unless …","Quote a string with the default style for the platform.","Quote an OsStr with the default style for the platform.","Like println_verbatim, without the trailing newline.","Print a path (or OsStr-like object) directly to stdout, …","Returns an object that implements Display for printing …","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","Returns the argument unchanged.","Returns the argument unchanged.","","","","Returns the argument unchanged.","Returns the argument unchanged.","","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","","","","","","","","","","","","","","","","","","","","","","Fetch desired entry.","","This is a wrapper function for libc::getgrouplist.","","","","","","","","","","","Returns the argument unchanged.","Returns the argument unchanged.","From: …","The list of group IDs returned from GNU’s groups and GNU…","AKA passwd.pw_gid","AKA group.gr_gid","","","Calls U::from(self).","Calls U::from(self).","","","","","","AKA passwd.pw_name","AKA group.gr_name","","","","","","","","","AKA passwd.pw_uid","","AKA passwd.pw_dir","AKA passwd.pw_gecos","AKA passwd.pw_passwd","AKA passwd.pw_shell","","A wrapper for clap::Error that implements UError","A special error type that does not print any message when …","Enables the conversion from std::io::Error to UError and …","Extension trait for clap::Error to adjust the exit code.","Custom errors defined by the utils and uucore.","Wrapper type around std::io::Error.","Result type that should be returned by all utils.","A simple error type with an exit code and a message that …","","","","","","","","","","","","Error code of a custom error.","Error code of a custom error.","","","","","","","","","","","","","","","","","Returns the argument unchanged.","Returns the argument unchanged.","","Returns the argument unchanged.","","Returns the argument unchanged.","Returns the argument unchanged.","Get the last exit code set with set_exit_code. The default …","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","","","","","","","","","","","","","Set the exit code for the program if uumain returns Ok(()).","Strip the trailing “ (os error XX)“ from io error …","","","","","","","","","","","","","","","","","","","","","Shorthand to construct UIoError-instances.","Print usage help to a custom error.","Print usage help to a custom error.","","","Resolve symbolic links, ignoring errors on the final …","Information to uniquely identify a file","Resolve ‘..’ elements before symlinks","Resolve symbolic links, ignoring errors on the non-final …","Controls how symbolic links should be handled when …","Do not resolve any symbolic links.","Return an error if any part of the path is missing.","Resolve symlinks as encountered when processing the path","Controls when symbolic links are resolved","Checks if either two paths are hard links to the same file …","Checks if two paths are hard links to the same file.","","","","","","","Return the canonical, absolute form of a path.","","","","","For some programs like install or mkdir, dir/. can be …","Display the permissions of a file On non unix like system, …","Display the permissions of a file on a unix like system","","","","","","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Get information from a currently open file","Get information for a given path.","","","Checks if p1 and p2 are the same file information. If …","","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Checks if there is a symlink loop in the given path.","Converts absolute path to be relative to absolute to path.","Normalize a path by removing relative information For …","","Checks if p1 and p2 are the same file. If error happens …","resolve a relative path","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","","","","","","","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","","","","","","","","","","","","","Read file system list.","","","","","","","","","","","","","","","","","","","","","An iterator over the lines of an instance of BufRead.","","","Returns the argument unchanged.","Calls U::from(self).","","Returns an iterator over the lines, including line ending …","","","","","Write a formatted string to stdout.","Create a new formatted string.","","","","","","Test if the program is running under WSL","","Terminate without error on panics that occur due to broken …","Parse a glob Pattern from a string.","","","","Parser for sizes in SI or IEC units (multiples of 1000 or …","","Whitelist for the suffix","Whether to treat “b” as a “byte count” instead of …","","","","","Whether to treat the suffix “B” as meaning “bytes”.","","Default unit when no suffix is provided","","","","","Returns the argument unchanged.","Returns the argument unchanged.","Calls U::from(self).","Calls U::from(self).","Parse a size string into a number of bytes.","Parse a size string into a number of bytes.","","","","","","","","","","","","Parse a duration from a string.","","","","","","","","","","","","","","","","","The various level of verbosity","","","","","","","","","","","","","Base implementation for chgrp and chown.","","","","","","","","","","Get password/group file entry","","","","","","","","","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","","","","","","","","","","","","","","","","","","","","","","","","","","","","","Perform the change of owner on a path with the various …","","Fetch desired entry.","","From: …","The list of group IDs returned from GNU’s groups and GNU…","AKA passwd.pw_gid","AKA group.gr_gid","","","","AKA passwd.pw_name","AKA group.gr_name","AKA passwd.pw_uid","","AKA passwd.pw_dir","AKA passwd.pw_gecos","AKA passwd.pw_passwd","AKA passwd.pw_shell","","","","","","","","","","","","","","","","","","","","","","","","Nix’s main error type.","Nix Result Type","","A wrapper around nix::unistd::pipe that ensures the pipe …","Less noisy wrapper around nix::fcntl::splice.","Splice wrapper which fully finishes the write.","Copy data from bytes into target, which must be a pipe.","Missing methods for Child objects","getegid() returns the effective group ID of the calling …","geteuid() returns the effective user ID of the calling …","getgid() returns the real group ID of the calling process.","getuid() returns the real user ID of the calling process.","Send a signal to a Child process.","Send a signal to a process group.","Wait for a process to finish or return after the specified …","","","","","","","","","","","","","","","","Returns the argument unchanged.","Returns the argument unchanged.","Calls U::from(self).","Calls U::from(self).","","","","","","","","","","","","","","","","","","Test if at least one of the given Ranges contain the …","","","Returns the argument unchanged.","","Parse a string of the form a-b into a Range","","Calls U::from(self).","","","","","","A fixed-size ring buffer backed by a VecDeque.","","","","Returns the argument unchanged.","","Calls U::from(self).","","Append a value to the end of the ring buffer.","","","","","","","","","","","","first element of the tuple is the blake2b state second is …","","","","A struct that writes to a digest.","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","Return a new Blake2b instance with a custom output bytes …","","","","","","","","","","","Determine the “mode” for the update operation to …","","","Returns the argument unchanged.","Calls U::from(self).","","","","","","","","","","","","","","","","","","","","","","","","","Iterator of login records","","","","","Canonicalize host name using DNS","","","A.K.A. ut.ut_exit","Returns the argument unchanged.","Returns the argument unchanged.","","A.K.A. ut.ut_host","Calls U::from(self).","Calls U::from(self).","Consumes the Utmpx, returning the underlying C struct utmpx","","","Iterate through all the utmp records.","Iterate through all the utmp records from a specific file.","A.K.A. ut.ut_tv","","A.K.A. ut.ut_pid","A.K.A. ut.ut_type","","A.K.A. ut.ut_id","","","","","A.K.A. ut.ut_line","","","A.K.A. ut.ut_user","",""],"i":[0,0,0,0,78,78,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,7,0,0,0,7,0,6,7,6,6,6,0,6,7,6,7,6,6,7,0,0,6,7,6,7,7,6,7,0,6,7,7,6,7,6,7,6,7,6,7,7,0,0,0,0,0,0,0,0,20,20,20,20,20,20,20,20,20,20,20,22,22,20,20,0,0,22,20,20,20,20,20,27,27,27,27,27,27,27,0,32,0,0,32,0,0,32,27,31,31,30,32,27,31,30,32,27,27,27,0,30,0,30,32,32,31,30,32,32,32,32,27,30,31,30,32,27,30,30,32,32,27,32,31,30,32,27,31,30,32,27,31,30,32,27,0,0,0,0,0,39,39,41,39,41,39,41,39,41,39,41,39,41,0,0,39,41,0,0,39,41,117,39,39,41,41,39,41,39,41,39,41,39,41,39,41,39,0,39,39,39,39,0,0,0,0,0,0,0,0,0,0,44,45,48,46,47,44,45,48,46,47,52,52,44,45,46,47,44,45,44,44,45,45,48,48,46,46,47,47,44,45,48,48,48,46,47,0,44,45,48,46,47,118,44,45,44,45,48,46,44,45,48,46,47,0,0,44,45,48,46,47,44,45,48,46,47,44,45,48,46,47,44,45,48,46,47,0,52,52,45,119,55,0,56,55,0,56,55,56,0,0,0,59,55,56,59,55,56,0,55,56,55,56,0,0,0,59,55,56,59,55,56,59,55,56,59,59,0,59,0,59,59,55,56,0,0,0,59,0,0,55,56,59,55,56,59,55,56,59,55,56,0,0,0,0,0,0,120,65,68,68,68,121,120,65,68,68,67,68,65,67,68,65,67,68,65,67,68,65,67,67,67,65,65,65,65,65,65,65,65,65,65,65,65,65,65,65,65,65,65,65,65,65,68,68,67,68,65,120,65,120,65,67,68,65,120,65,67,120,65,65,67,68,65,120,65,67,67,67,120,65,68,121,0,0,0,0,67,0,0,0,67,68,65,120,65,120,65,67,68,65,67,68,65,67,68,65,0,71,71,71,71,71,0,71,71,71,71,0,0,0,0,0,0,0,0,0,0,0,75,75,0,0,75,74,74,74,75,74,75,74,74,74,75,75,75,75,74,75,74,75,74,0,75,75,74,75,74,75,74,75,74,74,74,0,122,81,79,0,81,0,122,0,81,79,79,0,122,122,79,0,0,122,82,123,79,80,81,122,82,123,79,80,81,0,79,80,79,80,82,82,123,82,123,0,79,80,81,82,82,82,123,79,80,122,82,123,79,80,81,80,122,82,123,79,80,81,80,0,82,82,123,82,79,80,82,122,82,123,79,80,81,122,82,123,79,80,81,122,82,123,79,80,81,82,0,0,0,0,0,0,39,41,0,0,117,39,41,39,0,39,39,39,39,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,49,0,0,0,0,0,0,0,0,0,124,124,124,86,85,86,85,0,0,86,85,86,85,86,85,85,85,0,86,85,86,85,85,86,85,86,85,86,85,125,125,126,125,127,0,87,87,87,0,0,87,87,87,87,87,87,87,87,87,87,87,87,0,89,89,89,89,89,89,89,89,89,89,89,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,92,93,94,95,96,97,98,99,100,101,102,103,104,105,106,107,108,109,91,92,93,94,95,96,97,98,99,100,101,102,103,104,105,106,107,108,109,91,0,91,91,92,93,94,95,96,97,98,99,100,101,102,103,104,105,106,107,108,109,91,110,92,93,94,95,96,97,98,99,100,101,102,103,104,105,106,107,108,109,110,92,93,94,95,96,97,98,99,100,101,102,103,104,105,106,107,108,109,92,93,94,95,96,97,98,99,100,101,102,103,104,105,106,107,108,109,91,110,92,93,94,95,96,97,98,99,100,101,102,103,104,105,106,107,108,109,91,110,92,93,94,95,96,97,98,99,100,101,102,103,104,105,106,107,108,109,110,110,110,92,93,94,95,96,97,98,99,100,101,102,103,104,105,106,107,108,109,110,110,95,96,97,92,93,94,95,96,97,98,99,100,101,102,103,104,105,106,107,108,109,91,92,93,94,95,96,97,98,99,100,101,102,103,104,105,106,107,108,109,91,92,93,94,95,96,97,98,99,100,101,102,103,104,105,106,107,108,109,91,92,91,111,111,111,0,0,111,111,111,111,0,111,111,111,111,111,111,111,111,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,112,113,112,113,112,113,0,112,112,113,0,112,112,113,112,113,112,112,112,112,113,112,112,0,112,112,113,112,113,112,112,113,112,0,0],"f":[0,[[],1],0,0,[[],[[3,[2]]]],[[],[[3,[2]]]],0,0,0,0,0,0,[[],4],[4,2],0,0,[[],5],0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,[[],5],0,[[]],0,0,0,0,0,0,0,0,[[],4],0,0,0,0,0,0,0,0,0,0,0,0,0,0,[[]],[[]],[[]],[[]],[6,6],[[]],[7,8],[9,[[10,[6]]]],[9,2],[[6,6],5],[[7,7],5],[[6,11],12],[[7,11],12],[[7,11],12],[[]],[[]],[[6,13,4],[[15,[14]]]],[[]],[[]],[16],[[]],[[],2],[[],17],[[],17],[[],17],[[],17],[[],18],[[],18],[7,5],0,0,0,[[],19],[[],19],[[],19],0,0,[[]],[[]],[20,20],[[]],[[20,5],20],[[20,11],[[17,[21]]]],[[20,11],[[17,[21]]]],[[20,5],20],[[]],[[[0,[22,23]]],20],[[]],[[],20],[[],20],[4,20],[24,20],[[[25,[24]]],26],[[[25,[24]]],26],[[],20],[[]],[[],2],[[],17],[[],17],[[],18],0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[27,27],[[]],[27,28],[[[30,[29]]],28],[27,[[17,[2,31]]]],[[[30,[29]]],[[17,[2,31]]]],[[32,11],12],[[32,11],12],[[]],[[]],[33,32],[34,32],[35,32],[[]],[[]],[[[30,[29]],5],[[30,[29]]]],[[]],[[]],[[]],[[]],[[[30,[29]],36],[[30,[29]]]],[[29,27],[[30,[29]]]],[16],[32,[[15,[37]]]],[[]],[[],2],[[],17],[[],17],[[],17],[[],17],[[],17],[[],17],[[],17],[[],17],[[],18],[[],18],[[],18],[[],18],[[[30,[29]],4]],[[38,36,4],26],0,0,0,[39,[[3,[40]]]],[[]],[[]],[[]],[[]],[39,39],[41,41],[[]],[[]],[[39,11],12],[[41,11],12],[[]],[[]],[[],[[26,[[3,[40]]]]]],[[[15,[42]]],[[26,[[3,[40]]]]]],0,0,[40,[[26,[2]]]],[4,[[26,[40]]]],[[]],[[]],[[],[[26,[23]]]],[43,[[26,[39]]]],[4,[[26,[39]]]],[40,[[26,[41]]]],[4,[[26,[41]]]],0,0,[[]],[[]],[[],17],[[],17],[[],17],[[],17],[[],18],[[],18],0,[43,[[26,[2]]]],0,0,0,0,[4,[[26,[43]]]],0,0,0,0,0,0,0,0,0,[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[],8],[[],8],[44,8],[45,8],[46,8],[47,8],0,0,[[44,11],12],[[44,11],[[17,[21]]]],[[45,11],[[17,[21]]]],[[45,11],12],[[48,11],12],[[48,11],[[17,[21]]]],[[46,11],[[17,[21]]]],[[46,11],12],[[47,11],[[17,[21]]]],[[47,11],12],[[]],[[]],[49,48],[[]],[35,48],[[]],[[]],[[],8],[[]],[[]],[[]],[[]],[[]],[50],0,0,[[8,[51,[2]]],[[53,[52]]]],[[8,[51,[2]]],[[53,[52]]]],[[54,[51,[2]]],[[53,[52]]]],[8,[[53,[52]]]],[16],[16],[16],[16],[16],[8],[35,2],[[],2],[[],2],[[],2],[[],2],[[],2],[[],17],[[],17],[[],17],[[],17],[[],17],[[],17],[[],17],[[],17],[[],17],[[],17],[[],18],[[],18],[[],18],[[],18],[[],18],0,[[],5],[[],5],[45,5],[8],0,0,0,0,0,0,0,0,0,[[13,13],5],[[13,13],5],[[]],[[]],[[]],[[]],[[]],[[]],[[[25,[13]],55,56],[[26,[14]]]],[55,55],[56,56],[[]],[[]],[13,14],[[57,5],2],[[58,5],2],[[59,59],5],[[55,55],5],[[56,56],5],[59,60],[[55,11],12],[[56,11],12],[[]],[[]],[[]],[61,[[26,[59]]]],[[[25,[13]],5],[[26,[59]]]],0,[[59,62]],[[[26,[59]],[26,[59]]],5],[59,60],[[]],[[]],[[]],[13,5],[[[25,[13]],[25,[13]]],14],[13,14],[59,60],[[[25,[13]],[25,[13]],5],5],[13,[[63,[13]]]],[[]],[[]],[[],17],[[],17],[[],17],[[],17],[[],17],[[],17],[[],18],[[],18],[[],18],0,0,0,0,0,[[64,65],8],[[],60],[65,60],0,0,0,[[],60],[[],66],[65,66],0,0,[[]],[[]],[[]],[[]],[[]],[[]],[67,67],[68,68],[65,65],[[]],[[]],[[]],0,0,0,[[65,65],5],0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,[[67,11],12],[[68,11],12],[[65,11],[[17,[21]]]],[[],60],[65,60],[[],60],[65,60],[[]],[[]],[[]],[[],66],[65,66],0,[[],60],[65,60],[[65,62]],[[]],[[]],[[]],[[],60],[65,60],0,0,0,[[],60],[65,60],[65,68],[[],2],[[58,60],4],[66,[[63,[4]]]],[[66,66],2],[[],[[17,[[3,[67]],35]]]],0,[[[51,[[3,[69]]]]],[[17,[65,2]]]],0,[[64,65],8],[[]],[[]],[[]],[[],60],[65,60],[[],60],[65,60],[[],17],[[],17],[[],17],[[],17],[[],17],[[],17],[[],18],[[],18],[[],18],0,[[]],[[]],[[]],[[]],[[]],[[70,69],[[71,[70]]]],[[[71,[70]]],[[15,[[26,[[3,[69]]]]]]]],[[],17],[[],17],[[],18],[4,10],[4,[[10,[2]]]],[[],42],[4,[[17,[58,2]]]],[[42,4,5],[[17,[42,2]]]],[[42,4,42,5],[[17,[42,2]]]],[[[3,[2]]],5],[[],5],[[],5],[[]],[4,[[17,[72,73]]]],0,0,0,0,0,0,0,[[]],[[]],[[]],[[]],0,[[],74],0,[75,4],[[75,75],5],[[75,11],[[17,[21]]]],[[75,11],12],[[]],[[]],[[]],[[]],[[74,4],[[17,[60,75]]]],[4,[[17,[60,75]]]],[16],[[],2],[[],17],[[],17],[[],17],[[],17],[[],18],[[],18],[74,74],[[74,5],74],[[74,4],74],[4,[[17,[76,2]]]],0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[77,78,4,5],10],[79,79],[80,80],[[]],[[]],0,0,0,0,0,0,[[79,79],5],[[80,80],5],[[81,81],5],[82,10],0,0,0,[[79,11],12],[[80,11],12],[[]],[[]],[[]],[[]],[[]],[[]],0,[[]],[[]],[[]],[[]],[[]],[[]],0,0,0,0,0,0,[[]],[[]],0,[[],17],[[],17],[[],17],[[],17],[[],17],[[],17],[[],17],[[],17],[[],17],[[],17],[[],17],[[],17],[[],18],[[],18],[[],18],[[],18],[[],18],[[],18],0,[[[25,[13]],57,[15,[42]],[15,[42]],5,80],[[17,[2,2]]]],0,0,0,[[],[[26,[[3,[40]]]]]],[[[15,[42]]],[[26,[[3,[40]]]]]],0,0,[40,[[26,[2]]]],[4,[[26,[40]]]],[[],[[26,[23]]]],0,0,0,[43,[[26,[2]]]],0,0,0,0,[4,[[26,[43]]]],0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,[[49,50],10],[[],83],[[61,61,36],[[83,[36]]]],[[61,61,36],83],[61,[[83,[36]]]],0,[[],40],[[],43],[[],40],[[],43],[36,26],[36,26],[76,[[26,[[15,[84]]]]]],0,0,0,0,0,0,0,0,[[]],[[]],[[]],[[]],[85,85],[[]],[[24,86],2],[[]],[[]],[[]],[[]],[[]],[[],17],[[],17],[[],17],[[],17],[[],18],[[],18],0,0,0,0,0,0,[[]],[[]],[[87,87],88],[[],[[3,[87]]]],[36,5],[[87,87],5],[[87,11],12],[[]],[4,[[17,[[3,[87]],2]]]],[4,[[17,[87,4]]]],0,[[]],0,[[87,87],[[15,[88]]]],[[],17],[[],17],[[],18],0,[[]],[[]],0,[[]],[[1,36],89],[[]],[36,89],[89,15],[[],17],[[],17],[[],18],0,0,[[],[[17,[90]]]],[[],[[17,[90]]]],[36,5],[4,[[15,[36]]]],[36,[[15,[4]]]],0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[36,36],36],[91,5],[91,26],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[92],[93],[94],[95],[96],[97],[98],[99],[100],[101],[102],[103],[104],[105],[106],[107],[108],[109],[[]],[92],[93],[94],[95],[96],[97],[98],[99],[100],[101],[102],[103],[104],[105],[106],[107],[108],[109],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[]],[[],23],[[],92],[[],93],[[],94],[[],95],[[],96],[[],97],[[],98],[[],99],[[],100],[[],101],[[],102],[[],103],[[],104],[[],105],[[],106],[[],107],[[],108],[[],109],[[[53,[110]],5],91],[[],36],[92,36],[93,36],[94,36],[95,36],[96,36],[97,36],[98,36],[99,36],[100,36],[101,36],[102,36],[103,36],[104,36],[105,36],[106,36],[107,36],[108,36],[109,36],[[],36],[[],36],[[]],[92],[93],[94],[95],[96],[97],[98],[99],[100],[101],[102],[103],[104],[105],[106],[107],[108],[109],[[],2],[[],2],[95,2],[96,2],[97,2],[[],17],[[],17],[[],17],[[],17],[[],17],[[],17],[[],17],[[],17],[[],17],[[],17],[[],17],[[],17],[[],17],[[],17],[[],17],[[],17],[[],17],[[],17],[[],17],[[],17],[[],17],[[],17],[[],17],[[],17],[[],17],[[],17],[[],17],[[],17],[[],17],[[],17],[[],17],[[],17],[[],17],[[],17],[[],17],[[],17],[[],17],[[],17],[[],18],[[],18],[[],18],[[],18],[[],18],[[],18],[[],18],[[],18],[[],18],[[],18],[[],18],[[],18],[[],18],[[],18],[[],18],[[],18],[[],18],[[],18],[[],18],[36,92],[91,[[26,[36]]]],0,0,0,0,0,[[]],[[]],[111,111],[[]],[9,111],[[111,111],5],[[111,11],12],[[]],[[]],[[]],[[],17],[[],17],[[],18],0,0,[[],19],[[],19],0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,[[]],[[]],[[]],[[]],[112,[[26,[2]]]],[113],[[]],[112],[[]],[[]],[[],114],[112,2],[[]],[[]],[112,114],[[]],[112,5],[[],113],[[[25,[13]]],113],[112,115],[113,15],[112,8],[112,116],[[]],[112,2],[[],17],[[],17],[[],17],[[],17],[112,2],[[],18],[[],18],[112,2],[64,8],[[4,4],88]],"c":[],"p":[[8,"Iterator"],[3,"String"],[3,"Vec"],[15,"str"],[15,"bool"],[4,"BackupMode"],[4,"BackupError"],[15,"i32"],[3,"ArgMatches"],[6,"UResult"],[3,"Formatter"],[6,"Result"],[3,"Path"],[3,"PathBuf"],[4,"Option"],[3,"Demand"],[4,"Result"],[3,"TypeId"],[3,"Arg"],[3,"Quoted"],[3,"Error"],[8,"Quotable"],[8,"Sized"],[3,"OsStr"],[8,"AsRef"],[6,"Result"],[4,"Format"],[6,"DecodeResult"],[8,"Read"],[3,"Data"],[4,"EncodeError"],[4,"DecodeError"],[4,"DecodeError"],[3,"DecodeError"],[3,"Error"],[15,"usize"],[8,"Error"],[8,"Write"],[3,"Passwd"],[6,"gid_t"],[3,"Group"],[15,"u32"],[6,"uid_t"],[3,"USimpleError"],[3,"UUsageError"],[3,"ExitCode"],[3,"ClapErrorWrapper"],[3,"UIoError"],[6,"Error"],[8,"FnOnce"],[8,"Into"],[8,"UError"],[3,"Box"],[4,"ErrorKind"],[4,"MissingHandling"],[4,"ResolveMode"],[3,"Metadata"],[6,"mode_t"],[3,"FileInformation"],[15,"u64"],[8,"AsRawFd"],[8,"Hasher"],[4,"Cow"],[15,"i8"],[3,"statfs_fn"],[15,"i64"],[3,"MountInfo"],[3,"FsUsage"],[15,"u8"],[8,"BufRead"],[3,"Lines"],[3,"Pattern"],[3,"PatternError"],[3,"Parser"],[4,"ParseSizeError"],[3,"Duration"],[3,"Command"],[8,"Args"],[4,"VerbosityLevel"],[3,"Verbosity"],[4,"TraverseSymlinks"],[3,"ChownExecutor"],[6,"Result"],[3,"ExitStatus"],[4,"Quotes"],[4,"QuotingStyle"],[3,"Range"],[4,"Ordering"],[3,"RingBuffer"],[4,"Errno"],[3,"DigestWriter"],[3,"Blake2b"],[3,"Blake3"],[3,"Sm3"],[3,"CRC"],[3,"BSD"],[3,"SYSV"],[3,"Md5"],[3,"Sha1"],[3,"Sha224"],[3,"Sha256"],[3,"Sha384"],[3,"Sha512"],[3,"Sha3_224"],[3,"Sha3_256"],[3,"Sha3_384"],[3,"Sha3_512"],[3,"Shake128"],[3,"Shake256"],[8,"Digest"],[4,"UpdateMode"],[3,"Utmpx"],[3,"UtmpxIter"],[3,"utmpx"],[3,"OffsetDateTime"],[15,"i16"],[8,"Locate"],[8,"FromIo"],[8,"UClapError"],[8,"FsMeta"],[8,"BirthTime"],[4,"IfFrom"],[3,"GidUidOwnerFilter"],[8,"ChildExt"],[13,"Shell"],[13,"C"],[13,"Literal"]]},\ "uucore_procs":{"doc":"","t":"OOOX","n":["help_about","help_section","help_usage","main"],"q":[[0,"uucore_procs"]],"d":["Get the about text from the help file.","Reads a section from a file of the util as a str literal.","Get the usage from the help file.",""],"i":[0,0,0,0],"f":[0,0,0,0],"c":[],"p":[]},\ "uudoc":{"doc":"","t":"DGLLLLLMLLLLLFLLFLMMLLMLLLLFMLLM","n":["MDWriter","UtilityMap","about","additional","after_help","borrow","borrow_mut","command","deref","deref_mut","drop","examples","from","get_zip_content","init","into","main","markdown","markdown","name","options","platforms","tldr_zip","try_from","try_into","type_id","usage","util_map","utils_per_platform","version","vzip","w"],"q":[[0,"uudoc"]],"d":["","","","","","","","","","","","","Returns the argument unchanged.","","","Calls U::from(self).","","","","","","","","","","","","","","","",""],"i":[0,0,1,1,1,1,1,1,1,1,1,1,1,0,1,1,0,1,1,1,1,1,1,1,1,1,1,0,1,1,1,1],"f":[0,0,[1,2],[1,2],[1,2],[[]],[[]],0,[3],[3],[3],[1,2],[[]],[[[6,[[0,[4,5]]]],7],[[9,[8]]]],[[],3],[[]],[[],2],[1,2],0,0,[1,2],[1,2],0,[[],10],[[],10],[[],11],[1,2],[[],[[12,[7]]]],0,[1,2],[[]],0],"c":[],"p":[[3,"MDWriter"],[6,"Result"],[15,"usize"],[8,"Read"],[8,"Seek"],[3,"ZipArchive"],[15,"str"],[3,"String"],[4,"Option"],[4,"Result"],[3,"TypeId"],[3,"Map"]]},\ "uuhelp_parser":{"doc":"A collection of functions to parse the markdown code of …","t":"FFF","n":["parse_about","parse_section","parse_usage"],"q":[[0,"uuhelp_parser"]],"d":["Parses the text between the first markdown code block and …","Get a single section from content","Parses the first markdown code block into a usage string"],"i":[0,0,0],"f":[[1,2],[[1,1],[[3,[2]]]],[1,2]],"c":[],"p":[[15,"str"],[3,"String"],[4,"Option"]]},\ diff --git a/dev/uu_chgrp/entries/struct.Group.html b/dev/uu_chgrp/entries/struct.Group.html index a3ad14d57..8bc996d54 100644 --- a/dev/uu_chgrp/entries/struct.Group.html +++ b/dev/uu_chgrp/entries/struct.Group.html @@ -3,7 +3,7 @@ pub gid: u32, }

Fields§

§name: String

AKA group.gr_name

§gid: u32

AKA group.gr_gid

-

Trait Implementations§

§

impl Clone for Group

§

fn clone(&self) -> Group

Returns a copy of the value. Read more
1.0.0 · source§

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source. Read more
§

impl Debug for Group

§

fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>

Formats the value using the given formatter. Read more
§

impl<'a> Locate<&'a str> for Group

§

fn locate(k: &'a str) -> Result<Group, Error>

§

impl Locate<u32> for Group

§

fn locate(k: u32) -> Result<Group, Error>

Auto Trait Implementations§

§

impl RefUnwindSafe for Group

§

impl Send for Group

§

impl Sync for Group

§

impl Unpin for Group

§

impl UnwindSafe for Group

Blanket Implementations§

source§

impl<T> Any for Twhere +

Trait Implementations§

§

impl Clone for Group

§

fn clone(&self) -> Group

Returns a copy of the value. Read more
1.0.0 · source§

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source. Read more
§

impl Debug for Group

§

fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>

Formats the value using the given formatter. Read more
§

impl<'a> Locate<&'a str> for Group

§

fn locate(k: &'a str) -> Result<Group, Error>

§

impl Locate<u32> for Group

§

fn locate(k: u32) -> Result<Group, Error>

Auto Trait Implementations§

§

impl RefUnwindSafe for Group

§

impl Send for Group

§

impl Sync for Group

§

impl Unpin for Group

§

impl UnwindSafe for Group

Blanket Implementations§

source§

impl<T> Any for Twhere T: 'static + ?Sized,

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for Twhere T: ?Sized,

const: unstable · source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for Twhere T: ?Sized,

const: unstable · source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

const: unstable · source§

fn from(t: T) -> T

Returns the argument unchanged.

diff --git a/dev/uu_chgrp/entries/struct.Passwd.html b/dev/uu_chgrp/entries/struct.Passwd.html index df5482c80..1aa15d9dd 100644 --- a/dev/uu_chgrp/entries/struct.Passwd.html +++ b/dev/uu_chgrp/entries/struct.Passwd.html @@ -27,7 +27,7 @@ call getgrouplist().

not update ngroups if ngroups is too small. Therefore, if not updated by getgrouplist, ngroups needs to be increased in a loop until getgrouplist stops returning -1.

-

Trait Implementations§

§

impl Clone for Passwd

§

fn clone(&self) -> Passwd

Returns a copy of the value. Read more
1.0.0 · source§

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source. Read more
§

impl Debug for Passwd

§

fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>

Formats the value using the given formatter. Read more
§

impl<'a> Locate<&'a str> for Passwd

§

fn locate(k: &'a str) -> Result<Passwd, Error>

§

impl Locate<u32> for Passwd

§

fn locate(k: u32) -> Result<Passwd, Error>

Auto Trait Implementations§

§

impl RefUnwindSafe for Passwd

§

impl Send for Passwd

§

impl Sync for Passwd

§

impl Unpin for Passwd

§

impl UnwindSafe for Passwd

Blanket Implementations§

source§

impl<T> Any for Twhere +

Trait Implementations§

§

impl Clone for Passwd

§

fn clone(&self) -> Passwd

Returns a copy of the value. Read more
1.0.0 · source§

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source. Read more
§

impl Debug for Passwd

§

fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>

Formats the value using the given formatter. Read more
§

impl<'a> Locate<&'a str> for Passwd

§

fn locate(k: &'a str) -> Result<Passwd, Error>

§

impl Locate<u32> for Passwd

§

fn locate(k: u32) -> Result<Passwd, Error>

Auto Trait Implementations§

§

impl RefUnwindSafe for Passwd

§

impl Send for Passwd

§

impl Sync for Passwd

§

impl Unpin for Passwd

§

impl UnwindSafe for Passwd

Blanket Implementations§

source§

impl<T> Any for Twhere T: 'static + ?Sized,

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for Twhere T: ?Sized,

const: unstable · source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for Twhere T: ?Sized,

const: unstable · source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

const: unstable · source§

fn from(t: T) -> T

Returns the argument unchanged.

diff --git a/dev/uu_chown/entries/struct.Group.html b/dev/uu_chown/entries/struct.Group.html index d090b238c..ceb458d46 100644 --- a/dev/uu_chown/entries/struct.Group.html +++ b/dev/uu_chown/entries/struct.Group.html @@ -3,7 +3,7 @@ pub gid: u32, }

Fields§

§name: String

AKA group.gr_name

§gid: u32

AKA group.gr_gid

-

Trait Implementations§

§

impl Clone for Group

§

fn clone(&self) -> Group

Returns a copy of the value. Read more
1.0.0 · source§

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source. Read more
§

impl Debug for Group

§

fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>

Formats the value using the given formatter. Read more
§

impl<'a> Locate<&'a str> for Group

§

fn locate(k: &'a str) -> Result<Group, Error>

§

impl Locate<u32> for Group

§

fn locate(k: u32) -> Result<Group, Error>

Auto Trait Implementations§

§

impl RefUnwindSafe for Group

§

impl Send for Group

§

impl Sync for Group

§

impl Unpin for Group

§

impl UnwindSafe for Group

Blanket Implementations§

source§

impl<T> Any for Twhere +

Trait Implementations§

§

impl Clone for Group

§

fn clone(&self) -> Group

Returns a copy of the value. Read more
1.0.0 · source§

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source. Read more
§

impl Debug for Group

§

fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>

Formats the value using the given formatter. Read more
§

impl<'a> Locate<&'a str> for Group

§

fn locate(k: &'a str) -> Result<Group, Error>

§

impl Locate<u32> for Group

§

fn locate(k: u32) -> Result<Group, Error>

Auto Trait Implementations§

§

impl RefUnwindSafe for Group

§

impl Send for Group

§

impl Sync for Group

§

impl Unpin for Group

§

impl UnwindSafe for Group

Blanket Implementations§

source§

impl<T> Any for Twhere T: 'static + ?Sized,

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for Twhere T: ?Sized,

const: unstable · source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for Twhere T: ?Sized,

const: unstable · source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

const: unstable · source§

fn from(t: T) -> T

Returns the argument unchanged.

diff --git a/dev/uu_chown/entries/struct.Passwd.html b/dev/uu_chown/entries/struct.Passwd.html index 69c505a5a..34010ab7a 100644 --- a/dev/uu_chown/entries/struct.Passwd.html +++ b/dev/uu_chown/entries/struct.Passwd.html @@ -27,7 +27,7 @@ call getgrouplist().

not update ngroups if ngroups is too small. Therefore, if not updated by getgrouplist, ngroups needs to be increased in a loop until getgrouplist stops returning -1.

-

Trait Implementations§

§

impl Clone for Passwd

§

fn clone(&self) -> Passwd

Returns a copy of the value. Read more
1.0.0 · source§

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source. Read more
§

impl Debug for Passwd

§

fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>

Formats the value using the given formatter. Read more
§

impl<'a> Locate<&'a str> for Passwd

§

fn locate(k: &'a str) -> Result<Passwd, Error>

§

impl Locate<u32> for Passwd

§

fn locate(k: u32) -> Result<Passwd, Error>

Auto Trait Implementations§

Blanket Implementations§

source§

impl<T> Any for Twhere +

Trait Implementations§

§

impl Clone for Passwd

§

fn clone(&self) -> Passwd

Returns a copy of the value. Read more
1.0.0 · source§

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source. Read more
§

impl Debug for Passwd

§

fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>

Formats the value using the given formatter. Read more
§

impl<'a> Locate<&'a str> for Passwd

§

fn locate(k: &'a str) -> Result<Passwd, Error>

§

impl Locate<u32> for Passwd

§

fn locate(k: u32) -> Result<Passwd, Error>

Auto Trait Implementations§

§

impl RefUnwindSafe for Passwd

§

impl Send for Passwd

§

impl Sync for Passwd

§

impl Unpin for Passwd

§

impl UnwindSafe for Passwd

Blanket Implementations§

source§

impl<T> Any for Twhere T: 'static + ?Sized,

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for Twhere T: ?Sized,

const: unstable · source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for Twhere T: ?Sized,

const: unstable · source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

const: unstable · source§

fn from(t: T) -> T

Returns the argument unchanged.

diff --git a/dev/uu_chown/struct.Group.html b/dev/uu_chown/struct.Group.html index b1a18f421..51186132c 100644 --- a/dev/uu_chown/struct.Group.html +++ b/dev/uu_chown/struct.Group.html @@ -3,7 +3,7 @@ pub gid: u32, }

Fields§

§name: String

AKA group.gr_name

§gid: u32

AKA group.gr_gid

-

Trait Implementations§

§

impl Clone for Group

§

fn clone(&self) -> Group

Returns a copy of the value. Read more
1.0.0 · source§

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source. Read more
§

impl Debug for Group

§

fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>

Formats the value using the given formatter. Read more
§

impl<'a> Locate<&'a str> for Group

§

fn locate(k: &'a str) -> Result<Group, Error>

§

impl Locate<u32> for Group

§

fn locate(k: u32) -> Result<Group, Error>

Auto Trait Implementations§

§

impl RefUnwindSafe for Group

§

impl Send for Group

§

impl Sync for Group

§

impl Unpin for Group

§

impl UnwindSafe for Group

Blanket Implementations§

source§

impl<T> Any for Twhere +

Trait Implementations§

§

impl Clone for Group

§

fn clone(&self) -> Group

Returns a copy of the value. Read more
1.0.0 · source§

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source. Read more
§

impl Debug for Group

§

fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>

Formats the value using the given formatter. Read more
§

impl<'a> Locate<&'a str> for Group

§

fn locate(k: &'a str) -> Result<Group, Error>

§

impl Locate<u32> for Group

§

fn locate(k: u32) -> Result<Group, Error>

Auto Trait Implementations§

§

impl RefUnwindSafe for Group

§

impl Send for Group

§

impl Sync for Group

§

impl Unpin for Group

§

impl UnwindSafe for Group

Blanket Implementations§

source§

impl<T> Any for Twhere T: 'static + ?Sized,

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for Twhere T: ?Sized,

const: unstable · source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for Twhere T: ?Sized,

const: unstable · source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

const: unstable · source§

fn from(t: T) -> T

Returns the argument unchanged.

diff --git a/dev/uu_chown/struct.Passwd.html b/dev/uu_chown/struct.Passwd.html index ef75cb832..a52754c88 100644 --- a/dev/uu_chown/struct.Passwd.html +++ b/dev/uu_chown/struct.Passwd.html @@ -27,7 +27,7 @@ call getgrouplist().

not update ngroups if ngroups is too small. Therefore, if not updated by getgrouplist, ngroups needs to be increased in a loop until getgrouplist stops returning -1.

-

Trait Implementations§

§

impl Clone for Passwd

§

fn clone(&self) -> Passwd

Returns a copy of the value. Read more
1.0.0 · source§

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source. Read more
§

impl Debug for Passwd

§

fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>

Formats the value using the given formatter. Read more
§

impl<'a> Locate<&'a str> for Passwd

§

fn locate(k: &'a str) -> Result<Passwd, Error>

§

impl Locate<u32> for Passwd

§

fn locate(k: u32) -> Result<Passwd, Error>

Auto Trait Implementations§

Blanket Implementations§

source§

impl<T> Any for Twhere +

Trait Implementations§

§

impl Clone for Passwd

§

fn clone(&self) -> Passwd

Returns a copy of the value. Read more
1.0.0 · source§

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source. Read more
§

impl Debug for Passwd

§

fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>

Formats the value using the given formatter. Read more
§

impl<'a> Locate<&'a str> for Passwd

§

fn locate(k: &'a str) -> Result<Passwd, Error>

§

impl Locate<u32> for Passwd

§

fn locate(k: u32) -> Result<Passwd, Error>

Auto Trait Implementations§

§

impl RefUnwindSafe for Passwd

§

impl Send for Passwd

§

impl Sync for Passwd

§

impl Unpin for Passwd

§

impl UnwindSafe for Passwd

Blanket Implementations§

source§

impl<T> Any for Twhere T: 'static + ?Sized,

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for Twhere T: ?Sized,

const: unstable · source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for Twhere T: ?Sized,

const: unstable · source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

const: unstable · source§

fn from(t: T) -> T

Returns the argument unchanged.

diff --git a/dev/uu_cp/enum.Error.html b/dev/uu_cp/enum.Error.html index 8e00d96c1..490259454 100644 --- a/dev/uu_cp/enum.Error.html +++ b/dev/uu_cp/enum.Error.html @@ -24,7 +24,7 @@ Currently happens when “no” is selected in interactive mode

path, but those that are not implemented yet should return a NotImplemented error.

§

Backup(String)

Invalid arguments to backup

-
§

NotADirectory(PathBuf)

Trait Implementations§

source§

impl Debug for Error

source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
source§

impl Display for Error

source§

fn fmt(&self, fmt: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
source§

impl Error for Error

source§

fn source(&self) -> Option<&(dyn Error + 'static)>

The lower-level source of this error, if any. Read more
1.0.0 · source§

fn description(&self) -> &str

👎Deprecated since 1.42.0: use the Display impl or to_string()
Read more
1.0.0 · source§

fn cause(&self) -> Option<&dyn Error>

👎Deprecated since 1.33.0: replaced by Error::source, which can support downcasting
source§

fn provide<'a>(&'a self, demand: &mut Demand<'a>)

🔬This is a nightly-only experimental API. (error_generic_member_access)
Provides type based access to context intended for error reports. Read more
source§

impl From<&'static str> for Error

source§

fn from(err: &'static str) -> Error

Converts to this type from the input type.
source§

impl<'a> From<Context<&'a str, Error>> for Error

source§

fn from($crate::Context: Context<&'a str, Error>) -> Error

Converts to this type from the input type.
source§

impl<'a> From<Context<String, Error>> for Error

source§

fn from($crate::Context: Context<String, Error>) -> Error

Converts to this type from the input type.
source§

impl From<Error> for Error

source§

fn from(err: Error) -> Error

Converts to this type from the input type.
source§

impl From<Error> for Error

source§

fn from(err: Error) -> Error

Converts to this type from the input type.
source§

impl From<String> for Error

source§

fn from(err: String) -> Error

Converts to this type from the input type.
source§

impl From<StripPrefixError> for Error

source§

fn from(err: StripPrefixError) -> Error

Converts to this type from the input type.
source§

impl UError for Error

source§

fn code(&self) -> i32

Error code of a custom error. Read more
§

fn usage(&self) -> bool

Print usage help to a custom error. Read more

Auto Trait Implementations§

§

impl !RefUnwindSafe for Error

§

impl Send for Error

§

impl Sync for Error

§

impl Unpin for Error

§

impl !UnwindSafe for Error

Blanket Implementations§

source§

impl<T> Any for Twhere +

§

NotADirectory(PathBuf)

Trait Implementations§

source§

impl Debug for Error

source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
source§

impl Display for Error

source§

fn fmt(&self, fmt: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
source§

impl Error for Error

source§

fn source(&self) -> Option<&(dyn Error + 'static)>

The lower-level source of this error, if any. Read more
1.0.0 · source§

fn description(&self) -> &str

👎Deprecated since 1.42.0: use the Display impl or to_string()
Read more
1.0.0 · source§

fn cause(&self) -> Option<&dyn Error>

👎Deprecated since 1.33.0: replaced by Error::source, which can support downcasting
source§

fn provide<'a>(&'a self, demand: &mut Demand<'a>)

🔬This is a nightly-only experimental API. (error_generic_member_access)
Provides type based access to context intended for error reports. Read more
source§

impl From<&'static str> for Error

source§

fn from(err: &'static str) -> Error

Converts to this type from the input type.
source§

impl<'a> From<Context<&'a str, Error>> for Error

source§

fn from($crate::Context: Context<&'a str, Error>) -> Error

Converts to this type from the input type.
source§

impl<'a> From<Context<String, Error>> for Error

source§

fn from($crate::Context: Context<String, Error>) -> Error

Converts to this type from the input type.
source§

impl From<Error> for Error

source§

fn from(err: Error) -> Error

Converts to this type from the input type.
source§

impl From<Error> for Error

source§

fn from(err: Error) -> Error

Converts to this type from the input type.
source§

impl From<String> for Error

source§

fn from(err: String) -> Error

Converts to this type from the input type.
source§

impl From<StripPrefixError> for Error

source§

fn from(err: StripPrefixError) -> Error

Converts to this type from the input type.
source§

impl UError for Error

source§

fn code(&self) -> i32

Error code of a custom error. Read more
§

fn usage(&self) -> bool

Print usage help to a custom error. Read more

Auto Trait Implementations§

§

impl !RefUnwindSafe for Error

§

impl Send for Error

§

impl Sync for Error

§

impl Unpin for Error

§

impl !UnwindSafe for Error

Blanket Implementations§

source§

impl<T> Any for Twhere T: 'static + ?Sized,

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for Twhere T: ?Sized,

const: unstable · source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for Twhere T: ?Sized,

const: unstable · source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

const: unstable · source§

fn from(t: T) -> T

Returns the argument unchanged.

diff --git a/dev/uu_numfmt/format/struct.WhitespaceSplitter.html b/dev/uu_numfmt/format/struct.WhitespaceSplitter.html index b8ae3be04..9b0e95533 100644 --- a/dev/uu_numfmt/format/struct.WhitespaceSplitter.html +++ b/dev/uu_numfmt/format/struct.WhitespaceSplitter.html @@ -204,86 +204,89 @@ function. From<T> for U chooses to do.

source§

impl<I> IntoIterator for Iwhere - I: Iterator,

§

type Item = <I as Iterator>::Item

The type of the elements being iterated over.
§

type IntoIter = I

Which kind of iterator are we turning this into?
const: unstable · source§

fn into_iter(self) -> I

Creates an iterator from a value. Read more
source§

impl<T> Itertools for Twhere - T: Iterator + ?Sized,

source§

fn interleave<J>( + I: Iterator,

§

type Item = <I as Iterator>::Item

The type of the elements being iterated over.
§

type IntoIter = I

Which kind of iterator are we turning this into?
const: unstable · source§

fn into_iter(self) -> I

Creates an iterator from a value. Read more
source§

impl<T> Itertools for Twhere + T: Iterator + ?Sized,

source§

fn interleave<J>( self, other: J ) -> Interleave<Self, <J as IntoIterator>::IntoIter>where J: IntoIterator<Item = Self::Item>, - Self: Sized,

Alternate elements from two iterators until both have run out. Read more
source§

fn interleave_shortest<J>( + Self: Sized,

Alternate elements from two iterators until both have run out. Read more
source§

fn interleave_shortest<J>( self, other: J ) -> InterleaveShortest<Self, <J as IntoIterator>::IntoIter>where J: IntoIterator<Item = Self::Item>, Self: Sized,

Alternate elements from two iterators until at least one of them has run -out. Read more
source§

fn intersperse( +out. Read more

source§

fn intersperse( self, element: Self::Item ) -> IntersperseWith<Self, IntersperseElementSimple<Self::Item>>where Self: Sized, Self::Item: Clone,

An iterator adaptor to insert a particular value -between each element of the adapted iterator. Read more
source§

fn intersperse_with<F>(self, element: F) -> IntersperseWith<Self, F>where +between each element of the adapted iterator. Read more

source§

fn intersperse_with<F>(self, element: F) -> IntersperseWith<Self, F>where Self: Sized, F: FnMut() -> Self::Item,

An iterator adaptor to insert a particular value created by a function -between each element of the adapted iterator. Read more
source§

fn zip_longest<J>( +between each element of the adapted iterator. Read more

source§

fn zip_longest<J>( self, other: J ) -> ZipLongest<Self, <J as IntoIterator>::IntoIter>where J: IntoIterator, Self: Sized,

Create an iterator which iterates over both this and the specified -iterator simultaneously, yielding pairs of two optional elements. Read more
source§

fn zip_eq<J>(self, other: J) -> ZipEq<Self, <J as IntoIterator>::IntoIter>where +iterator simultaneously, yielding pairs of two optional elements. Read more

source§

fn zip_eq<J>(self, other: J) -> ZipEq<Self, <J as IntoIterator>::IntoIter>where J: IntoIterator, Self: Sized,

Create an iterator which iterates over both this and the specified -iterator simultaneously, yielding pairs of elements. Read more
source§

fn batching<B, F>(self, f: F) -> Batching<Self, F>where +iterator simultaneously, yielding pairs of elements. Read more

source§

fn batching<B, F>(self, f: F) -> Batching<Self, F>where F: FnMut(&mut Self) -> Option<B>, Self: Sized,

A “meta iterator adaptor”. Its closure receives a reference to the iterator and may pick off as many elements as it likes, to produce the -next iterator element. Read more
source§

fn group_by<K, F>(self, key: F) -> GroupBy<K, Self, F>where +next iterator element. Read more

source§

fn group_by<K, F>(self, key: F) -> GroupBy<K, Self, F>where Self: Sized, F: FnMut(&Self::Item) -> K, K: PartialEq<K>,

Return an iterable that can group iterator elements. Consecutive elements that map to the same key (“runs”), are assigned -to the same group. Read more
source§

fn chunks(self, size: usize) -> IntoChunks<Self>where - Self: Sized,

Return an iterable that can chunk the iterator. Read more
source§

fn tuple_windows<T>(self) -> TupleWindows<Self, T>where +to the same group. Read more

source§

fn chunks(self, size: usize) -> IntoChunks<Self>where + Self: Sized,

Return an iterable that can chunk the iterator. Read more
source§

fn tuple_windows<T>(self) -> TupleWindows<Self, T>where Self: Sized + Iterator<Item = <T as TupleCollect>::Item>, T: HomogeneousTuple, <T as TupleCollect>::Item: Clone,

Return an iterator over all contiguous windows producing tuples of -a specific size (up to 12). Read more
source§

fn circular_tuple_windows<T>(self) -> CircularTupleWindows<Self, T>where +a specific size (up to 12). Read more

source§

fn circular_tuple_windows<T>(self) -> CircularTupleWindows<Self, T>where Self: Sized + Clone + Iterator<Item = <T as TupleCollect>::Item> + ExactSizeIterator, T: TupleCollect + Clone, <T as TupleCollect>::Item: Clone,

Return an iterator over all windows, wrapping back to the first elements when the window would otherwise exceed the length of the -iterator, producing tuples of a specific size (up to 12). Read more
source§

fn tuples<T>(self) -> Tuples<Self, T>where +iterator, producing tuples of a specific size (up to 12). Read more

source§

fn tuples<T>(self) -> Tuples<Self, T>where Self: Sized + Iterator<Item = <T as TupleCollect>::Item>, T: HomogeneousTuple,

Return an iterator that groups the items in tuples of a specific size -(up to 12). Read more
source§

fn tee(self) -> (Tee<Self>, Tee<Self>)where +(up to 12). Read more

source§

fn tee(self) -> (Tee<Self>, Tee<Self>)where Self: Sized, Self::Item: Clone,

Split into an iterator pair that both yield all elements from -the original iterator. Read more
source§

fn step(self, n: usize) -> Step<Self>where +the original iterator. Read more

source§

fn step(self, n: usize) -> Step<Self>where Self: Sized,

👎Deprecated since 0.8.0: Use std .step_by() instead
Return an iterator adaptor that steps n elements in the base iterator -for each iteration. Read more
source§

fn map_into<R>(self) -> MapSpecialCase<Self, MapSpecialCaseFnInto<R>>where +for each iteration. Read more

source§

fn map_into<R>(self) -> MapSpecialCase<Self, MapSpecialCaseFnInto<R>>where Self: Sized, - Self::Item: Into<R>,

Convert each item of the iterator using the Into trait. Read more
source§

fn map_results<F, T, U, E>( + Self::Item: Into<R>,

Convert each item of the iterator using the Into trait. Read more
source§

fn map_results<F, T, U, E>( self, f: F ) -> MapSpecialCase<Self, MapSpecialCaseFnOk<F>>where Self: Iterator<Item = Result<T, E>> + Sized, - F: FnMut(T) -> U,

👎Deprecated since 0.10.0: Use .map_ok() instead
See .map_ok().
source§

fn map_ok<F, T, U, E>(self, f: F) -> MapSpecialCase<Self, MapSpecialCaseFnOk<F>>where + F: FnMut(T) -> U,

👎Deprecated since 0.10.0: Use .map_ok() instead
See .map_ok().
source§

fn map_ok<F, T, U, E>(self, f: F) -> MapSpecialCase<Self, MapSpecialCaseFnOk<F>>where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(T) -> U,

Return an iterator adaptor that applies the provided closure to every Result::Ok value. Result::Err values are -unchanged. Read more
source§

fn filter_ok<F, T, E>(self, f: F) -> FilterOk<Self, F>where +unchanged. Read more

source§

fn filter_ok<F, T, E>(self, f: F) -> FilterOk<Self, F>where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(&T) -> bool,

Return an iterator adaptor that filters every Result::Ok value with the provided closure. Result::Err values are -unchanged. Read more
source§

fn filter_map_ok<F, T, U, E>(self, f: F) -> FilterMapOk<Self, F>where +unchanged. Read more

source§

fn filter_map_ok<F, T, U, E>(self, f: F) -> FilterMapOk<Self, F>where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(T) -> Option<U>,

Return an iterator adaptor that filters and transforms every Result::Ok value with the provided closure. Result::Err -values are unchanged. Read more
source§

fn flatten_ok<T, E>(self) -> FlattenOk<Self, T, E>where +values are unchanged. Read more

source§

fn flatten_ok<T, E>(self) -> FlattenOk<Self, T, E>where Self: Iterator<Item = Result<T, E>> + Sized, T: IntoIterator,

Return an iterator adaptor that flattens every Result::Ok value into -a series of Result::Ok values. Result::Err values are unchanged. Read more
source§

fn merge<J>( +a series of Result::Ok values. Result::Err values are unchanged. Read more

source§

fn process_results<F, T, E, R>(self, processor: F) -> Result<R, E>where + Self: Iterator<Item = Result<T, E>> + Sized, + F: FnOnce(ProcessResults<'_, Self, E>) -> R,

“Lift” a function of the values of the current iterator so as to process +an iterator of Result values instead. Read more
source§

fn merge<J>( self, other: J ) -> MergeBy<Self, <J as IntoIterator>::IntoIter, MergeLte>where @@ -291,7 +294,7 @@ a series of Result::Ok values. Result::Err values are Self::Item: PartialOrd<Self::Item>, J: IntoIterator<Item = Self::Item>,

Return an iterator adaptor that merges the two base iterators in ascending order. If both base iterators are sorted (ascending), the -result is sorted. Read more
source§

fn merge_by<J, F>( +result is sorted. Read more

source§

fn merge_by<J, F>( self, other: J, is_first: F @@ -299,26 +302,27 @@ result is sorted. Sized, J: IntoIterator<Item = Self::Item>, F: FnMut(&Self::Item, &Self::Item) -> bool,

Return an iterator adaptor that merges the two base iterators in order. -This is much like .merge() but allows for a custom ordering. Read more
source§

fn merge_join_by<J, F>( +This is much like .merge() but allows for a custom ordering. Read more

source§

fn merge_join_by<J, F, T>( self, other: J, cmp_fn: F ) -> MergeJoinBy<Self, <J as IntoIterator>::IntoIter, F>where J: IntoIterator, - F: FnMut(&Self::Item, &<J as IntoIterator>::Item) -> Ordering, + F: FnMut(&Self::Item, &<J as IntoIterator>::Item) -> T, + T: OrderingOrBool<Self::Item, <J as IntoIterator>::Item>, Self: Sized,

Create an iterator that merges items from both this and the specified -iterator in ascending order. Read more
source§

fn kmerge(self) -> KMergeBy<<Self::Item as IntoIterator>::IntoIter, KMergeByLt>where +iterator in ascending order. Read more

source§

fn kmerge(self) -> KMergeBy<<Self::Item as IntoIterator>::IntoIter, KMergeByLt>where Self: Sized, Self::Item: IntoIterator, <Self::Item as IntoIterator>::Item: PartialOrd<<Self::Item as IntoIterator>::Item>,

Return an iterator adaptor that flattens an iterator of iterators by -merging them in ascending order. Read more
source§

fn kmerge_by<F>( +merging them in ascending order. Read more

source§

fn kmerge_by<F>( self, first: F ) -> KMergeBy<<Self::Item as IntoIterator>::IntoIter, F>where Self: Sized, Self::Item: IntoIterator, F: FnMut(&<Self::Item as IntoIterator>::Item, &<Self::Item as IntoIterator>::Item) -> bool,

Return an iterator adaptor that flattens an iterator of iterators by -merging them according to the given closure. Read more
source§

fn cartesian_product<J>( +merging them according to the given closure. Read more

source§

fn cartesian_product<J>( self, other: J ) -> Product<Self, <J as IntoIterator>::IntoIter>where @@ -326,32 +330,32 @@ merging them according to the given closure. Item: Clone, J: IntoIterator, <J as IntoIterator>::IntoIter: Clone,

Return an iterator adaptor that iterates over the cartesian product of -the element sets of two iterators self and J. Read more
source§

fn multi_cartesian_product( +the element sets of two iterators self and J. Read more

source§

fn multi_cartesian_product( self ) -> MultiProduct<<Self::Item as IntoIterator>::IntoIter>where Self: Sized, Self::Item: IntoIterator, <Self::Item as IntoIterator>::IntoIter: Clone, <Self::Item as IntoIterator>::Item: Clone,

Return an iterator adaptor that iterates over the cartesian product of -all subiterators returned by meta-iterator self. Read more
source§

fn coalesce<F>(self, f: F) -> CoalesceBy<Self, F, Self::Item>where +all subiterators returned by meta-iterator self. Read more

source§

fn coalesce<F>(self, f: F) -> CoalesceBy<Self, F, Self::Item>where Self: Sized, F: FnMut(Self::Item, Self::Item) -> Result<Self::Item, (Self::Item, Self::Item)>,

Return an iterator adaptor that uses the passed-in closure to -optionally merge together consecutive elements. Read more
source§

fn dedup(self) -> CoalesceBy<Self, DedupPred2CoalescePred<DedupEq>, Self::Item>where +optionally merge together consecutive elements. Read more

source§

fn dedup(self) -> CoalesceBy<Self, DedupPred2CoalescePred<DedupEq>, Self::Item>where Self: Sized, Self::Item: PartialEq<Self::Item>,

Remove duplicates from sections of consecutive identical elements. -If the iterator is sorted, all elements will be unique. Read more
source§

fn dedup_by<Cmp>( +If the iterator is sorted, all elements will be unique. Read more

source§

fn dedup_by<Cmp>( self, cmp: Cmp ) -> CoalesceBy<Self, DedupPred2CoalescePred<Cmp>, Self::Item>where Self: Sized, Cmp: FnMut(&Self::Item, &Self::Item) -> bool,

Remove duplicates from sections of consecutive identical elements, determining equality using a comparison function. -If the iterator is sorted, all elements will be unique. Read more
source§

fn dedup_with_count( +If the iterator is sorted, all elements will be unique. Read more

source§

fn dedup_with_count( self ) -> CoalesceBy<Self, DedupPredWithCount2CoalescePred<DedupEq>, (usize, Self::Item)>where Self: Sized,

Remove duplicates from sections of consecutive identical elements, while keeping a count of how many repeated elements were present. -If the iterator is sorted, all elements will be unique. Read more
source§

fn dedup_by_with_count<Cmp>( +If the iterator is sorted, all elements will be unique. Read more

source§

fn dedup_by_with_count<Cmp>( self, cmp: Cmp ) -> CoalesceBy<Self, DedupPredWithCount2CoalescePred<Cmp>, (usize, Self::Item)>where @@ -359,238 +363,252 @@ If the iterator is sorted, all elements will be unique. FnMut(&Self::Item, &Self::Item) -> bool,

Remove duplicates from sections of consecutive identical elements, while keeping a count of how many repeated elements were present. This will determine equality using a comparison function. -If the iterator is sorted, all elements will be unique. Read more
source§

fn duplicates(self) -> DuplicatesBy<Self, Self::Item, ById>where +If the iterator is sorted, all elements will be unique. Read more

source§

fn duplicates(self) -> DuplicatesBy<Self, Self::Item, ById>where Self: Sized, Self::Item: Eq + Hash,

Return an iterator adaptor that produces elements that appear more than once during the -iteration. Duplicates are detected using hash and equality. Read more
source§

fn duplicates_by<V, F>(self, f: F) -> DuplicatesBy<Self, V, ByFn<F>>where +iteration. Duplicates are detected using hash and equality. Read more

source§

fn duplicates_by<V, F>(self, f: F) -> DuplicatesBy<Self, V, ByFn<F>>where Self: Sized, V: Eq + Hash, F: FnMut(&Self::Item) -> V,

Return an iterator adaptor that produces elements that appear more than once during the -iteration. Duplicates are detected using hash and equality. Read more
source§

fn unique(self) -> Unique<Self>where +iteration. Duplicates are detected using hash and equality. Read more

source§

fn unique(self) -> Unique<Self>where Self: Sized, Self::Item: Clone + Eq + Hash,

Return an iterator adaptor that filters out elements that have already been produced once during the iteration. Duplicates -are detected using hash and equality. Read more
source§

fn unique_by<V, F>(self, f: F) -> UniqueBy<Self, V, F>where +are detected using hash and equality. Read more

source§

fn unique_by<V, F>(self, f: F) -> UniqueBy<Self, V, F>where Self: Sized, V: Eq + Hash, F: FnMut(&Self::Item) -> V,

Return an iterator adaptor that filters out elements that have -already been produced once during the iteration. Read more
source§

fn peeking_take_while<F>(&mut self, accept: F) -> PeekingTakeWhile<'_, Self, F>where +already been produced once during the iteration. Read more

source§

fn peeking_take_while<F>(&mut self, accept: F) -> PeekingTakeWhile<'_, Self, F>where Self: Sized + PeekingNext, F: FnMut(&Self::Item) -> bool,

Return an iterator adaptor that borrows from this iterator and -takes items while the closure accept returns true. Read more
source§

fn take_while_ref<F>(&mut self, accept: F) -> TakeWhileRef<'_, Self, F>where +takes items while the closure accept returns true. Read more

source§

fn take_while_ref<F>(&mut self, accept: F) -> TakeWhileRef<'_, Self, F>where Self: Clone, F: FnMut(&Self::Item) -> bool,

Return an iterator adaptor that borrows from a Clone-able iterator -to only pick off elements while the predicate accept returns true. Read more
source§

fn while_some<A>(self) -> WhileSome<Self>where +to only pick off elements while the predicate accept returns true. Read more

source§

fn take_while_inclusive<F>( + &mut self, + accept: F +) -> TakeWhileInclusive<'_, Self, F>where + Self: Sized, + F: FnMut(&Self::Item) -> bool,

Returns an iterator adaptor that consumes elements while the given +predicate is true, including the element for which the predicate +first returned false. Read more
source§

fn while_some<A>(self) -> WhileSome<Self>where Self: Sized + Iterator<Item = Option<A>>,

Return an iterator adaptor that filters Option<A> iterator elements -and produces A. Stops on the first None encountered. Read more
source§

fn tuple_combinations<T>(self) -> TupleCombinations<Self, T>where +and produces A. Stops on the first None encountered. Read more

source§

fn tuple_combinations<T>(self) -> TupleCombinations<Self, T>where Self: Sized + Clone, Self::Item: Clone, T: HasCombination<Self>,

Return an iterator adaptor that iterates over the combinations of the -elements from an iterator. Read more
source§

fn combinations(self, k: usize) -> Combinations<Self>where +elements from an iterator. Read more

source§

fn combinations(self, k: usize) -> Combinations<Self>where Self: Sized, Self::Item: Clone,

Return an iterator adaptor that iterates over the k-length combinations of -the elements from an iterator. Read more
source§

fn combinations_with_replacement( +the elements from an iterator. Read more

source§

fn combinations_with_replacement( self, k: usize ) -> CombinationsWithReplacement<Self>where Self: Sized, Self::Item: Clone,

Return an iterator that iterates over the k-length combinations of -the elements from an iterator, with replacement. Read more
source§

fn permutations(self, k: usize) -> Permutations<Self>where +the elements from an iterator, with replacement. Read more

source§

fn permutations(self, k: usize) -> Permutations<Self>where Self: Sized, Self::Item: Clone,

Return an iterator adaptor that iterates over all k-permutations of the -elements from an iterator. Read more
source§

fn powerset(self) -> Powerset<Self>where +elements from an iterator. Read more

source§

fn powerset(self) -> Powerset<Self>where Self: Sized, Self::Item: Clone,

Return an iterator that iterates through the powerset of the elements from an -iterator. Read more
source§

fn pad_using<F>(self, min: usize, f: F) -> PadUsing<Self, F>where +iterator. Read more

source§

fn pad_using<F>(self, min: usize, f: F) -> PadUsing<Self, F>where Self: Sized, F: FnMut(usize) -> Self::Item,

Return an iterator adaptor that pads the sequence to a minimum length of -min by filling missing elements using a closure f. Read more
source§

fn with_position(self) -> WithPosition<Self>where - Self: Sized,

Return an iterator adaptor that wraps each element in a Position to -ease special-case handling of the first or last elements. Read more
source§

fn positions<P>(self, predicate: P) -> Positions<Self, P>where +min by filling missing elements using a closure f. Read more

source§

fn with_position(self) -> WithPosition<Self>where + Self: Sized,

Return an iterator adaptor that combines each element with a Position to +ease special-case handling of the first or last elements. Read more
source§

fn positions<P>(self, predicate: P) -> Positions<Self, P>where Self: Sized, P: FnMut(Self::Item) -> bool,

Return an iterator adaptor that yields the indices of all elements -satisfying a predicate, counted from the start of the iterator. Read more
source§

fn update<F>(self, updater: F) -> Update<Self, F>where +satisfying a predicate, counted from the start of the iterator. Read more

source§

fn update<F>(self, updater: F) -> Update<Self, F>where Self: Sized, F: FnMut(&mut Self::Item),

Return an iterator adaptor that applies a mutating function -to each element before yielding it. Read more
source§

fn next_tuple<T>(&mut self) -> Option<T>where +to each element before yielding it. Read more

source§

fn next_tuple<T>(&mut self) -> Option<T>where Self: Sized + Iterator<Item = <T as TupleCollect>::Item>, T: HomogeneousTuple,

Advances the iterator and returns the next items grouped in a tuple of -a specific size (up to 12). Read more
source§

fn collect_tuple<T>(self) -> Option<T>where +a specific size (up to 12). Read more

source§

fn collect_tuple<T>(self) -> Option<T>where Self: Sized + Iterator<Item = <T as TupleCollect>::Item>, T: HomogeneousTuple,

Collects all items from the iterator into a tuple of a specific size -(up to 12). Read more
source§

fn find_position<P>(&mut self, pred: P) -> Option<(usize, Self::Item)>where - P: FnMut(&Self::Item) -> bool,

Find the position and value of the first element satisfying a predicate. Read more
source§

fn find_or_last<P>(self, predicate: P) -> Option<Self::Item>where +(up to 12). Read more

source§

fn find_position<P>(&mut self, pred: P) -> Option<(usize, Self::Item)>where + P: FnMut(&Self::Item) -> bool,

Find the position and value of the first element satisfying a predicate. Read more
source§

fn find_or_last<P>(self, predicate: P) -> Option<Self::Item>where Self: Sized, - P: FnMut(&Self::Item) -> bool,

Find the value of the first element satisfying a predicate or return the last element, if any. Read more
source§

fn find_or_first<P>(self, predicate: P) -> Option<Self::Item>where + P: FnMut(&Self::Item) -> bool,

Find the value of the first element satisfying a predicate or return the last element, if any. Read more
source§

fn find_or_first<P>(self, predicate: P) -> Option<Self::Item>where Self: Sized, - P: FnMut(&Self::Item) -> bool,

Find the value of the first element satisfying a predicate or return the first element, if any. Read more
source§

fn contains<Q>(&mut self, query: &Q) -> boolwhere + P: FnMut(&Self::Item) -> bool,

Find the value of the first element satisfying a predicate or return the first element, if any. Read more
source§

fn contains<Q>(&mut self, query: &Q) -> boolwhere Self: Sized, Self::Item: Borrow<Q>, - Q: PartialEq<Q>,

Returns true if the given item is present in this iterator. Read more
source§

fn all_equal(&mut self) -> boolwhere + Q: PartialEq<Q>,

Returns true if the given item is present in this iterator. Read more
source§

fn all_equal(&mut self) -> boolwhere Self: Sized, - Self::Item: PartialEq<Self::Item>,

Check whether all elements compare equal. Read more
source§

fn all_unique(&mut self) -> boolwhere + Self::Item: PartialEq<Self::Item>,

Check whether all elements compare equal. Read more
source§

fn all_equal_value( + &mut self +) -> Result<Self::Item, Option<(Self::Item, Self::Item)>>where Self: Sized, - Self::Item: Eq + Hash,

Check whether all elements are unique (non equal). Read more
source§

fn dropping(self, n: usize) -> Selfwhere + Self::Item: PartialEq<Self::Item>,

If there are elements and they are all equal, return a single copy of that element. +If there are no elements, return an Error containing None. +If there are elements and they are not all equal, return a tuple containing the first +two non-equal elements found. Read more
source§

fn all_unique(&mut self) -> boolwhere + Self: Sized, + Self::Item: Eq + Hash,

Check whether all elements are unique (non equal). Read more
source§

fn dropping(self, n: usize) -> Selfwhere Self: Sized,

Consume the first n elements from the iterator eagerly, -and return the same iterator again. Read more
source§

fn dropping_back(self, n: usize) -> Selfwhere +and return the same iterator again. Read more

source§

fn dropping_back(self, n: usize) -> Selfwhere Self: Sized + DoubleEndedIterator,

Consume the last n elements from the iterator eagerly, -and return the same iterator again. Read more
source§

fn foreach<F>(self, f: F)where +and return the same iterator again. Read more

source§

fn foreach<F>(self, f: F)where F: FnMut(Self::Item), - Self: Sized,

👎Deprecated since 0.8.0: Use .for_each() instead
Run the closure f eagerly on each element of the iterator. Read more
source§

fn concat(self) -> Self::Itemwhere + Self: Sized,

👎Deprecated since 0.8.0: Use .for_each() instead
Run the closure f eagerly on each element of the iterator. Read more
source§

fn concat(self) -> Self::Itemwhere Self: Sized, - Self::Item: Extend<<Self::Item as IntoIterator>::Item> + IntoIterator + Default,

Combine all an iterator’s elements into one element by using Extend. Read more
source§

fn collect_vec(self) -> Vec<Self::Item, Global>where + Self::Item: Extend<<Self::Item as IntoIterator>::Item> + IntoIterator + Default,

Combine all an iterator’s elements into one element by using Extend. Read more
source§

fn collect_vec(self) -> Vec<Self::Item, Global>where Self: Sized,

.collect_vec() is simply a type specialization of Iterator::collect, -for convenience.
source§

fn try_collect<T, U, E>(self) -> Result<U, E>where +for convenience.

source§

fn try_collect<T, U, E>(self) -> Result<U, E>where Self: Sized + Iterator<Item = Result<T, E>>, Result<U, E>: FromIterator<Result<T, E>>,

.try_collect() is more convenient way of writing -.collect::<Result<_, _>>() Read more
source§

fn set_from<'a, A, J>(&mut self, from: J) -> usizewhere +.collect::<Result<_, _>>() Read more

source§

fn set_from<'a, A, J>(&mut self, from: J) -> usizewhere A: 'a, Self: Iterator<Item = &'a mut A>, J: IntoIterator<Item = A>,

Assign to each reference in self from the from iterator, -stopping at the shortest of the two iterators. Read more
source§

fn join(&mut self, sep: &str) -> Stringwhere - Self::Item: Display,

Combine all iterator elements into one String, separated by sep. Read more
source§

fn format(self, sep: &str) -> Format<'_, Self>where - Self: Sized,

Format all iterator elements, separated by sep. Read more
source§

fn format_with<F>(self, sep: &str, format: F) -> FormatWith<'_, Self, F>where +stopping at the shortest of the two iterators. Read more

source§

fn join(&mut self, sep: &str) -> Stringwhere + Self::Item: Display,

Combine all iterator elements into one String, separated by sep. Read more
source§

fn format(self, sep: &str) -> Format<'_, Self>where + Self: Sized,

Format all iterator elements, separated by sep. Read more
source§

fn format_with<F>(self, sep: &str, format: F) -> FormatWith<'_, Self, F>where Self: Sized, - F: FnMut(Self::Item, &mut dyn FnMut(&dyn Display) -> Result<(), Error>) -> Result<(), Error>,

Format all iterator elements, separated by sep. Read more
source§

fn fold_results<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>where + F: FnMut(Self::Item, &mut dyn FnMut(&dyn Display) -> Result<(), Error>) -> Result<(), Error>,

Format all iterator elements, separated by sep. Read more
source§

fn fold_results<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>where Self: Iterator<Item = Result<A, E>>, - F: FnMut(B, A) -> B,

👎Deprecated since 0.10.0: Use .fold_ok() instead
See .fold_ok().
source§

fn fold_ok<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>where + F: FnMut(B, A) -> B,

👎Deprecated since 0.10.0: Use .fold_ok() instead
See .fold_ok().
source§

fn fold_ok<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>where Self: Iterator<Item = Result<A, E>>, - F: FnMut(B, A) -> B,

Fold Result values from an iterator. Read more
source§

fn fold_options<A, B, F>(&mut self, start: B, f: F) -> Option<B>where + F: FnMut(B, A) -> B,

Fold Result values from an iterator. Read more
source§

fn fold_options<A, B, F>(&mut self, start: B, f: F) -> Option<B>where Self: Iterator<Item = Option<A>>, - F: FnMut(B, A) -> B,

Fold Option values from an iterator. Read more
source§

fn fold1<F>(self, f: F) -> Option<Self::Item>where + F: FnMut(B, A) -> B,

Fold Option values from an iterator. Read more
source§

fn fold1<F>(self, f: F) -> Option<Self::Item>where F: FnMut(Self::Item, Self::Item) -> Self::Item, - Self: Sized,

👎Deprecated since 0.10.2: Use Iterator::reduce instead
Accumulator of the elements in the iterator. Read more
source§

fn tree_fold1<F>(self, f: F) -> Option<Self::Item>where + Self: Sized,

👎Deprecated since 0.10.2: Use Iterator::reduce instead
Accumulator of the elements in the iterator. Read more
source§

fn tree_fold1<F>(self, f: F) -> Option<Self::Item>where F: FnMut(Self::Item, Self::Item) -> Self::Item, - Self: Sized,

Accumulate the elements in the iterator in a tree-like manner. Read more
source§

fn fold_while<B, F>(&mut self, init: B, f: F) -> FoldWhile<B>where + Self: Sized,

Accumulate the elements in the iterator in a tree-like manner. Read more
source§

fn fold_while<B, F>(&mut self, init: B, f: F) -> FoldWhile<B>where Self: Sized, - F: FnMut(B, Self::Item) -> FoldWhile<B>,

An iterator method that applies a function, producing a single, final value. Read more
source§

fn sum1<S>(self) -> Option<S>where + F: FnMut(B, Self::Item) -> FoldWhile<B>,

An iterator method that applies a function, producing a single, final value. Read more
source§

fn sum1<S>(self) -> Option<S>where Self: Sized, - S: Sum<Self::Item>,

Iterate over the entire iterator and add all the elements. Read more
source§

fn product1<P>(self) -> Option<P>where + S: Sum<Self::Item>,

Iterate over the entire iterator and add all the elements. Read more
source§

fn product1<P>(self) -> Option<P>where Self: Sized, - P: Product<Self::Item>,

Iterate over the entire iterator and multiply all the elements. Read more
source§

fn sorted_unstable(self) -> IntoIter<Self::Item, Global>where + P: Product<Self::Item>,

Iterate over the entire iterator and multiply all the elements. Read more
source§

fn sorted_unstable(self) -> IntoIter<Self::Item, Global>where Self: Sized, - Self::Item: Ord,

Sort all iterator elements into a new iterator in ascending order. Read more
source§

fn sorted_unstable_by<F>(self, cmp: F) -> IntoIter<Self::Item, Global>where + Self::Item: Ord,

Sort all iterator elements into a new iterator in ascending order. Read more
source§

fn sorted_unstable_by<F>(self, cmp: F) -> IntoIter<Self::Item, Global>where Self: Sized, - F: FnMut(&Self::Item, &Self::Item) -> Ordering,

Sort all iterator elements into a new iterator in ascending order. Read more
source§

fn sorted_unstable_by_key<K, F>(self, f: F) -> IntoIter<Self::Item, Global>where + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

Sort all iterator elements into a new iterator in ascending order. Read more
source§

fn sorted_unstable_by_key<K, F>(self, f: F) -> IntoIter<Self::Item, Global>where Self: Sized, K: Ord, - F: FnMut(&Self::Item) -> K,

Sort all iterator elements into a new iterator in ascending order. Read more
source§

fn sorted(self) -> IntoIter<Self::Item, Global>where + F: FnMut(&Self::Item) -> K,

Sort all iterator elements into a new iterator in ascending order. Read more
source§

fn sorted(self) -> IntoIter<Self::Item, Global>where Self: Sized, - Self::Item: Ord,

Sort all iterator elements into a new iterator in ascending order. Read more
source§

fn sorted_by<F>(self, cmp: F) -> IntoIter<Self::Item, Global>where + Self::Item: Ord,

Sort all iterator elements into a new iterator in ascending order. Read more
source§

fn sorted_by<F>(self, cmp: F) -> IntoIter<Self::Item, Global>where Self: Sized, - F: FnMut(&Self::Item, &Self::Item) -> Ordering,

Sort all iterator elements into a new iterator in ascending order. Read more
source§

fn sorted_by_key<K, F>(self, f: F) -> IntoIter<Self::Item, Global>where + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

Sort all iterator elements into a new iterator in ascending order. Read more
source§

fn sorted_by_key<K, F>(self, f: F) -> IntoIter<Self::Item, Global>where Self: Sized, K: Ord, - F: FnMut(&Self::Item) -> K,

Sort all iterator elements into a new iterator in ascending order. Read more
source§

fn sorted_by_cached_key<K, F>(self, f: F) -> IntoIter<Self::Item, Global>where + F: FnMut(&Self::Item) -> K,

Sort all iterator elements into a new iterator in ascending order. Read more
source§

fn sorted_by_cached_key<K, F>(self, f: F) -> IntoIter<Self::Item, Global>where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

Sort all iterator elements into a new iterator in ascending order. The key function is -called exactly once per key. Read more
source§

fn k_smallest(self, k: usize) -> IntoIter<Self::Item, Global>where +called exactly once per key. Read more

source§

fn k_smallest(self, k: usize) -> IntoIter<Self::Item, Global>where Self: Sized, - Self::Item: Ord,

Sort the k smallest elements into a new iterator, in ascending order. Read more
source§

fn partition_map<A, B, F, L, R>(self, predicate: F) -> (A, B)where + Self::Item: Ord,

Sort the k smallest elements into a new iterator, in ascending order. Read more
source§

fn partition_map<A, B, F, L, R>(self, predicate: F) -> (A, B)where Self: Sized, F: FnMut(Self::Item) -> Either<L, R>, A: Default + Extend<L>, B: Default + Extend<R>,

Collect all iterator elements into one of two partitions. Unlike Iterator::partition, each partition may -have a distinct type. Read more
source§

fn partition_result<A, B, T, E>(self) -> (A, B)where +have a distinct type. Read more

source§

fn partition_result<A, B, T, E>(self) -> (A, B)where Self: Iterator<Item = Result<T, E>> + Sized, A: Default + Extend<T>, B: Default + Extend<E>,

Partition a sequence of Results into one list of all the Ok elements -and another list of all the Err elements. Read more
source§

fn into_group_map<K, V>(self) -> HashMap<K, Vec<V, Global>, RandomState>where +and another list of all the Err elements. Read more

source§

fn into_group_map<K, V>(self) -> HashMap<K, Vec<V, Global>, RandomState>where Self: Iterator<Item = (K, V)> + Sized, K: Hash + Eq,

Return a HashMap of keys mapped to Vecs of values. Keys and values -are taken from (Key, Value) tuple pairs yielded by the input iterator. Read more
source§

fn into_group_map_by<K, V, F>( +are taken from (Key, Value) tuple pairs yielded by the input iterator. Read more

source§

fn into_group_map_by<K, V, F>( self, f: F ) -> HashMap<K, Vec<V, Global>, RandomState>where Self: Iterator<Item = V> + Sized, K: Hash + Eq, F: Fn(&V) -> K,

Return an Iterator on a HashMap. Keys mapped to Vecs of values. The key is specified -in the closure. Read more
source§

fn into_grouping_map<K, V>(self) -> GroupingMap<Self>where +in the closure. Read more

source§

fn into_grouping_map<K, V>(self) -> GroupingMap<Self>where Self: Iterator<Item = (K, V)> + Sized, - K: Hash + Eq,

Constructs a GroupingMap to be used later with one of the efficient -group-and-fold operations it allows to perform. Read more
source§

fn into_grouping_map_by<K, V, F>( + K: Hash + Eq,

Constructs a GroupingMap to be used later with one of the efficient +group-and-fold operations it allows to perform. Read more
source§

fn into_grouping_map_by<K, V, F>( self, key_mapper: F ) -> GroupingMap<MapForGrouping<Self, F>>where Self: Iterator<Item = V> + Sized, K: Hash + Eq, - F: FnMut(&V) -> K,

Constructs a GroupingMap to be used later with one of the efficient -group-and-fold operations it allows to perform. Read more
source§

fn min_set(self) -> Vec<Self::Item, Global>where + F: FnMut(&V) -> K,

Constructs a GroupingMap to be used later with one of the efficient +group-and-fold operations it allows to perform. Read more
source§

fn min_set(self) -> Vec<Self::Item, Global>where Self: Sized, - Self::Item: Ord,

Return all minimum elements of an iterator. Read more
source§

fn min_set_by<F>(self, compare: F) -> Vec<Self::Item, Global>where + Self::Item: Ord,

Return all minimum elements of an iterator. Read more
source§

fn min_set_by<F>(self, compare: F) -> Vec<Self::Item, Global>where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

Return all minimum elements of an iterator, as determined by -the specified function. Read more
source§

fn min_set_by_key<K, F>(self, key: F) -> Vec<Self::Item, Global>where +the specified function. Read more

source§

fn min_set_by_key<K, F>(self, key: F) -> Vec<Self::Item, Global>where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

Return all minimum elements of an iterator, as determined by -the specified function. Read more
source§

fn max_set(self) -> Vec<Self::Item, Global>where +the specified function. Read more

source§

fn max_set(self) -> Vec<Self::Item, Global>where Self: Sized, - Self::Item: Ord,

Return all maximum elements of an iterator. Read more
source§

fn max_set_by<F>(self, compare: F) -> Vec<Self::Item, Global>where + Self::Item: Ord,

Return all maximum elements of an iterator. Read more
source§

fn max_set_by<F>(self, compare: F) -> Vec<Self::Item, Global>where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

Return all maximum elements of an iterator, as determined by -the specified function. Read more
source§

fn max_set_by_key<K, F>(self, key: F) -> Vec<Self::Item, Global>where +the specified function. Read more

source§

fn max_set_by_key<K, F>(self, key: F) -> Vec<Self::Item, Global>where Self: Sized, K: Ord, - F: FnMut(&Self::Item) -> K,

Return all minimum elements of an iterator, as determined by -the specified function. Read more
source§

fn minmax(self) -> MinMaxResult<Self::Item>where + F: FnMut(&Self::Item) -> K,

Return all maximum elements of an iterator, as determined by +the specified function. Read more
source§

fn minmax(self) -> MinMaxResult<Self::Item>where Self: Sized, - Self::Item: PartialOrd<Self::Item>,

Return the minimum and maximum elements in the iterator. Read more
source§

fn minmax_by_key<K, F>(self, key: F) -> MinMaxResult<Self::Item>where + Self::Item: PartialOrd<Self::Item>,

Return the minimum and maximum elements in the iterator. Read more
source§

fn minmax_by_key<K, F>(self, key: F) -> MinMaxResult<Self::Item>where Self: Sized, K: PartialOrd<K>, F: FnMut(&Self::Item) -> K,

Return the minimum and maximum element of an iterator, as determined by -the specified function. Read more
source§

fn minmax_by<F>(self, compare: F) -> MinMaxResult<Self::Item>where +the specified function. Read more

source§

fn minmax_by<F>(self, compare: F) -> MinMaxResult<Self::Item>where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

Return the minimum and maximum element of an iterator, as determined by -the specified comparison function. Read more
source§

fn position_max(self) -> Option<usize>where +the specified comparison function. Read more

source§

fn position_max(self) -> Option<usize>where Self: Sized, - Self::Item: Ord,

Return the position of the maximum element in the iterator. Read more
source§

fn position_max_by_key<K, F>(self, key: F) -> Option<usize>where + Self::Item: Ord,

Return the position of the maximum element in the iterator. Read more
source§

fn position_max_by_key<K, F>(self, key: F) -> Option<usize>where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

Return the position of the maximum element in the iterator, as -determined by the specified function. Read more
source§

fn position_max_by<F>(self, compare: F) -> Option<usize>where +determined by the specified function. Read more

source§

fn position_max_by<F>(self, compare: F) -> Option<usize>where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

Return the position of the maximum element in the iterator, as -determined by the specified comparison function. Read more
source§

fn position_min(self) -> Option<usize>where +determined by the specified comparison function. Read more

source§

fn position_min(self) -> Option<usize>where Self: Sized, - Self::Item: Ord,

Return the position of the minimum element in the iterator. Read more
source§

fn position_min_by_key<K, F>(self, key: F) -> Option<usize>where + Self::Item: Ord,

Return the position of the minimum element in the iterator. Read more
source§

fn position_min_by_key<K, F>(self, key: F) -> Option<usize>where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

Return the position of the minimum element in the iterator, as -determined by the specified function. Read more
source§

fn position_min_by<F>(self, compare: F) -> Option<usize>where +determined by the specified function. Read more

source§

fn position_min_by<F>(self, compare: F) -> Option<usize>where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

Return the position of the minimum element in the iterator, as -determined by the specified comparison function. Read more
source§

fn position_minmax(self) -> MinMaxResult<usize>where +determined by the specified comparison function. Read more

source§

fn position_minmax(self) -> MinMaxResult<usize>where Self: Sized, Self::Item: PartialOrd<Self::Item>,

Return the positions of the minimum and maximum elements in -the iterator. Read more
source§

fn position_minmax_by_key<K, F>(self, key: F) -> MinMaxResult<usize>where +the iterator. Read more

source§

fn position_minmax_by_key<K, F>(self, key: F) -> MinMaxResult<usize>where Self: Sized, K: PartialOrd<K>, F: FnMut(&Self::Item) -> K,

Return the postions of the minimum and maximum elements of an -iterator, as determined by the specified function. Read more
source§

fn position_minmax_by<F>(self, compare: F) -> MinMaxResult<usize>where +iterator, as determined by the specified function. Read more

source§

fn position_minmax_by<F>(self, compare: F) -> MinMaxResult<usize>where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

Return the postions of the minimum and maximum elements of an -iterator, as determined by the specified comparison function. Read more
source§

fn exactly_one(self) -> Result<Self::Item, ExactlyOneError<Self>>where +iterator, as determined by the specified comparison function. Read more

source§

fn exactly_one(self) -> Result<Self::Item, ExactlyOneError<Self>>where Self: Sized,

If the iterator yields exactly one element, that element will be returned, otherwise an error will be returned containing an iterator that has the same output as the input -iterator. Read more
source§

fn at_most_one(self) -> Result<Option<Self::Item>, ExactlyOneError<Self>>where +iterator. Read more

source§

fn at_most_one(self) -> Result<Option<Self::Item>, ExactlyOneError<Self>>where Self: Sized,

If the iterator yields no elements, Ok(None) will be returned. If the iterator yields exactly one element, that element will be returned, otherwise an error will be returned -containing an iterator that has the same output as the input iterator. Read more
source§

fn multipeek(self) -> MultiPeek<Self>where +containing an iterator that has the same output as the input iterator. Read more

source§

fn multipeek(self) -> MultiPeek<Self>where Self: Sized,

An iterator adaptor that allows the user to peek at multiple .next() -values without advancing the base iterator. Read more
source§

fn counts(self) -> HashMap<Self::Item, usize, RandomState>where +values without advancing the base iterator. Read more

source§

fn counts(self) -> HashMap<Self::Item, usize, RandomState>where Self: Sized, Self::Item: Eq + Hash,

Collect the items in this iterator and return a HashMap which contains each item that appears in the iterator and the number -of times it appears. Read more
source§

fn counts_by<K, F>(self, f: F) -> HashMap<K, usize, RandomState>where +of times it appears. Read more

source§

fn counts_by<K, F>(self, f: F) -> HashMap<K, usize, RandomState>where Self: Sized, K: Eq + Hash, F: FnMut(Self::Item) -> K,

Collect the items in this iterator and return a HashMap which contains each item that appears in the iterator and the number of times it appears, -determining identity using a keying function. Read more
source§

fn multiunzip<FromI>(self) -> FromIwhere +determining identity using a keying function. Read more

source§

fn multiunzip<FromI>(self) -> FromIwhere Self: Sized + MultiUnzip<FromI>,

Converts an iterator of tuples into a tuple of containers. Read more
source§

impl<IT, A, FromA, B, FromB> MultiUnzip<(FromA, FromB)> for ITwhere IT: Iterator<Item = (A, B)>, FromA: Default + Extend<A>, diff --git a/dev/uu_tail/chunks/struct.ReverseChunks.html b/dev/uu_tail/chunks/struct.ReverseChunks.html index 0378deb0d..b3fa7d45b 100644 --- a/dev/uu_tail/chunks/struct.ReverseChunks.html +++ b/dev/uu_tail/chunks/struct.ReverseChunks.html @@ -184,86 +184,89 @@ function. From<T> for U chooses to do.

source§

impl<I> IntoIterator for Iwhere - I: Iterator,

§

type Item = <I as Iterator>::Item

The type of the elements being iterated over.
§

type IntoIter = I

Which kind of iterator are we turning this into?
const: unstable · source§

fn into_iter(self) -> I

Creates an iterator from a value. Read more
source§

impl<T> Itertools for Twhere - T: Iterator + ?Sized,

source§

fn interleave<J>( + I: Iterator,

§

type Item = <I as Iterator>::Item

The type of the elements being iterated over.
§

type IntoIter = I

Which kind of iterator are we turning this into?
const: unstable · source§

fn into_iter(self) -> I

Creates an iterator from a value. Read more
source§

impl<T> Itertools for Twhere + T: Iterator + ?Sized,

source§

fn interleave<J>( self, other: J ) -> Interleave<Self, <J as IntoIterator>::IntoIter>where J: IntoIterator<Item = Self::Item>, - Self: Sized,

Alternate elements from two iterators until both have run out. Read more
source§

fn interleave_shortest<J>( + Self: Sized,

Alternate elements from two iterators until both have run out. Read more
source§

fn interleave_shortest<J>( self, other: J ) -> InterleaveShortest<Self, <J as IntoIterator>::IntoIter>where J: IntoIterator<Item = Self::Item>, Self: Sized,

Alternate elements from two iterators until at least one of them has run -out. Read more
source§

fn intersperse( +out. Read more

source§

fn intersperse( self, element: Self::Item ) -> IntersperseWith<Self, IntersperseElementSimple<Self::Item>>where Self: Sized, Self::Item: Clone,

An iterator adaptor to insert a particular value -between each element of the adapted iterator. Read more
source§

fn intersperse_with<F>(self, element: F) -> IntersperseWith<Self, F>where +between each element of the adapted iterator. Read more

source§

fn intersperse_with<F>(self, element: F) -> IntersperseWith<Self, F>where Self: Sized, F: FnMut() -> Self::Item,

An iterator adaptor to insert a particular value created by a function -between each element of the adapted iterator. Read more
source§

fn zip_longest<J>( +between each element of the adapted iterator. Read more

source§

fn zip_longest<J>( self, other: J ) -> ZipLongest<Self, <J as IntoIterator>::IntoIter>where J: IntoIterator, Self: Sized,

Create an iterator which iterates over both this and the specified -iterator simultaneously, yielding pairs of two optional elements. Read more
source§

fn zip_eq<J>(self, other: J) -> ZipEq<Self, <J as IntoIterator>::IntoIter>where +iterator simultaneously, yielding pairs of two optional elements. Read more

source§

fn zip_eq<J>(self, other: J) -> ZipEq<Self, <J as IntoIterator>::IntoIter>where J: IntoIterator, Self: Sized,

Create an iterator which iterates over both this and the specified -iterator simultaneously, yielding pairs of elements. Read more
source§

fn batching<B, F>(self, f: F) -> Batching<Self, F>where +iterator simultaneously, yielding pairs of elements. Read more

source§

fn batching<B, F>(self, f: F) -> Batching<Self, F>where F: FnMut(&mut Self) -> Option<B>, Self: Sized,

A “meta iterator adaptor”. Its closure receives a reference to the iterator and may pick off as many elements as it likes, to produce the -next iterator element. Read more
source§

fn group_by<K, F>(self, key: F) -> GroupBy<K, Self, F>where +next iterator element. Read more

source§

fn group_by<K, F>(self, key: F) -> GroupBy<K, Self, F>where Self: Sized, F: FnMut(&Self::Item) -> K, K: PartialEq<K>,

Return an iterable that can group iterator elements. Consecutive elements that map to the same key (“runs”), are assigned -to the same group. Read more
source§

fn chunks(self, size: usize) -> IntoChunks<Self>where - Self: Sized,

Return an iterable that can chunk the iterator. Read more
source§

fn tuple_windows<T>(self) -> TupleWindows<Self, T>where +to the same group. Read more

source§

fn chunks(self, size: usize) -> IntoChunks<Self>where + Self: Sized,

Return an iterable that can chunk the iterator. Read more
source§

fn tuple_windows<T>(self) -> TupleWindows<Self, T>where Self: Sized + Iterator<Item = <T as TupleCollect>::Item>, T: HomogeneousTuple, <T as TupleCollect>::Item: Clone,

Return an iterator over all contiguous windows producing tuples of -a specific size (up to 12). Read more
source§

fn circular_tuple_windows<T>(self) -> CircularTupleWindows<Self, T>where +a specific size (up to 12). Read more

source§

fn circular_tuple_windows<T>(self) -> CircularTupleWindows<Self, T>where Self: Sized + Clone + Iterator<Item = <T as TupleCollect>::Item> + ExactSizeIterator, T: TupleCollect + Clone, <T as TupleCollect>::Item: Clone,

Return an iterator over all windows, wrapping back to the first elements when the window would otherwise exceed the length of the -iterator, producing tuples of a specific size (up to 12). Read more
source§

fn tuples<T>(self) -> Tuples<Self, T>where +iterator, producing tuples of a specific size (up to 12). Read more

source§

fn tuples<T>(self) -> Tuples<Self, T>where Self: Sized + Iterator<Item = <T as TupleCollect>::Item>, T: HomogeneousTuple,

Return an iterator that groups the items in tuples of a specific size -(up to 12). Read more
source§

fn tee(self) -> (Tee<Self>, Tee<Self>)where +(up to 12). Read more

source§

fn tee(self) -> (Tee<Self>, Tee<Self>)where Self: Sized, Self::Item: Clone,

Split into an iterator pair that both yield all elements from -the original iterator. Read more
source§

fn step(self, n: usize) -> Step<Self>where +the original iterator. Read more

source§

fn step(self, n: usize) -> Step<Self>where Self: Sized,

👎Deprecated since 0.8.0: Use std .step_by() instead
Return an iterator adaptor that steps n elements in the base iterator -for each iteration. Read more
source§

fn map_into<R>(self) -> MapSpecialCase<Self, MapSpecialCaseFnInto<R>>where +for each iteration. Read more

source§

fn map_into<R>(self) -> MapSpecialCase<Self, MapSpecialCaseFnInto<R>>where Self: Sized, - Self::Item: Into<R>,

Convert each item of the iterator using the Into trait. Read more
source§

fn map_results<F, T, U, E>( + Self::Item: Into<R>,

Convert each item of the iterator using the Into trait. Read more
source§

fn map_results<F, T, U, E>( self, f: F ) -> MapSpecialCase<Self, MapSpecialCaseFnOk<F>>where Self: Iterator<Item = Result<T, E>> + Sized, - F: FnMut(T) -> U,

👎Deprecated since 0.10.0: Use .map_ok() instead
See .map_ok().
source§

fn map_ok<F, T, U, E>(self, f: F) -> MapSpecialCase<Self, MapSpecialCaseFnOk<F>>where + F: FnMut(T) -> U,

👎Deprecated since 0.10.0: Use .map_ok() instead
See .map_ok().
source§

fn map_ok<F, T, U, E>(self, f: F) -> MapSpecialCase<Self, MapSpecialCaseFnOk<F>>where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(T) -> U,

Return an iterator adaptor that applies the provided closure to every Result::Ok value. Result::Err values are -unchanged. Read more
source§

fn filter_ok<F, T, E>(self, f: F) -> FilterOk<Self, F>where +unchanged. Read more

source§

fn filter_ok<F, T, E>(self, f: F) -> FilterOk<Self, F>where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(&T) -> bool,

Return an iterator adaptor that filters every Result::Ok value with the provided closure. Result::Err values are -unchanged. Read more
source§

fn filter_map_ok<F, T, U, E>(self, f: F) -> FilterMapOk<Self, F>where +unchanged. Read more

source§

fn filter_map_ok<F, T, U, E>(self, f: F) -> FilterMapOk<Self, F>where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(T) -> Option<U>,

Return an iterator adaptor that filters and transforms every Result::Ok value with the provided closure. Result::Err -values are unchanged. Read more
source§

fn flatten_ok<T, E>(self) -> FlattenOk<Self, T, E>where +values are unchanged. Read more

source§

fn flatten_ok<T, E>(self) -> FlattenOk<Self, T, E>where Self: Iterator<Item = Result<T, E>> + Sized, T: IntoIterator,

Return an iterator adaptor that flattens every Result::Ok value into -a series of Result::Ok values. Result::Err values are unchanged. Read more
source§

fn merge<J>( +a series of Result::Ok values. Result::Err values are unchanged. Read more

source§

fn process_results<F, T, E, R>(self, processor: F) -> Result<R, E>where + Self: Iterator<Item = Result<T, E>> + Sized, + F: FnOnce(ProcessResults<'_, Self, E>) -> R,

“Lift” a function of the values of the current iterator so as to process +an iterator of Result values instead. Read more
source§

fn merge<J>( self, other: J ) -> MergeBy<Self, <J as IntoIterator>::IntoIter, MergeLte>where @@ -271,7 +274,7 @@ a series of Result::Ok values. Result::Err values are Self::Item: PartialOrd<Self::Item>, J: IntoIterator<Item = Self::Item>,

Return an iterator adaptor that merges the two base iterators in ascending order. If both base iterators are sorted (ascending), the -result is sorted. Read more
source§

fn merge_by<J, F>( +result is sorted. Read more

source§

fn merge_by<J, F>( self, other: J, is_first: F @@ -279,26 +282,27 @@ result is sorted. Sized, J: IntoIterator<Item = Self::Item>, F: FnMut(&Self::Item, &Self::Item) -> bool,

Return an iterator adaptor that merges the two base iterators in order. -This is much like .merge() but allows for a custom ordering. Read more
source§

fn merge_join_by<J, F>( +This is much like .merge() but allows for a custom ordering. Read more

source§

fn merge_join_by<J, F, T>( self, other: J, cmp_fn: F ) -> MergeJoinBy<Self, <J as IntoIterator>::IntoIter, F>where J: IntoIterator, - F: FnMut(&Self::Item, &<J as IntoIterator>::Item) -> Ordering, + F: FnMut(&Self::Item, &<J as IntoIterator>::Item) -> T, + T: OrderingOrBool<Self::Item, <J as IntoIterator>::Item>, Self: Sized,

Create an iterator that merges items from both this and the specified -iterator in ascending order. Read more
source§

fn kmerge(self) -> KMergeBy<<Self::Item as IntoIterator>::IntoIter, KMergeByLt>where +iterator in ascending order. Read more

source§

fn kmerge(self) -> KMergeBy<<Self::Item as IntoIterator>::IntoIter, KMergeByLt>where Self: Sized, Self::Item: IntoIterator, <Self::Item as IntoIterator>::Item: PartialOrd<<Self::Item as IntoIterator>::Item>,

Return an iterator adaptor that flattens an iterator of iterators by -merging them in ascending order. Read more
source§

fn kmerge_by<F>( +merging them in ascending order. Read more

source§

fn kmerge_by<F>( self, first: F ) -> KMergeBy<<Self::Item as IntoIterator>::IntoIter, F>where Self: Sized, Self::Item: IntoIterator, F: FnMut(&<Self::Item as IntoIterator>::Item, &<Self::Item as IntoIterator>::Item) -> bool,

Return an iterator adaptor that flattens an iterator of iterators by -merging them according to the given closure. Read more
source§

fn cartesian_product<J>( +merging them according to the given closure. Read more

source§

fn cartesian_product<J>( self, other: J ) -> Product<Self, <J as IntoIterator>::IntoIter>where @@ -306,32 +310,32 @@ merging them according to the given closure. Item: Clone, J: IntoIterator, <J as IntoIterator>::IntoIter: Clone,

Return an iterator adaptor that iterates over the cartesian product of -the element sets of two iterators self and J. Read more
source§

fn multi_cartesian_product( +the element sets of two iterators self and J. Read more

source§

fn multi_cartesian_product( self ) -> MultiProduct<<Self::Item as IntoIterator>::IntoIter>where Self: Sized, Self::Item: IntoIterator, <Self::Item as IntoIterator>::IntoIter: Clone, <Self::Item as IntoIterator>::Item: Clone,

Return an iterator adaptor that iterates over the cartesian product of -all subiterators returned by meta-iterator self. Read more
source§

fn coalesce<F>(self, f: F) -> CoalesceBy<Self, F, Self::Item>where +all subiterators returned by meta-iterator self. Read more

source§

fn coalesce<F>(self, f: F) -> CoalesceBy<Self, F, Self::Item>where Self: Sized, F: FnMut(Self::Item, Self::Item) -> Result<Self::Item, (Self::Item, Self::Item)>,

Return an iterator adaptor that uses the passed-in closure to -optionally merge together consecutive elements. Read more
source§

fn dedup(self) -> CoalesceBy<Self, DedupPred2CoalescePred<DedupEq>, Self::Item>where +optionally merge together consecutive elements. Read more

source§

fn dedup(self) -> CoalesceBy<Self, DedupPred2CoalescePred<DedupEq>, Self::Item>where Self: Sized, Self::Item: PartialEq<Self::Item>,

Remove duplicates from sections of consecutive identical elements. -If the iterator is sorted, all elements will be unique. Read more
source§

fn dedup_by<Cmp>( +If the iterator is sorted, all elements will be unique. Read more

source§

fn dedup_by<Cmp>( self, cmp: Cmp ) -> CoalesceBy<Self, DedupPred2CoalescePred<Cmp>, Self::Item>where Self: Sized, Cmp: FnMut(&Self::Item, &Self::Item) -> bool,

Remove duplicates from sections of consecutive identical elements, determining equality using a comparison function. -If the iterator is sorted, all elements will be unique. Read more
source§

fn dedup_with_count( +If the iterator is sorted, all elements will be unique. Read more

source§

fn dedup_with_count( self ) -> CoalesceBy<Self, DedupPredWithCount2CoalescePred<DedupEq>, (usize, Self::Item)>where Self: Sized,

Remove duplicates from sections of consecutive identical elements, while keeping a count of how many repeated elements were present. -If the iterator is sorted, all elements will be unique. Read more
source§

fn dedup_by_with_count<Cmp>( +If the iterator is sorted, all elements will be unique. Read more

source§

fn dedup_by_with_count<Cmp>( self, cmp: Cmp ) -> CoalesceBy<Self, DedupPredWithCount2CoalescePred<Cmp>, (usize, Self::Item)>where @@ -339,238 +343,252 @@ If the iterator is sorted, all elements will be unique. FnMut(&Self::Item, &Self::Item) -> bool,

Remove duplicates from sections of consecutive identical elements, while keeping a count of how many repeated elements were present. This will determine equality using a comparison function. -If the iterator is sorted, all elements will be unique. Read more
source§

fn duplicates(self) -> DuplicatesBy<Self, Self::Item, ById>where +If the iterator is sorted, all elements will be unique. Read more

source§

fn duplicates(self) -> DuplicatesBy<Self, Self::Item, ById>where Self: Sized, Self::Item: Eq + Hash,

Return an iterator adaptor that produces elements that appear more than once during the -iteration. Duplicates are detected using hash and equality. Read more
source§

fn duplicates_by<V, F>(self, f: F) -> DuplicatesBy<Self, V, ByFn<F>>where +iteration. Duplicates are detected using hash and equality. Read more

source§

fn duplicates_by<V, F>(self, f: F) -> DuplicatesBy<Self, V, ByFn<F>>where Self: Sized, V: Eq + Hash, F: FnMut(&Self::Item) -> V,

Return an iterator adaptor that produces elements that appear more than once during the -iteration. Duplicates are detected using hash and equality. Read more
source§

fn unique(self) -> Unique<Self>where +iteration. Duplicates are detected using hash and equality. Read more

source§

fn unique(self) -> Unique<Self>where Self: Sized, Self::Item: Clone + Eq + Hash,

Return an iterator adaptor that filters out elements that have already been produced once during the iteration. Duplicates -are detected using hash and equality. Read more
source§

fn unique_by<V, F>(self, f: F) -> UniqueBy<Self, V, F>where +are detected using hash and equality. Read more

source§

fn unique_by<V, F>(self, f: F) -> UniqueBy<Self, V, F>where Self: Sized, V: Eq + Hash, F: FnMut(&Self::Item) -> V,

Return an iterator adaptor that filters out elements that have -already been produced once during the iteration. Read more
source§

fn peeking_take_while<F>(&mut self, accept: F) -> PeekingTakeWhile<'_, Self, F>where +already been produced once during the iteration. Read more

source§

fn peeking_take_while<F>(&mut self, accept: F) -> PeekingTakeWhile<'_, Self, F>where Self: Sized + PeekingNext, F: FnMut(&Self::Item) -> bool,

Return an iterator adaptor that borrows from this iterator and -takes items while the closure accept returns true. Read more
source§

fn take_while_ref<F>(&mut self, accept: F) -> TakeWhileRef<'_, Self, F>where +takes items while the closure accept returns true. Read more

source§

fn take_while_ref<F>(&mut self, accept: F) -> TakeWhileRef<'_, Self, F>where Self: Clone, F: FnMut(&Self::Item) -> bool,

Return an iterator adaptor that borrows from a Clone-able iterator -to only pick off elements while the predicate accept returns true. Read more
source§

fn while_some<A>(self) -> WhileSome<Self>where +to only pick off elements while the predicate accept returns true. Read more

source§

fn take_while_inclusive<F>( + &mut self, + accept: F +) -> TakeWhileInclusive<'_, Self, F>where + Self: Sized, + F: FnMut(&Self::Item) -> bool,

Returns an iterator adaptor that consumes elements while the given +predicate is true, including the element for which the predicate +first returned false. Read more
source§

fn while_some<A>(self) -> WhileSome<Self>where Self: Sized + Iterator<Item = Option<A>>,

Return an iterator adaptor that filters Option<A> iterator elements -and produces A. Stops on the first None encountered. Read more
source§

fn tuple_combinations<T>(self) -> TupleCombinations<Self, T>where +and produces A. Stops on the first None encountered. Read more

source§

fn tuple_combinations<T>(self) -> TupleCombinations<Self, T>where Self: Sized + Clone, Self::Item: Clone, T: HasCombination<Self>,

Return an iterator adaptor that iterates over the combinations of the -elements from an iterator. Read more
source§

fn combinations(self, k: usize) -> Combinations<Self>where +elements from an iterator. Read more

source§

fn combinations(self, k: usize) -> Combinations<Self>where Self: Sized, Self::Item: Clone,

Return an iterator adaptor that iterates over the k-length combinations of -the elements from an iterator. Read more
source§

fn combinations_with_replacement( +the elements from an iterator. Read more

source§

fn combinations_with_replacement( self, k: usize ) -> CombinationsWithReplacement<Self>where Self: Sized, Self::Item: Clone,

Return an iterator that iterates over the k-length combinations of -the elements from an iterator, with replacement. Read more
source§

fn permutations(self, k: usize) -> Permutations<Self>where +the elements from an iterator, with replacement. Read more

source§

fn permutations(self, k: usize) -> Permutations<Self>where Self: Sized, Self::Item: Clone,

Return an iterator adaptor that iterates over all k-permutations of the -elements from an iterator. Read more
source§

fn powerset(self) -> Powerset<Self>where +elements from an iterator. Read more

source§

fn powerset(self) -> Powerset<Self>where Self: Sized, Self::Item: Clone,

Return an iterator that iterates through the powerset of the elements from an -iterator. Read more
source§

fn pad_using<F>(self, min: usize, f: F) -> PadUsing<Self, F>where +iterator. Read more

source§

fn pad_using<F>(self, min: usize, f: F) -> PadUsing<Self, F>where Self: Sized, F: FnMut(usize) -> Self::Item,

Return an iterator adaptor that pads the sequence to a minimum length of -min by filling missing elements using a closure f. Read more
source§

fn with_position(self) -> WithPosition<Self>where - Self: Sized,

Return an iterator adaptor that wraps each element in a Position to -ease special-case handling of the first or last elements. Read more
source§

fn positions<P>(self, predicate: P) -> Positions<Self, P>where +min by filling missing elements using a closure f. Read more

source§

fn with_position(self) -> WithPosition<Self>where + Self: Sized,

Return an iterator adaptor that combines each element with a Position to +ease special-case handling of the first or last elements. Read more
source§

fn positions<P>(self, predicate: P) -> Positions<Self, P>where Self: Sized, P: FnMut(Self::Item) -> bool,

Return an iterator adaptor that yields the indices of all elements -satisfying a predicate, counted from the start of the iterator. Read more
source§

fn update<F>(self, updater: F) -> Update<Self, F>where +satisfying a predicate, counted from the start of the iterator. Read more

source§

fn update<F>(self, updater: F) -> Update<Self, F>where Self: Sized, F: FnMut(&mut Self::Item),

Return an iterator adaptor that applies a mutating function -to each element before yielding it. Read more
source§

fn next_tuple<T>(&mut self) -> Option<T>where +to each element before yielding it. Read more

source§

fn next_tuple<T>(&mut self) -> Option<T>where Self: Sized + Iterator<Item = <T as TupleCollect>::Item>, T: HomogeneousTuple,

Advances the iterator and returns the next items grouped in a tuple of -a specific size (up to 12). Read more
source§

fn collect_tuple<T>(self) -> Option<T>where +a specific size (up to 12). Read more

source§

fn collect_tuple<T>(self) -> Option<T>where Self: Sized + Iterator<Item = <T as TupleCollect>::Item>, T: HomogeneousTuple,

Collects all items from the iterator into a tuple of a specific size -(up to 12). Read more
source§

fn find_position<P>(&mut self, pred: P) -> Option<(usize, Self::Item)>where - P: FnMut(&Self::Item) -> bool,

Find the position and value of the first element satisfying a predicate. Read more
source§

fn find_or_last<P>(self, predicate: P) -> Option<Self::Item>where +(up to 12). Read more

source§

fn find_position<P>(&mut self, pred: P) -> Option<(usize, Self::Item)>where + P: FnMut(&Self::Item) -> bool,

Find the position and value of the first element satisfying a predicate. Read more
source§

fn find_or_last<P>(self, predicate: P) -> Option<Self::Item>where Self: Sized, - P: FnMut(&Self::Item) -> bool,

Find the value of the first element satisfying a predicate or return the last element, if any. Read more
source§

fn find_or_first<P>(self, predicate: P) -> Option<Self::Item>where + P: FnMut(&Self::Item) -> bool,

Find the value of the first element satisfying a predicate or return the last element, if any. Read more
source§

fn find_or_first<P>(self, predicate: P) -> Option<Self::Item>where Self: Sized, - P: FnMut(&Self::Item) -> bool,

Find the value of the first element satisfying a predicate or return the first element, if any. Read more
source§

fn contains<Q>(&mut self, query: &Q) -> boolwhere + P: FnMut(&Self::Item) -> bool,

Find the value of the first element satisfying a predicate or return the first element, if any. Read more
source§

fn contains<Q>(&mut self, query: &Q) -> boolwhere Self: Sized, Self::Item: Borrow<Q>, - Q: PartialEq<Q>,

Returns true if the given item is present in this iterator. Read more
source§

fn all_equal(&mut self) -> boolwhere + Q: PartialEq<Q>,

Returns true if the given item is present in this iterator. Read more
source§

fn all_equal(&mut self) -> boolwhere Self: Sized, - Self::Item: PartialEq<Self::Item>,

Check whether all elements compare equal. Read more
source§

fn all_unique(&mut self) -> boolwhere + Self::Item: PartialEq<Self::Item>,

Check whether all elements compare equal. Read more
source§

fn all_equal_value( + &mut self +) -> Result<Self::Item, Option<(Self::Item, Self::Item)>>where Self: Sized, - Self::Item: Eq + Hash,

Check whether all elements are unique (non equal). Read more
source§

fn dropping(self, n: usize) -> Selfwhere + Self::Item: PartialEq<Self::Item>,

If there are elements and they are all equal, return a single copy of that element. +If there are no elements, return an Error containing None. +If there are elements and they are not all equal, return a tuple containing the first +two non-equal elements found. Read more
source§

fn all_unique(&mut self) -> boolwhere + Self: Sized, + Self::Item: Eq + Hash,

Check whether all elements are unique (non equal). Read more
source§

fn dropping(self, n: usize) -> Selfwhere Self: Sized,

Consume the first n elements from the iterator eagerly, -and return the same iterator again. Read more
source§

fn dropping_back(self, n: usize) -> Selfwhere +and return the same iterator again. Read more

source§

fn dropping_back(self, n: usize) -> Selfwhere Self: Sized + DoubleEndedIterator,

Consume the last n elements from the iterator eagerly, -and return the same iterator again. Read more
source§

fn foreach<F>(self, f: F)where +and return the same iterator again. Read more

source§

fn foreach<F>(self, f: F)where F: FnMut(Self::Item), - Self: Sized,

👎Deprecated since 0.8.0: Use .for_each() instead
Run the closure f eagerly on each element of the iterator. Read more
source§

fn concat(self) -> Self::Itemwhere + Self: Sized,

👎Deprecated since 0.8.0: Use .for_each() instead
Run the closure f eagerly on each element of the iterator. Read more
source§

fn concat(self) -> Self::Itemwhere Self: Sized, - Self::Item: Extend<<Self::Item as IntoIterator>::Item> + IntoIterator + Default,

Combine all an iterator’s elements into one element by using Extend. Read more
source§

fn collect_vec(self) -> Vec<Self::Item, Global>where + Self::Item: Extend<<Self::Item as IntoIterator>::Item> + IntoIterator + Default,

Combine all an iterator’s elements into one element by using Extend. Read more
source§

fn collect_vec(self) -> Vec<Self::Item, Global>where Self: Sized,

.collect_vec() is simply a type specialization of Iterator::collect, -for convenience.
source§

fn try_collect<T, U, E>(self) -> Result<U, E>where +for convenience.

source§

fn try_collect<T, U, E>(self) -> Result<U, E>where Self: Sized + Iterator<Item = Result<T, E>>, Result<U, E>: FromIterator<Result<T, E>>,

.try_collect() is more convenient way of writing -.collect::<Result<_, _>>() Read more
source§

fn set_from<'a, A, J>(&mut self, from: J) -> usizewhere +.collect::<Result<_, _>>() Read more

source§

fn set_from<'a, A, J>(&mut self, from: J) -> usizewhere A: 'a, Self: Iterator<Item = &'a mut A>, J: IntoIterator<Item = A>,

Assign to each reference in self from the from iterator, -stopping at the shortest of the two iterators. Read more
source§

fn join(&mut self, sep: &str) -> Stringwhere - Self::Item: Display,

Combine all iterator elements into one String, separated by sep. Read more
source§

fn format(self, sep: &str) -> Format<'_, Self>where - Self: Sized,

Format all iterator elements, separated by sep. Read more
source§

fn format_with<F>(self, sep: &str, format: F) -> FormatWith<'_, Self, F>where +stopping at the shortest of the two iterators. Read more

source§

fn join(&mut self, sep: &str) -> Stringwhere + Self::Item: Display,

Combine all iterator elements into one String, separated by sep. Read more
source§

fn format(self, sep: &str) -> Format<'_, Self>where + Self: Sized,

Format all iterator elements, separated by sep. Read more
source§

fn format_with<F>(self, sep: &str, format: F) -> FormatWith<'_, Self, F>where Self: Sized, - F: FnMut(Self::Item, &mut dyn FnMut(&dyn Display) -> Result<(), Error>) -> Result<(), Error>,

Format all iterator elements, separated by sep. Read more
source§

fn fold_results<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>where + F: FnMut(Self::Item, &mut dyn FnMut(&dyn Display) -> Result<(), Error>) -> Result<(), Error>,

Format all iterator elements, separated by sep. Read more
source§

fn fold_results<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>where Self: Iterator<Item = Result<A, E>>, - F: FnMut(B, A) -> B,

👎Deprecated since 0.10.0: Use .fold_ok() instead
See .fold_ok().
source§

fn fold_ok<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>where + F: FnMut(B, A) -> B,

👎Deprecated since 0.10.0: Use .fold_ok() instead
See .fold_ok().
source§

fn fold_ok<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>where Self: Iterator<Item = Result<A, E>>, - F: FnMut(B, A) -> B,

Fold Result values from an iterator. Read more
source§

fn fold_options<A, B, F>(&mut self, start: B, f: F) -> Option<B>where + F: FnMut(B, A) -> B,

Fold Result values from an iterator. Read more
source§

fn fold_options<A, B, F>(&mut self, start: B, f: F) -> Option<B>where Self: Iterator<Item = Option<A>>, - F: FnMut(B, A) -> B,

Fold Option values from an iterator. Read more
source§

fn fold1<F>(self, f: F) -> Option<Self::Item>where + F: FnMut(B, A) -> B,

Fold Option values from an iterator. Read more
source§

fn fold1<F>(self, f: F) -> Option<Self::Item>where F: FnMut(Self::Item, Self::Item) -> Self::Item, - Self: Sized,

👎Deprecated since 0.10.2: Use Iterator::reduce instead
Accumulator of the elements in the iterator. Read more
source§

fn tree_fold1<F>(self, f: F) -> Option<Self::Item>where + Self: Sized,

👎Deprecated since 0.10.2: Use Iterator::reduce instead
Accumulator of the elements in the iterator. Read more
source§

fn tree_fold1<F>(self, f: F) -> Option<Self::Item>where F: FnMut(Self::Item, Self::Item) -> Self::Item, - Self: Sized,

Accumulate the elements in the iterator in a tree-like manner. Read more
source§

fn fold_while<B, F>(&mut self, init: B, f: F) -> FoldWhile<B>where + Self: Sized,

Accumulate the elements in the iterator in a tree-like manner. Read more
source§

fn fold_while<B, F>(&mut self, init: B, f: F) -> FoldWhile<B>where Self: Sized, - F: FnMut(B, Self::Item) -> FoldWhile<B>,

An iterator method that applies a function, producing a single, final value. Read more
source§

fn sum1<S>(self) -> Option<S>where + F: FnMut(B, Self::Item) -> FoldWhile<B>,

An iterator method that applies a function, producing a single, final value. Read more
source§

fn sum1<S>(self) -> Option<S>where Self: Sized, - S: Sum<Self::Item>,

Iterate over the entire iterator and add all the elements. Read more
source§

fn product1<P>(self) -> Option<P>where + S: Sum<Self::Item>,

Iterate over the entire iterator and add all the elements. Read more
source§

fn product1<P>(self) -> Option<P>where Self: Sized, - P: Product<Self::Item>,

Iterate over the entire iterator and multiply all the elements. Read more
source§

fn sorted_unstable(self) -> IntoIter<Self::Item, Global>where + P: Product<Self::Item>,

Iterate over the entire iterator and multiply all the elements. Read more
source§

fn sorted_unstable(self) -> IntoIter<Self::Item, Global>where Self: Sized, - Self::Item: Ord,

Sort all iterator elements into a new iterator in ascending order. Read more
source§

fn sorted_unstable_by<F>(self, cmp: F) -> IntoIter<Self::Item, Global>where + Self::Item: Ord,

Sort all iterator elements into a new iterator in ascending order. Read more
source§

fn sorted_unstable_by<F>(self, cmp: F) -> IntoIter<Self::Item, Global>where Self: Sized, - F: FnMut(&Self::Item, &Self::Item) -> Ordering,

Sort all iterator elements into a new iterator in ascending order. Read more
source§

fn sorted_unstable_by_key<K, F>(self, f: F) -> IntoIter<Self::Item, Global>where + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

Sort all iterator elements into a new iterator in ascending order. Read more
source§

fn sorted_unstable_by_key<K, F>(self, f: F) -> IntoIter<Self::Item, Global>where Self: Sized, K: Ord, - F: FnMut(&Self::Item) -> K,

Sort all iterator elements into a new iterator in ascending order. Read more
source§

fn sorted(self) -> IntoIter<Self::Item, Global>where + F: FnMut(&Self::Item) -> K,

Sort all iterator elements into a new iterator in ascending order. Read more
source§

fn sorted(self) -> IntoIter<Self::Item, Global>where Self: Sized, - Self::Item: Ord,

Sort all iterator elements into a new iterator in ascending order. Read more
source§

fn sorted_by<F>(self, cmp: F) -> IntoIter<Self::Item, Global>where + Self::Item: Ord,

Sort all iterator elements into a new iterator in ascending order. Read more
source§

fn sorted_by<F>(self, cmp: F) -> IntoIter<Self::Item, Global>where Self: Sized, - F: FnMut(&Self::Item, &Self::Item) -> Ordering,

Sort all iterator elements into a new iterator in ascending order. Read more
source§

fn sorted_by_key<K, F>(self, f: F) -> IntoIter<Self::Item, Global>where + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

Sort all iterator elements into a new iterator in ascending order. Read more
source§

fn sorted_by_key<K, F>(self, f: F) -> IntoIter<Self::Item, Global>where Self: Sized, K: Ord, - F: FnMut(&Self::Item) -> K,

Sort all iterator elements into a new iterator in ascending order. Read more
source§

fn sorted_by_cached_key<K, F>(self, f: F) -> IntoIter<Self::Item, Global>where + F: FnMut(&Self::Item) -> K,

Sort all iterator elements into a new iterator in ascending order. Read more
source§

fn sorted_by_cached_key<K, F>(self, f: F) -> IntoIter<Self::Item, Global>where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

Sort all iterator elements into a new iterator in ascending order. The key function is -called exactly once per key. Read more
source§

fn k_smallest(self, k: usize) -> IntoIter<Self::Item, Global>where +called exactly once per key. Read more

source§

fn k_smallest(self, k: usize) -> IntoIter<Self::Item, Global>where Self: Sized, - Self::Item: Ord,

Sort the k smallest elements into a new iterator, in ascending order. Read more
source§

fn partition_map<A, B, F, L, R>(self, predicate: F) -> (A, B)where + Self::Item: Ord,

Sort the k smallest elements into a new iterator, in ascending order. Read more
source§

fn partition_map<A, B, F, L, R>(self, predicate: F) -> (A, B)where Self: Sized, F: FnMut(Self::Item) -> Either<L, R>, A: Default + Extend<L>, B: Default + Extend<R>,

Collect all iterator elements into one of two partitions. Unlike Iterator::partition, each partition may -have a distinct type. Read more
source§

fn partition_result<A, B, T, E>(self) -> (A, B)where +have a distinct type. Read more

source§

fn partition_result<A, B, T, E>(self) -> (A, B)where Self: Iterator<Item = Result<T, E>> + Sized, A: Default + Extend<T>, B: Default + Extend<E>,

Partition a sequence of Results into one list of all the Ok elements -and another list of all the Err elements. Read more
source§

fn into_group_map<K, V>(self) -> HashMap<K, Vec<V, Global>, RandomState>where +and another list of all the Err elements. Read more

source§

fn into_group_map<K, V>(self) -> HashMap<K, Vec<V, Global>, RandomState>where Self: Iterator<Item = (K, V)> + Sized, K: Hash + Eq,

Return a HashMap of keys mapped to Vecs of values. Keys and values -are taken from (Key, Value) tuple pairs yielded by the input iterator. Read more
source§

fn into_group_map_by<K, V, F>( +are taken from (Key, Value) tuple pairs yielded by the input iterator. Read more

source§

fn into_group_map_by<K, V, F>( self, f: F ) -> HashMap<K, Vec<V, Global>, RandomState>where Self: Iterator<Item = V> + Sized, K: Hash + Eq, F: Fn(&V) -> K,

Return an Iterator on a HashMap. Keys mapped to Vecs of values. The key is specified -in the closure. Read more
source§

fn into_grouping_map<K, V>(self) -> GroupingMap<Self>where +in the closure. Read more

source§

fn into_grouping_map<K, V>(self) -> GroupingMap<Self>where Self: Iterator<Item = (K, V)> + Sized, - K: Hash + Eq,

Constructs a GroupingMap to be used later with one of the efficient -group-and-fold operations it allows to perform. Read more
source§

fn into_grouping_map_by<K, V, F>( + K: Hash + Eq,

Constructs a GroupingMap to be used later with one of the efficient +group-and-fold operations it allows to perform. Read more
source§

fn into_grouping_map_by<K, V, F>( self, key_mapper: F ) -> GroupingMap<MapForGrouping<Self, F>>where Self: Iterator<Item = V> + Sized, K: Hash + Eq, - F: FnMut(&V) -> K,

Constructs a GroupingMap to be used later with one of the efficient -group-and-fold operations it allows to perform. Read more
source§

fn min_set(self) -> Vec<Self::Item, Global>where + F: FnMut(&V) -> K,

Constructs a GroupingMap to be used later with one of the efficient +group-and-fold operations it allows to perform. Read more
source§

fn min_set(self) -> Vec<Self::Item, Global>where Self: Sized, - Self::Item: Ord,

Return all minimum elements of an iterator. Read more
source§

fn min_set_by<F>(self, compare: F) -> Vec<Self::Item, Global>where + Self::Item: Ord,

Return all minimum elements of an iterator. Read more
source§

fn min_set_by<F>(self, compare: F) -> Vec<Self::Item, Global>where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

Return all minimum elements of an iterator, as determined by -the specified function. Read more
source§

fn min_set_by_key<K, F>(self, key: F) -> Vec<Self::Item, Global>where +the specified function. Read more

source§

fn min_set_by_key<K, F>(self, key: F) -> Vec<Self::Item, Global>where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

Return all minimum elements of an iterator, as determined by -the specified function. Read more
source§

fn max_set(self) -> Vec<Self::Item, Global>where +the specified function. Read more

source§

fn max_set(self) -> Vec<Self::Item, Global>where Self: Sized, - Self::Item: Ord,

Return all maximum elements of an iterator. Read more
source§

fn max_set_by<F>(self, compare: F) -> Vec<Self::Item, Global>where + Self::Item: Ord,

Return all maximum elements of an iterator. Read more
source§

fn max_set_by<F>(self, compare: F) -> Vec<Self::Item, Global>where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

Return all maximum elements of an iterator, as determined by -the specified function. Read more
source§

fn max_set_by_key<K, F>(self, key: F) -> Vec<Self::Item, Global>where +the specified function. Read more

source§

fn max_set_by_key<K, F>(self, key: F) -> Vec<Self::Item, Global>where Self: Sized, K: Ord, - F: FnMut(&Self::Item) -> K,

Return all minimum elements of an iterator, as determined by -the specified function. Read more
source§

fn minmax(self) -> MinMaxResult<Self::Item>where + F: FnMut(&Self::Item) -> K,

Return all maximum elements of an iterator, as determined by +the specified function. Read more
source§

fn minmax(self) -> MinMaxResult<Self::Item>where Self: Sized, - Self::Item: PartialOrd<Self::Item>,

Return the minimum and maximum elements in the iterator. Read more
source§

fn minmax_by_key<K, F>(self, key: F) -> MinMaxResult<Self::Item>where + Self::Item: PartialOrd<Self::Item>,

Return the minimum and maximum elements in the iterator. Read more
source§

fn minmax_by_key<K, F>(self, key: F) -> MinMaxResult<Self::Item>where Self: Sized, K: PartialOrd<K>, F: FnMut(&Self::Item) -> K,

Return the minimum and maximum element of an iterator, as determined by -the specified function. Read more
source§

fn minmax_by<F>(self, compare: F) -> MinMaxResult<Self::Item>where +the specified function. Read more

source§

fn minmax_by<F>(self, compare: F) -> MinMaxResult<Self::Item>where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

Return the minimum and maximum element of an iterator, as determined by -the specified comparison function. Read more
source§

fn position_max(self) -> Option<usize>where +the specified comparison function. Read more

source§

fn position_max(self) -> Option<usize>where Self: Sized, - Self::Item: Ord,

Return the position of the maximum element in the iterator. Read more
source§

fn position_max_by_key<K, F>(self, key: F) -> Option<usize>where + Self::Item: Ord,

Return the position of the maximum element in the iterator. Read more
source§

fn position_max_by_key<K, F>(self, key: F) -> Option<usize>where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

Return the position of the maximum element in the iterator, as -determined by the specified function. Read more
source§

fn position_max_by<F>(self, compare: F) -> Option<usize>where +determined by the specified function. Read more

source§

fn position_max_by<F>(self, compare: F) -> Option<usize>where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

Return the position of the maximum element in the iterator, as -determined by the specified comparison function. Read more
source§

fn position_min(self) -> Option<usize>where +determined by the specified comparison function. Read more

source§

fn position_min(self) -> Option<usize>where Self: Sized, - Self::Item: Ord,

Return the position of the minimum element in the iterator. Read more
source§

fn position_min_by_key<K, F>(self, key: F) -> Option<usize>where + Self::Item: Ord,

Return the position of the minimum element in the iterator. Read more
source§

fn position_min_by_key<K, F>(self, key: F) -> Option<usize>where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

Return the position of the minimum element in the iterator, as -determined by the specified function. Read more
source§

fn position_min_by<F>(self, compare: F) -> Option<usize>where +determined by the specified function. Read more

source§

fn position_min_by<F>(self, compare: F) -> Option<usize>where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

Return the position of the minimum element in the iterator, as -determined by the specified comparison function. Read more
source§

fn position_minmax(self) -> MinMaxResult<usize>where +determined by the specified comparison function. Read more

source§

fn position_minmax(self) -> MinMaxResult<usize>where Self: Sized, Self::Item: PartialOrd<Self::Item>,

Return the positions of the minimum and maximum elements in -the iterator. Read more
source§

fn position_minmax_by_key<K, F>(self, key: F) -> MinMaxResult<usize>where +the iterator. Read more

source§

fn position_minmax_by_key<K, F>(self, key: F) -> MinMaxResult<usize>where Self: Sized, K: PartialOrd<K>, F: FnMut(&Self::Item) -> K,

Return the postions of the minimum and maximum elements of an -iterator, as determined by the specified function. Read more
source§

fn position_minmax_by<F>(self, compare: F) -> MinMaxResult<usize>where +iterator, as determined by the specified function. Read more

source§

fn position_minmax_by<F>(self, compare: F) -> MinMaxResult<usize>where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

Return the postions of the minimum and maximum elements of an -iterator, as determined by the specified comparison function. Read more
source§

fn exactly_one(self) -> Result<Self::Item, ExactlyOneError<Self>>where +iterator, as determined by the specified comparison function. Read more

source§

fn exactly_one(self) -> Result<Self::Item, ExactlyOneError<Self>>where Self: Sized,

If the iterator yields exactly one element, that element will be returned, otherwise an error will be returned containing an iterator that has the same output as the input -iterator. Read more
source§

fn at_most_one(self) -> Result<Option<Self::Item>, ExactlyOneError<Self>>where +iterator. Read more

source§

fn at_most_one(self) -> Result<Option<Self::Item>, ExactlyOneError<Self>>where Self: Sized,

If the iterator yields no elements, Ok(None) will be returned. If the iterator yields exactly one element, that element will be returned, otherwise an error will be returned -containing an iterator that has the same output as the input iterator. Read more
source§

fn multipeek(self) -> MultiPeek<Self>where +containing an iterator that has the same output as the input iterator. Read more

source§

fn multipeek(self) -> MultiPeek<Self>where Self: Sized,

An iterator adaptor that allows the user to peek at multiple .next() -values without advancing the base iterator. Read more
source§

fn counts(self) -> HashMap<Self::Item, usize, RandomState>where +values without advancing the base iterator. Read more

source§

fn counts(self) -> HashMap<Self::Item, usize, RandomState>where Self: Sized, Self::Item: Eq + Hash,

Collect the items in this iterator and return a HashMap which contains each item that appears in the iterator and the number -of times it appears. Read more
source§

fn counts_by<K, F>(self, f: F) -> HashMap<K, usize, RandomState>where +of times it appears. Read more

source§

fn counts_by<K, F>(self, f: F) -> HashMap<K, usize, RandomState>where Self: Sized, K: Eq + Hash, F: FnMut(Self::Item) -> K,

Collect the items in this iterator and return a HashMap which contains each item that appears in the iterator and the number of times it appears, -determining identity using a keying function. Read more
source§

fn multiunzip<FromI>(self) -> FromIwhere +determining identity using a keying function. Read more

source§

fn multiunzip<FromI>(self) -> FromIwhere Self: Sized + MultiUnzip<FromI>,

Converts an iterator of tuples into a tuple of containers. Read more
source§

impl<T> Same<T> for T

§

type Output = T

Should always be Self
source§

impl<T, U> TryFrom<U> for Twhere U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
const: unstable · source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
source§

impl<T, U> TryInto<U> for Twhere U: TryFrom<T>,

§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
const: unstable · source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
\ No newline at end of file diff --git a/dev/uucore/encoding/enum.DecodeError.html b/dev/uucore/encoding/enum.DecodeError.html index 68900d90a..9b532c9ec 100644 --- a/dev/uucore/encoding/enum.DecodeError.html +++ b/dev/uucore/encoding/enum.DecodeError.html @@ -2,7 +2,7 @@ Decode(DecodeError), DecodeZ85(DecodeError), Io(Error), -}

Variants§

§

Decode(DecodeError)

§

DecodeZ85(DecodeError)

§

Io(Error)

Trait Implementations§

source§

impl Debug for DecodeError

source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
source§

impl Display for DecodeError

source§

fn fmt(&self, __formatter: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
source§

impl Error for DecodeError

source§

fn source(&self) -> Option<&(dyn Error + 'static)>

The lower-level source of this error, if any. Read more
1.0.0 · source§

fn description(&self) -> &str

👎Deprecated since 1.42.0: use the Display impl or to_string()
Read more
1.0.0 · source§

fn cause(&self) -> Option<&dyn Error>

👎Deprecated since 1.33.0: replaced by Error::source, which can support downcasting
source§

fn provide<'a>(&'a self, demand: &mut Demand<'a>)

🔬This is a nightly-only experimental API. (error_generic_member_access)
Provides type based access to context intended for error reports. Read more
source§

impl From<DecodeError> for DecodeError

source§

fn from(source: DecodeError) -> Self

Converts to this type from the input type.
source§

impl From<DecodeError> for DecodeError

source§

fn from(source: DecodeError) -> Self

Converts to this type from the input type.
source§

impl From<Error> for DecodeError

source§

fn from(source: Error) -> Self

Converts to this type from the input type.

Auto Trait Implementations§

§

impl !RefUnwindSafe for DecodeError

§

impl Send for DecodeError

§

impl Sync for DecodeError

§

impl Unpin for DecodeError

§

impl !UnwindSafe for DecodeError

Blanket Implementations§

source§

impl<T> Any for Twhere +}

Variants§

§

Decode(DecodeError)

§

DecodeZ85(DecodeError)

§

Io(Error)

Trait Implementations§

source§

impl Debug for DecodeError

source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
source§

impl Display for DecodeError

source§

fn fmt(&self, __formatter: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
source§

impl Error for DecodeError

source§

fn source(&self) -> Option<&(dyn Error + 'static)>

The lower-level source of this error, if any. Read more
1.0.0 · source§

fn description(&self) -> &str

👎Deprecated since 1.42.0: use the Display impl or to_string()
Read more
1.0.0 · source§

fn cause(&self) -> Option<&dyn Error>

👎Deprecated since 1.33.0: replaced by Error::source, which can support downcasting
source§

fn provide<'a>(&'a self, demand: &mut Demand<'a>)

🔬This is a nightly-only experimental API. (error_generic_member_access)
Provides type based access to context intended for error reports. Read more
source§

impl From<DecodeError> for DecodeError

source§

fn from(source: DecodeError) -> Self

Converts to this type from the input type.
source§

impl From<DecodeError> for DecodeError

source§

fn from(source: DecodeError) -> Self

Converts to this type from the input type.
source§

impl From<Error> for DecodeError

source§

fn from(source: Error) -> Self

Converts to this type from the input type.

Auto Trait Implementations§

Blanket Implementations§

source§

impl<T> Any for Twhere T: 'static + ?Sized,

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for Twhere T: ?Sized,

const: unstable · source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for Twhere T: ?Sized,

const: unstable · source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

const: unstable · source§

fn from(t: T) -> T

Returns the argument unchanged.

diff --git a/dev/uucore/entries/struct.Group.html b/dev/uucore/entries/struct.Group.html index e52678a90..fe5302e44 100644 --- a/dev/uucore/entries/struct.Group.html +++ b/dev/uucore/entries/struct.Group.html @@ -3,7 +3,7 @@ pub gid: gid_t, }

Fields§

§name: String

AKA group.gr_name

§gid: gid_t

AKA group.gr_gid

-

Trait Implementations§

source§

impl Clone for Group

source§

fn clone(&self) -> Group

Returns a copy of the value. Read more
1.0.0 · source§

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source. Read more
source§

impl Debug for Group

source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
source§

impl<'a> Locate<&'a str> for Group

source§

fn locate(k: &'a str) -> IOResult<Self>

source§

impl Locate<u32> for Group

source§

fn locate(k: gid_t) -> IOResult<Self>

Auto Trait Implementations§

§

impl RefUnwindSafe for Group

§

impl Send for Group

§

impl Sync for Group

§

impl Unpin for Group

§

impl UnwindSafe for Group

Blanket Implementations§

source§

impl<T> Any for Twhere +

Trait Implementations§

source§

impl Clone for Group

source§

fn clone(&self) -> Group

Returns a copy of the value. Read more
1.0.0 · source§

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source. Read more
source§

impl Debug for Group

source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
source§

impl<'a> Locate<&'a str> for Group

source§

fn locate(k: &'a str) -> IOResult<Self>

source§

impl Locate<u32> for Group

source§

fn locate(k: gid_t) -> IOResult<Self>

Auto Trait Implementations§

§

impl RefUnwindSafe for Group

§

impl Send for Group

§

impl Sync for Group

§

impl Unpin for Group

§

impl UnwindSafe for Group

Blanket Implementations§

source§

impl<T> Any for Twhere T: 'static + ?Sized,

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for Twhere T: ?Sized,

const: unstable · source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for Twhere T: ?Sized,

const: unstable · source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

const: unstable · source§

fn from(t: T) -> T

Returns the argument unchanged.

diff --git a/dev/uucore/entries/struct.Passwd.html b/dev/uucore/entries/struct.Passwd.html index c90b4fbff..48b090ffa 100644 --- a/dev/uucore/entries/struct.Passwd.html +++ b/dev/uucore/entries/struct.Passwd.html @@ -27,7 +27,7 @@ call getgrouplist().

not update ngroups if ngroups is too small. Therefore, if not updated by getgrouplist, ngroups needs to be increased in a loop until getgrouplist stops returning -1.

-

Trait Implementations§

source§

impl Clone for Passwd

source§

fn clone(&self) -> Passwd

Returns a copy of the value. Read more
1.0.0 · source§

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source. Read more
source§

impl Debug for Passwd

source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
source§

impl<'a> Locate<&'a str> for Passwd

source§

fn locate(k: &'a str) -> IOResult<Self>

source§

impl Locate<u32> for Passwd

source§

fn locate(k: uid_t) -> IOResult<Self>

Auto Trait Implementations§

Blanket Implementations§

source§

impl<T> Any for Twhere +

Trait Implementations§

source§

impl Clone for Passwd

source§

fn clone(&self) -> Passwd

Returns a copy of the value. Read more
1.0.0 · source§

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source. Read more
source§

impl Debug for Passwd

source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
source§

impl<'a> Locate<&'a str> for Passwd

source§

fn locate(k: &'a str) -> IOResult<Self>

source§

impl Locate<u32> for Passwd

source§

fn locate(k: uid_t) -> IOResult<Self>

Auto Trait Implementations§

Blanket Implementations§

source§

impl<T> Any for Twhere T: 'static + ?Sized,

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for Twhere T: ?Sized,

const: unstable · source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for Twhere T: ?Sized,

const: unstable · source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

const: unstable · source§

fn from(t: T) -> T

Returns the argument unchanged.

diff --git a/dev/uucore/error/struct.ClapErrorWrapper.html b/dev/uucore/error/struct.ClapErrorWrapper.html index adc7e00a0..7cf2233a6 100644 --- a/dev/uucore/error/struct.ClapErrorWrapper.html +++ b/dev/uucore/error/struct.ClapErrorWrapper.html @@ -13,7 +13,7 @@ a let command = clap::Command::new("test"); let result: Result<_, Box<dyn UError>> = command.try_get_matches().map_err(Into::into);
-

Trait Implementations§

source§

impl Debug for ClapErrorWrapper

source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
source§

impl Display for ClapErrorWrapper

source§

fn fmt(&self, _f: &mut Formatter<'_>) -> Result<(), Error>

Formats the value using the given formatter. Read more
source§

impl Error for ClapErrorWrapper

1.30.0 · source§

fn source(&self) -> Option<&(dyn Error + 'static)>

The lower-level source of this error, if any. Read more
1.0.0 · source§

fn description(&self) -> &str

👎Deprecated since 1.42.0: use the Display impl or to_string()
Read more
1.0.0 · source§

fn cause(&self) -> Option<&dyn Error>

👎Deprecated since 1.33.0: replaced by Error::source, which can support downcasting
source§

fn provide<'a>(&'a self, demand: &mut Demand<'a>)

🔬This is a nightly-only experimental API. (error_generic_member_access)
Provides type based access to context intended for error reports. Read more
source§

impl UClapError<ClapErrorWrapper> for Error

source§

fn with_exit_code(self, code: i32) -> ClapErrorWrapper

source§

impl UError for ClapErrorWrapper

source§

fn code(&self) -> i32

Error code of a custom error. Read more
source§

fn usage(&self) -> bool

Print usage help to a custom error. Read more

Auto Trait Implementations§

Blanket Implementations§

source§

impl<T> Any for Twhere +

Trait Implementations§

source§

impl Debug for ClapErrorWrapper

source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
source§

impl Display for ClapErrorWrapper

source§

fn fmt(&self, _f: &mut Formatter<'_>) -> Result<(), Error>

Formats the value using the given formatter. Read more
source§

impl Error for ClapErrorWrapper

1.30.0 · source§

fn source(&self) -> Option<&(dyn Error + 'static)>

The lower-level source of this error, if any. Read more
1.0.0 · source§

fn description(&self) -> &str

👎Deprecated since 1.42.0: use the Display impl or to_string()
Read more
1.0.0 · source§

fn cause(&self) -> Option<&dyn Error>

👎Deprecated since 1.33.0: replaced by Error::source, which can support downcasting
source§

fn provide<'a>(&'a self, demand: &mut Demand<'a>)

🔬This is a nightly-only experimental API. (error_generic_member_access)
Provides type based access to context intended for error reports. Read more
source§

impl UClapError<ClapErrorWrapper> for Error

source§

fn with_exit_code(self, code: i32) -> ClapErrorWrapper

source§

impl UError for ClapErrorWrapper

source§

fn code(&self) -> i32

Error code of a custom error. Read more
source§

fn usage(&self) -> bool

Print usage help to a custom error. Read more

Auto Trait Implementations§

Blanket Implementations§

source§

impl<T> Any for Twhere T: 'static + ?Sized,

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for Twhere T: ?Sized,

const: unstable · source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for Twhere T: ?Sized,

const: unstable · source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

const: unstable · source§

fn from(t: T) -> T

Returns the argument unchanged.

diff --git a/dev/uucore/error/struct.UIoError.html b/dev/uucore/error/struct.UIoError.html index d4efe6593..44b8cb414 100644 --- a/dev/uucore/error/struct.UIoError.html +++ b/dev/uucore/error/struct.UIoError.html @@ -21,7 +21,7 @@ coreutils.

// Converting from an `std::io::Error`. let res: UResult<File> = File::open(path).map_err_context(|| format!("cannot access {}", path.quote()));
-

Implementations§

source§

impl UIoError

source

pub fn new<S: Into<String>>(kind: ErrorKind, context: S) -> Box<dyn UError>

Trait Implementations§

source§

impl Debug for UIoError

source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
source§

impl Display for UIoError

source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>

Formats the value using the given formatter. Read more
source§

impl Error for UIoError

1.30.0 · source§

fn source(&self) -> Option<&(dyn Error + 'static)>

The lower-level source of this error, if any. Read more
1.0.0 · source§

fn description(&self) -> &str

👎Deprecated since 1.42.0: use the Display impl or to_string()
Read more
1.0.0 · source§

fn cause(&self) -> Option<&dyn Error>

👎Deprecated since 1.33.0: replaced by Error::source, which can support downcasting
source§

fn provide<'a>(&'a self, demand: &mut Demand<'a>)

🔬This is a nightly-only experimental API. (error_generic_member_access)
Provides type based access to context intended for error reports. Read more
source§

impl From<Errno> for UIoError

source§

fn from(f: Error) -> Self

Converts to this type from the input type.
source§

impl From<Error> for UIoError

source§

fn from(f: Error) -> Self

Converts to this type from the input type.
source§

impl UError for UIoError

source§

fn code(&self) -> i32

Error code of a custom error. Read more
source§

fn usage(&self) -> bool

Print usage help to a custom error. Read more

Auto Trait Implementations§

Blanket Implementations§

source§

impl<T> Any for Twhere +

Implementations§

source§

impl UIoError

source

pub fn new<S: Into<String>>(kind: ErrorKind, context: S) -> Box<dyn UError>

Trait Implementations§

source§

impl Debug for UIoError

source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
source§

impl Display for UIoError

source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>

Formats the value using the given formatter. Read more
source§

impl Error for UIoError

1.30.0 · source§

fn source(&self) -> Option<&(dyn Error + 'static)>

The lower-level source of this error, if any. Read more
1.0.0 · source§

fn description(&self) -> &str

👎Deprecated since 1.42.0: use the Display impl or to_string()
Read more
1.0.0 · source§

fn cause(&self) -> Option<&dyn Error>

👎Deprecated since 1.33.0: replaced by Error::source, which can support downcasting
source§

fn provide<'a>(&'a self, demand: &mut Demand<'a>)

🔬This is a nightly-only experimental API. (error_generic_member_access)
Provides type based access to context intended for error reports. Read more
source§

impl From<Errno> for UIoError

source§

fn from(f: Error) -> Self

Converts to this type from the input type.
source§

impl From<Error> for UIoError

source§

fn from(f: Error) -> Self

Converts to this type from the input type.
source§

impl UError for UIoError

source§

fn code(&self) -> i32

Error code of a custom error. Read more
source§

fn usage(&self) -> bool

Print usage help to a custom error. Read more

Auto Trait Implementations§

Blanket Implementations§

source§

impl<T> Any for Twhere T: 'static + ?Sized,

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for Twhere T: ?Sized,

const: unstable · source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for Twhere T: ?Sized,

const: unstable · source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

const: unstable · source§

fn from(t: T) -> T

Returns the argument unchanged.

diff --git a/dev/uucore/error/struct.USimpleError.html b/dev/uucore/error/struct.USimpleError.html index 8f109c887..8d45ea5dc 100644 --- a/dev/uucore/error/struct.USimpleError.html +++ b/dev/uucore/error/struct.USimpleError.html @@ -8,7 +8,7 @@ let res: UResult<()> = Err(err.into()); // or using the `new` method: let res: UResult<()> = Err(USimpleError::new(1, "error!"));
-

Fields§

§code: i32§message: String

Implementations§

source§

impl USimpleError

source

pub fn new<S: Into<String>>(code: i32, message: S) -> Box<dyn UError>

Trait Implementations§

source§

impl Debug for USimpleError

source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
source§

impl Display for USimpleError

source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>

Formats the value using the given formatter. Read more
source§

impl Error for USimpleError

1.30.0 · source§

fn source(&self) -> Option<&(dyn Error + 'static)>

The lower-level source of this error, if any. Read more
1.0.0 · source§

fn description(&self) -> &str

👎Deprecated since 1.42.0: use the Display impl or to_string()
Read more
1.0.0 · source§

fn cause(&self) -> Option<&dyn Error>

👎Deprecated since 1.33.0: replaced by Error::source, which can support downcasting
source§

fn provide<'a>(&'a self, demand: &mut Demand<'a>)

🔬This is a nightly-only experimental API. (error_generic_member_access)
Provides type based access to context intended for error reports. Read more
source§

impl UError for USimpleError

source§

fn code(&self) -> i32

Error code of a custom error. Read more
source§

fn usage(&self) -> bool

Print usage help to a custom error. Read more

Auto Trait Implementations§

Blanket Implementations§

source§

impl<T> Any for Twhere +

Fields§

§code: i32§message: String

Implementations§

source§

impl USimpleError

source

pub fn new<S: Into<String>>(code: i32, message: S) -> Box<dyn UError>

Trait Implementations§

source§

impl Debug for USimpleError

source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
source§

impl Display for USimpleError

source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>

Formats the value using the given formatter. Read more
source§

impl Error for USimpleError

1.30.0 · source§

fn source(&self) -> Option<&(dyn Error + 'static)>

The lower-level source of this error, if any. Read more
1.0.0 · source§

fn description(&self) -> &str

👎Deprecated since 1.42.0: use the Display impl or to_string()
Read more
1.0.0 · source§

fn cause(&self) -> Option<&dyn Error>

👎Deprecated since 1.33.0: replaced by Error::source, which can support downcasting
source§

fn provide<'a>(&'a self, demand: &mut Demand<'a>)

🔬This is a nightly-only experimental API. (error_generic_member_access)
Provides type based access to context intended for error reports. Read more
source§

impl UError for USimpleError

source§

fn code(&self) -> i32

Error code of a custom error. Read more
source§

fn usage(&self) -> bool

Print usage help to a custom error. Read more

Auto Trait Implementations§

Blanket Implementations§

source§

impl<T> Any for Twhere T: 'static + ?Sized,

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for Twhere T: ?Sized,

const: unstable · source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for Twhere T: ?Sized,

const: unstable · source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

const: unstable · source§

fn from(t: T) -> T

Returns the argument unchanged.

diff --git a/dev/uucore/error/struct.UUsageError.html b/dev/uucore/error/struct.UUsageError.html index 302e7d316..985bbb100 100644 --- a/dev/uucore/error/struct.UUsageError.html +++ b/dev/uucore/error/struct.UUsageError.html @@ -1,7 +1,7 @@ UUsageError in uucore::error - Rust

Struct uucore::error::UUsageError

source · 
pub struct UUsageError {
     pub code: i32,
     pub message: String,
-}

Fields§

§code: i32§message: String

Implementations§

source§

impl UUsageError

source

pub fn new<S: Into<String>>(code: i32, message: S) -> Box<dyn UError>

Trait Implementations§

source§

impl Debug for UUsageError

source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
source§

impl Display for UUsageError

source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>

Formats the value using the given formatter. Read more
source§

impl Error for UUsageError

1.30.0 · source§

fn source(&self) -> Option<&(dyn Error + 'static)>

The lower-level source of this error, if any. Read more
1.0.0 · source§

fn description(&self) -> &str

👎Deprecated since 1.42.0: use the Display impl or to_string()
Read more
1.0.0 · source§

fn cause(&self) -> Option<&dyn Error>

👎Deprecated since 1.33.0: replaced by Error::source, which can support downcasting
source§

fn provide<'a>(&'a self, demand: &mut Demand<'a>)

🔬This is a nightly-only experimental API. (error_generic_member_access)
Provides type based access to context intended for error reports. Read more
source§

impl UError for UUsageError

source§

fn code(&self) -> i32

Error code of a custom error. Read more
source§

fn usage(&self) -> bool

Print usage help to a custom error. Read more

Auto Trait Implementations§

Blanket Implementations§

source§

impl<T> Any for Twhere +}

Fields§

§code: i32§message: String

Implementations§

source§

impl UUsageError

source

pub fn new<S: Into<String>>(code: i32, message: S) -> Box<dyn UError>

Trait Implementations§

source§

impl Debug for UUsageError

source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
source§

impl Display for UUsageError

source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>

Formats the value using the given formatter. Read more
source§

impl Error for UUsageError

1.30.0 · source§

fn source(&self) -> Option<&(dyn Error + 'static)>

The lower-level source of this error, if any. Read more
1.0.0 · source§

fn description(&self) -> &str

👎Deprecated since 1.42.0: use the Display impl or to_string()
Read more
1.0.0 · source§

fn cause(&self) -> Option<&dyn Error>

👎Deprecated since 1.33.0: replaced by Error::source, which can support downcasting
source§

fn provide<'a>(&'a self, demand: &mut Demand<'a>)

🔬This is a nightly-only experimental API. (error_generic_member_access)
Provides type based access to context intended for error reports. Read more
source§

impl UError for UUsageError

source§

fn code(&self) -> i32

Error code of a custom error. Read more
source§

fn usage(&self) -> bool

Print usage help to a custom error. Read more

Auto Trait Implementations§

Blanket Implementations§

source§

impl<T> Any for Twhere T: 'static + ?Sized,

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for Twhere T: ?Sized,

const: unstable · source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for Twhere T: ?Sized,

const: unstable · source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

const: unstable · source§

fn from(t: T) -> T

Returns the argument unchanged.

diff --git a/dev/uucore/error/trait.FromIo.html b/dev/uucore/error/trait.FromIo.html index f2e347881..0d1b3249a 100644 --- a/dev/uucore/error/trait.FromIo.html +++ b/dev/uucore/error/trait.FromIo.html @@ -3,7 +3,7 @@ fn map_err_context(self, context: impl FnOnce() -> String) -> T; }
Expand description

Enables the conversion from std::io::Error to UError and from std::io::Result to UResult.

-

Required Methods§

source

fn map_err_context(self, context: impl FnOnce() -> String) -> T

Implementations on Foreign Types§

source§

impl<T> FromIo<Result<T, Box<dyn UError + 'static, Global>>> for Result<T>

source§

fn map_err_context(self, context: impl FnOnce() -> String) -> UResult<T>

source§

impl FromIo<Box<UIoError, Global>> for Error

source§

fn map_err_context(self, context: impl FnOnce() -> String) -> Box<UIoError>

source§

impl<T> FromIo<Result<T, Box<dyn UError + 'static, Global>>> for Result<T, Error>

Enables the conversion from Result<T, nix::Error> to UResult<T>.

+

Required Methods§

source

fn map_err_context(self, context: impl FnOnce() -> String) -> T

Implementations on Foreign Types§

source§

impl FromIo<Box<UIoError, Global>> for ErrorKind

source§

fn map_err_context(self, context: impl FnOnce() -> String) -> Box<UIoError>

source§

impl<T> FromIo<Result<T, Box<dyn UError + 'static, Global>>> for Result<T>

source§

fn map_err_context(self, context: impl FnOnce() -> String) -> UResult<T>

source§

impl<T> FromIo<Result<T, Box<dyn UError + 'static, Global>>> for Result<T, Error>

Enables the conversion from Result<T, nix::Error> to UResult<T>.

Examples

use uucore::error::FromIo;
 use nix::errno::Errno;
@@ -13,4 +13,4 @@
 
 // prints "fix me please!: Permission denied"
 println!("{}", uio_result.unwrap_err());
-
source§

fn map_err_context(self, context: impl FnOnce() -> String) -> UResult<T>

source§

impl FromIo<Box<UIoError, Global>> for ErrorKind

source§

fn map_err_context(self, context: impl FnOnce() -> String) -> Box<UIoError>

Implementors§

source§

impl<T> FromIo<Result<T, Box<dyn UError + 'static, Global>>> for uucore::pipes::Error

\ No newline at end of file +
source§

fn map_err_context(self, context: impl FnOnce() -> String) -> UResult<T>

source§

impl FromIo<Box<UIoError, Global>> for Error

source§

fn map_err_context(self, context: impl FnOnce() -> String) -> Box<UIoError>

Implementors§

source§

impl<T> FromIo<Result<T, Box<dyn UError + 'static, Global>>> for uucore::pipes::Error

\ No newline at end of file diff --git a/dev/uucore/error/trait.UError.html b/dev/uucore/error/trait.UError.html index b1c296d5c..9ebd5868f 100644 --- a/dev/uucore/error/trait.UError.html +++ b/dev/uucore/error/trait.UError.html @@ -143,5 +143,5 @@ below the error message. The usage help is in the format: “Try {name} -- } } }
-

Trait Implementations§

source§

impl From<Errno> for Box<dyn UError>

source§

fn from(f: Error) -> Self

Converts to this type from the input type.
source§

impl From<Error<RichFormatter>> for Box<dyn UError>

source§

fn from(e: Error) -> Self

Converts to this type from the input type.
source§

impl From<Error> for Box<dyn UError>

source§

fn from(f: Error) -> Self

Converts to this type from the input type.
source§

impl<T> From<T> for Box<dyn UError>where - T: UError + 'static,

source§

fn from(t: T) -> Self

Converts to this type from the input type.
source§

impl From<i32> for Box<dyn UError>

source§

fn from(i: i32) -> Self

Converts to this type from the input type.

Implementors§

\ No newline at end of file +

Trait Implementations§

source§

impl From<Errno> for Box<dyn UError>

source§

fn from(f: Error) -> Self

Converts to this type from the input type.
source§

impl From<Error<RichFormatter>> for Box<dyn UError>

source§

fn from(e: Error) -> Self

Converts to this type from the input type.
source§

impl From<Error> for Box<dyn UError>

source§

fn from(f: Error) -> Self

Converts to this type from the input type.
source§

impl<T> From<T> for Box<dyn UError>where + T: UError + 'static,

source§

fn from(t: T) -> Self

Converts to this type from the input type.
source§

impl From<i32> for Box<dyn UError>

source§

fn from(i: i32) -> Self

Converts to this type from the input type.

Implementors§

source§

impl UError for BackupError

source§

impl UError for ClapErrorWrapper

source§

impl UError for ExitCode

source§

impl UError for UIoError

source§

impl UError for USimpleError

source§

impl UError for UUsageError

\ No newline at end of file diff --git a/dev/uucore/lines/struct.Lines.html b/dev/uucore/lines/struct.Lines.html index bbbc5c07b..3655ac882 100644 --- a/dev/uucore/lines/struct.Lines.html +++ b/dev/uucore/lines/struct.Lines.html @@ -188,86 +188,89 @@ function. From<T> for U chooses to do.

source§

impl<I> IntoIterator for Iwhere - I: Iterator,

§

type Item = <I as Iterator>::Item

The type of the elements being iterated over.
§

type IntoIter = I

Which kind of iterator are we turning this into?
const: unstable · source§

fn into_iter(self) -> I

Creates an iterator from a value. Read more
source§

impl<T> Itertools for Twhere - T: Iterator + ?Sized,

source§

fn interleave<J>( + I: Iterator,

§

type Item = <I as Iterator>::Item

The type of the elements being iterated over.
§

type IntoIter = I

Which kind of iterator are we turning this into?
const: unstable · source§

fn into_iter(self) -> I

Creates an iterator from a value. Read more
source§

impl<T> Itertools for Twhere + T: Iterator + ?Sized,

source§

fn interleave<J>( self, other: J ) -> Interleave<Self, <J as IntoIterator>::IntoIter>where J: IntoIterator<Item = Self::Item>, - Self: Sized,

Alternate elements from two iterators until both have run out. Read more
source§

fn interleave_shortest<J>( + Self: Sized,

Alternate elements from two iterators until both have run out. Read more
source§

fn interleave_shortest<J>( self, other: J ) -> InterleaveShortest<Self, <J as IntoIterator>::IntoIter>where J: IntoIterator<Item = Self::Item>, Self: Sized,

Alternate elements from two iterators until at least one of them has run -out. Read more
source§

fn intersperse( +out. Read more

source§

fn intersperse( self, element: Self::Item ) -> IntersperseWith<Self, IntersperseElementSimple<Self::Item>>where Self: Sized, Self::Item: Clone,

An iterator adaptor to insert a particular value -between each element of the adapted iterator. Read more
source§

fn intersperse_with<F>(self, element: F) -> IntersperseWith<Self, F>where +between each element of the adapted iterator. Read more

source§

fn intersperse_with<F>(self, element: F) -> IntersperseWith<Self, F>where Self: Sized, F: FnMut() -> Self::Item,

An iterator adaptor to insert a particular value created by a function -between each element of the adapted iterator. Read more
source§

fn zip_longest<J>( +between each element of the adapted iterator. Read more

source§

fn zip_longest<J>( self, other: J ) -> ZipLongest<Self, <J as IntoIterator>::IntoIter>where J: IntoIterator, Self: Sized,

Create an iterator which iterates over both this and the specified -iterator simultaneously, yielding pairs of two optional elements. Read more
source§

fn zip_eq<J>(self, other: J) -> ZipEq<Self, <J as IntoIterator>::IntoIter>where +iterator simultaneously, yielding pairs of two optional elements. Read more

source§

fn zip_eq<J>(self, other: J) -> ZipEq<Self, <J as IntoIterator>::IntoIter>where J: IntoIterator, Self: Sized,

Create an iterator which iterates over both this and the specified -iterator simultaneously, yielding pairs of elements. Read more
source§

fn batching<B, F>(self, f: F) -> Batching<Self, F>where +iterator simultaneously, yielding pairs of elements. Read more

source§

fn batching<B, F>(self, f: F) -> Batching<Self, F>where F: FnMut(&mut Self) -> Option<B>, Self: Sized,

A “meta iterator adaptor”. Its closure receives a reference to the iterator and may pick off as many elements as it likes, to produce the -next iterator element. Read more
source§

fn group_by<K, F>(self, key: F) -> GroupBy<K, Self, F>where +next iterator element. Read more

source§

fn group_by<K, F>(self, key: F) -> GroupBy<K, Self, F>where Self: Sized, F: FnMut(&Self::Item) -> K, K: PartialEq<K>,

Return an iterable that can group iterator elements. Consecutive elements that map to the same key (“runs”), are assigned -to the same group. Read more
source§

fn chunks(self, size: usize) -> IntoChunks<Self>where - Self: Sized,

Return an iterable that can chunk the iterator. Read more
source§

fn tuple_windows<T>(self) -> TupleWindows<Self, T>where +to the same group. Read more

source§

fn chunks(self, size: usize) -> IntoChunks<Self>where + Self: Sized,

Return an iterable that can chunk the iterator. Read more
source§

fn tuple_windows<T>(self) -> TupleWindows<Self, T>where Self: Sized + Iterator<Item = <T as TupleCollect>::Item>, T: HomogeneousTuple, <T as TupleCollect>::Item: Clone,

Return an iterator over all contiguous windows producing tuples of -a specific size (up to 12). Read more
source§

fn circular_tuple_windows<T>(self) -> CircularTupleWindows<Self, T>where +a specific size (up to 12). Read more

source§

fn circular_tuple_windows<T>(self) -> CircularTupleWindows<Self, T>where Self: Sized + Clone + Iterator<Item = <T as TupleCollect>::Item> + ExactSizeIterator, T: TupleCollect + Clone, <T as TupleCollect>::Item: Clone,

Return an iterator over all windows, wrapping back to the first elements when the window would otherwise exceed the length of the -iterator, producing tuples of a specific size (up to 12). Read more
source§

fn tuples<T>(self) -> Tuples<Self, T>where +iterator, producing tuples of a specific size (up to 12). Read more

source§

fn tuples<T>(self) -> Tuples<Self, T>where Self: Sized + Iterator<Item = <T as TupleCollect>::Item>, T: HomogeneousTuple,

Return an iterator that groups the items in tuples of a specific size -(up to 12). Read more
source§

fn tee(self) -> (Tee<Self>, Tee<Self>)where +(up to 12). Read more

source§

fn tee(self) -> (Tee<Self>, Tee<Self>)where Self: Sized, Self::Item: Clone,

Split into an iterator pair that both yield all elements from -the original iterator. Read more
source§

fn step(self, n: usize) -> Step<Self>where +the original iterator. Read more

source§

fn step(self, n: usize) -> Step<Self>where Self: Sized,

👎Deprecated since 0.8.0: Use std .step_by() instead
Return an iterator adaptor that steps n elements in the base iterator -for each iteration. Read more
source§

fn map_into<R>(self) -> MapSpecialCase<Self, MapSpecialCaseFnInto<R>>where +for each iteration. Read more

source§

fn map_into<R>(self) -> MapSpecialCase<Self, MapSpecialCaseFnInto<R>>where Self: Sized, - Self::Item: Into<R>,

Convert each item of the iterator using the Into trait. Read more
source§

fn map_results<F, T, U, E>( + Self::Item: Into<R>,

Convert each item of the iterator using the Into trait. Read more
source§

fn map_results<F, T, U, E>( self, f: F ) -> MapSpecialCase<Self, MapSpecialCaseFnOk<F>>where Self: Iterator<Item = Result<T, E>> + Sized, - F: FnMut(T) -> U,

👎Deprecated since 0.10.0: Use .map_ok() instead
See .map_ok().
source§

fn map_ok<F, T, U, E>(self, f: F) -> MapSpecialCase<Self, MapSpecialCaseFnOk<F>>where + F: FnMut(T) -> U,

👎Deprecated since 0.10.0: Use .map_ok() instead
See .map_ok().
source§

fn map_ok<F, T, U, E>(self, f: F) -> MapSpecialCase<Self, MapSpecialCaseFnOk<F>>where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(T) -> U,

Return an iterator adaptor that applies the provided closure to every Result::Ok value. Result::Err values are -unchanged. Read more
source§

fn filter_ok<F, T, E>(self, f: F) -> FilterOk<Self, F>where +unchanged. Read more

source§

fn filter_ok<F, T, E>(self, f: F) -> FilterOk<Self, F>where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(&T) -> bool,

Return an iterator adaptor that filters every Result::Ok value with the provided closure. Result::Err values are -unchanged. Read more
source§

fn filter_map_ok<F, T, U, E>(self, f: F) -> FilterMapOk<Self, F>where +unchanged. Read more

source§

fn filter_map_ok<F, T, U, E>(self, f: F) -> FilterMapOk<Self, F>where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(T) -> Option<U>,

Return an iterator adaptor that filters and transforms every Result::Ok value with the provided closure. Result::Err -values are unchanged. Read more
source§

fn flatten_ok<T, E>(self) -> FlattenOk<Self, T, E>where +values are unchanged. Read more

source§

fn flatten_ok<T, E>(self) -> FlattenOk<Self, T, E>where Self: Iterator<Item = Result<T, E>> + Sized, T: IntoIterator,

Return an iterator adaptor that flattens every Result::Ok value into -a series of Result::Ok values. Result::Err values are unchanged. Read more
source§

fn merge<J>( +a series of Result::Ok values. Result::Err values are unchanged. Read more

source§

fn process_results<F, T, E, R>(self, processor: F) -> Result<R, E>where + Self: Iterator<Item = Result<T, E>> + Sized, + F: FnOnce(ProcessResults<'_, Self, E>) -> R,

“Lift” a function of the values of the current iterator so as to process +an iterator of Result values instead. Read more
source§

fn merge<J>( self, other: J ) -> MergeBy<Self, <J as IntoIterator>::IntoIter, MergeLte>where @@ -275,7 +278,7 @@ a series of Result::Ok values. Result::Err values are Self::Item: PartialOrd<Self::Item>, J: IntoIterator<Item = Self::Item>,

Return an iterator adaptor that merges the two base iterators in ascending order. If both base iterators are sorted (ascending), the -result is sorted. Read more
source§

fn merge_by<J, F>( +result is sorted. Read more

source§

fn merge_by<J, F>( self, other: J, is_first: F @@ -283,26 +286,27 @@ result is sorted. Sized, J: IntoIterator<Item = Self::Item>, F: FnMut(&Self::Item, &Self::Item) -> bool,

Return an iterator adaptor that merges the two base iterators in order. -This is much like .merge() but allows for a custom ordering. Read more
source§

fn merge_join_by<J, F>( +This is much like .merge() but allows for a custom ordering. Read more

source§

fn merge_join_by<J, F, T>( self, other: J, cmp_fn: F ) -> MergeJoinBy<Self, <J as IntoIterator>::IntoIter, F>where J: IntoIterator, - F: FnMut(&Self::Item, &<J as IntoIterator>::Item) -> Ordering, + F: FnMut(&Self::Item, &<J as IntoIterator>::Item) -> T, + T: OrderingOrBool<Self::Item, <J as IntoIterator>::Item>, Self: Sized,

Create an iterator that merges items from both this and the specified -iterator in ascending order. Read more
source§

fn kmerge(self) -> KMergeBy<<Self::Item as IntoIterator>::IntoIter, KMergeByLt>where +iterator in ascending order. Read more

source§

fn kmerge(self) -> KMergeBy<<Self::Item as IntoIterator>::IntoIter, KMergeByLt>where Self: Sized, Self::Item: IntoIterator, <Self::Item as IntoIterator>::Item: PartialOrd<<Self::Item as IntoIterator>::Item>,

Return an iterator adaptor that flattens an iterator of iterators by -merging them in ascending order. Read more
source§

fn kmerge_by<F>( +merging them in ascending order. Read more

source§

fn kmerge_by<F>( self, first: F ) -> KMergeBy<<Self::Item as IntoIterator>::IntoIter, F>where Self: Sized, Self::Item: IntoIterator, F: FnMut(&<Self::Item as IntoIterator>::Item, &<Self::Item as IntoIterator>::Item) -> bool,

Return an iterator adaptor that flattens an iterator of iterators by -merging them according to the given closure. Read more
source§

fn cartesian_product<J>( +merging them according to the given closure. Read more

source§

fn cartesian_product<J>( self, other: J ) -> Product<Self, <J as IntoIterator>::IntoIter>where @@ -310,32 +314,32 @@ merging them according to the given closure. Item: Clone, J: IntoIterator, <J as IntoIterator>::IntoIter: Clone,

Return an iterator adaptor that iterates over the cartesian product of -the element sets of two iterators self and J. Read more
source§

fn multi_cartesian_product( +the element sets of two iterators self and J. Read more

source§

fn multi_cartesian_product( self ) -> MultiProduct<<Self::Item as IntoIterator>::IntoIter>where Self: Sized, Self::Item: IntoIterator, <Self::Item as IntoIterator>::IntoIter: Clone, <Self::Item as IntoIterator>::Item: Clone,

Return an iterator adaptor that iterates over the cartesian product of -all subiterators returned by meta-iterator self. Read more
source§

fn coalesce<F>(self, f: F) -> CoalesceBy<Self, F, Self::Item>where +all subiterators returned by meta-iterator self. Read more

source§

fn coalesce<F>(self, f: F) -> CoalesceBy<Self, F, Self::Item>where Self: Sized, F: FnMut(Self::Item, Self::Item) -> Result<Self::Item, (Self::Item, Self::Item)>,

Return an iterator adaptor that uses the passed-in closure to -optionally merge together consecutive elements. Read more
source§

fn dedup(self) -> CoalesceBy<Self, DedupPred2CoalescePred<DedupEq>, Self::Item>where +optionally merge together consecutive elements. Read more

source§

fn dedup(self) -> CoalesceBy<Self, DedupPred2CoalescePred<DedupEq>, Self::Item>where Self: Sized, Self::Item: PartialEq<Self::Item>,

Remove duplicates from sections of consecutive identical elements. -If the iterator is sorted, all elements will be unique. Read more
source§

fn dedup_by<Cmp>( +If the iterator is sorted, all elements will be unique. Read more

source§

fn dedup_by<Cmp>( self, cmp: Cmp ) -> CoalesceBy<Self, DedupPred2CoalescePred<Cmp>, Self::Item>where Self: Sized, Cmp: FnMut(&Self::Item, &Self::Item) -> bool,

Remove duplicates from sections of consecutive identical elements, determining equality using a comparison function. -If the iterator is sorted, all elements will be unique. Read more
source§

fn dedup_with_count( +If the iterator is sorted, all elements will be unique. Read more

source§

fn dedup_with_count( self ) -> CoalesceBy<Self, DedupPredWithCount2CoalescePred<DedupEq>, (usize, Self::Item)>where Self: Sized,

Remove duplicates from sections of consecutive identical elements, while keeping a count of how many repeated elements were present. -If the iterator is sorted, all elements will be unique. Read more
source§

fn dedup_by_with_count<Cmp>( +If the iterator is sorted, all elements will be unique. Read more

source§

fn dedup_by_with_count<Cmp>( self, cmp: Cmp ) -> CoalesceBy<Self, DedupPredWithCount2CoalescePred<Cmp>, (usize, Self::Item)>where @@ -343,238 +347,252 @@ If the iterator is sorted, all elements will be unique. FnMut(&Self::Item, &Self::Item) -> bool,

Remove duplicates from sections of consecutive identical elements, while keeping a count of how many repeated elements were present. This will determine equality using a comparison function. -If the iterator is sorted, all elements will be unique. Read more
source§

fn duplicates(self) -> DuplicatesBy<Self, Self::Item, ById>where +If the iterator is sorted, all elements will be unique. Read more

source§

fn duplicates(self) -> DuplicatesBy<Self, Self::Item, ById>where Self: Sized, Self::Item: Eq + Hash,

Return an iterator adaptor that produces elements that appear more than once during the -iteration. Duplicates are detected using hash and equality. Read more
source§

fn duplicates_by<V, F>(self, f: F) -> DuplicatesBy<Self, V, ByFn<F>>where +iteration. Duplicates are detected using hash and equality. Read more

source§

fn duplicates_by<V, F>(self, f: F) -> DuplicatesBy<Self, V, ByFn<F>>where Self: Sized, V: Eq + Hash, F: FnMut(&Self::Item) -> V,

Return an iterator adaptor that produces elements that appear more than once during the -iteration. Duplicates are detected using hash and equality. Read more
source§

fn unique(self) -> Unique<Self>where +iteration. Duplicates are detected using hash and equality. Read more

source§

fn unique(self) -> Unique<Self>where Self: Sized, Self::Item: Clone + Eq + Hash,

Return an iterator adaptor that filters out elements that have already been produced once during the iteration. Duplicates -are detected using hash and equality. Read more
source§

fn unique_by<V, F>(self, f: F) -> UniqueBy<Self, V, F>where +are detected using hash and equality. Read more

source§

fn unique_by<V, F>(self, f: F) -> UniqueBy<Self, V, F>where Self: Sized, V: Eq + Hash, F: FnMut(&Self::Item) -> V,

Return an iterator adaptor that filters out elements that have -already been produced once during the iteration. Read more
source§

fn peeking_take_while<F>(&mut self, accept: F) -> PeekingTakeWhile<'_, Self, F>where +already been produced once during the iteration. Read more

source§

fn peeking_take_while<F>(&mut self, accept: F) -> PeekingTakeWhile<'_, Self, F>where Self: Sized + PeekingNext, F: FnMut(&Self::Item) -> bool,

Return an iterator adaptor that borrows from this iterator and -takes items while the closure accept returns true. Read more
source§

fn take_while_ref<F>(&mut self, accept: F) -> TakeWhileRef<'_, Self, F>where +takes items while the closure accept returns true. Read more

source§

fn take_while_ref<F>(&mut self, accept: F) -> TakeWhileRef<'_, Self, F>where Self: Clone, F: FnMut(&Self::Item) -> bool,

Return an iterator adaptor that borrows from a Clone-able iterator -to only pick off elements while the predicate accept returns true. Read more
source§

fn while_some<A>(self) -> WhileSome<Self>where +to only pick off elements while the predicate accept returns true. Read more

source§

fn take_while_inclusive<F>( + &mut self, + accept: F +) -> TakeWhileInclusive<'_, Self, F>where + Self: Sized, + F: FnMut(&Self::Item) -> bool,

Returns an iterator adaptor that consumes elements while the given +predicate is true, including the element for which the predicate +first returned false. Read more
source§

fn while_some<A>(self) -> WhileSome<Self>where Self: Sized + Iterator<Item = Option<A>>,

Return an iterator adaptor that filters Option<A> iterator elements -and produces A. Stops on the first None encountered. Read more
source§

fn tuple_combinations<T>(self) -> TupleCombinations<Self, T>where +and produces A. Stops on the first None encountered. Read more

source§

fn tuple_combinations<T>(self) -> TupleCombinations<Self, T>where Self: Sized + Clone, Self::Item: Clone, T: HasCombination<Self>,

Return an iterator adaptor that iterates over the combinations of the -elements from an iterator. Read more
source§

fn combinations(self, k: usize) -> Combinations<Self>where +elements from an iterator. Read more

source§

fn combinations(self, k: usize) -> Combinations<Self>where Self: Sized, Self::Item: Clone,

Return an iterator adaptor that iterates over the k-length combinations of -the elements from an iterator. Read more
source§

fn combinations_with_replacement( +the elements from an iterator. Read more

source§

fn combinations_with_replacement( self, k: usize ) -> CombinationsWithReplacement<Self>where Self: Sized, Self::Item: Clone,

Return an iterator that iterates over the k-length combinations of -the elements from an iterator, with replacement. Read more
source§

fn permutations(self, k: usize) -> Permutations<Self>where +the elements from an iterator, with replacement. Read more

source§

fn permutations(self, k: usize) -> Permutations<Self>where Self: Sized, Self::Item: Clone,

Return an iterator adaptor that iterates over all k-permutations of the -elements from an iterator. Read more
source§

fn powerset(self) -> Powerset<Self>where +elements from an iterator. Read more

source§

fn powerset(self) -> Powerset<Self>where Self: Sized, Self::Item: Clone,

Return an iterator that iterates through the powerset of the elements from an -iterator. Read more
source§

fn pad_using<F>(self, min: usize, f: F) -> PadUsing<Self, F>where +iterator. Read more

source§

fn pad_using<F>(self, min: usize, f: F) -> PadUsing<Self, F>where Self: Sized, F: FnMut(usize) -> Self::Item,

Return an iterator adaptor that pads the sequence to a minimum length of -min by filling missing elements using a closure f. Read more
source§

fn with_position(self) -> WithPosition<Self>where - Self: Sized,

Return an iterator adaptor that wraps each element in a Position to -ease special-case handling of the first or last elements. Read more
source§

fn positions<P>(self, predicate: P) -> Positions<Self, P>where +min by filling missing elements using a closure f. Read more

source§

fn with_position(self) -> WithPosition<Self>where + Self: Sized,

Return an iterator adaptor that combines each element with a Position to +ease special-case handling of the first or last elements. Read more
source§

fn positions<P>(self, predicate: P) -> Positions<Self, P>where Self: Sized, P: FnMut(Self::Item) -> bool,

Return an iterator adaptor that yields the indices of all elements -satisfying a predicate, counted from the start of the iterator. Read more
source§

fn update<F>(self, updater: F) -> Update<Self, F>where +satisfying a predicate, counted from the start of the iterator. Read more

source§

fn update<F>(self, updater: F) -> Update<Self, F>where Self: Sized, F: FnMut(&mut Self::Item),

Return an iterator adaptor that applies a mutating function -to each element before yielding it. Read more
source§

fn next_tuple<T>(&mut self) -> Option<T>where +to each element before yielding it. Read more

source§

fn next_tuple<T>(&mut self) -> Option<T>where Self: Sized + Iterator<Item = <T as TupleCollect>::Item>, T: HomogeneousTuple,

Advances the iterator and returns the next items grouped in a tuple of -a specific size (up to 12). Read more
source§

fn collect_tuple<T>(self) -> Option<T>where +a specific size (up to 12). Read more

source§

fn collect_tuple<T>(self) -> Option<T>where Self: Sized + Iterator<Item = <T as TupleCollect>::Item>, T: HomogeneousTuple,

Collects all items from the iterator into a tuple of a specific size -(up to 12). Read more
source§

fn find_position<P>(&mut self, pred: P) -> Option<(usize, Self::Item)>where - P: FnMut(&Self::Item) -> bool,

Find the position and value of the first element satisfying a predicate. Read more
source§

fn find_or_last<P>(self, predicate: P) -> Option<Self::Item>where +(up to 12). Read more

source§

fn find_position<P>(&mut self, pred: P) -> Option<(usize, Self::Item)>where + P: FnMut(&Self::Item) -> bool,

Find the position and value of the first element satisfying a predicate. Read more
source§

fn find_or_last<P>(self, predicate: P) -> Option<Self::Item>where Self: Sized, - P: FnMut(&Self::Item) -> bool,

Find the value of the first element satisfying a predicate or return the last element, if any. Read more
source§

fn find_or_first<P>(self, predicate: P) -> Option<Self::Item>where + P: FnMut(&Self::Item) -> bool,

Find the value of the first element satisfying a predicate or return the last element, if any. Read more
source§

fn find_or_first<P>(self, predicate: P) -> Option<Self::Item>where Self: Sized, - P: FnMut(&Self::Item) -> bool,

Find the value of the first element satisfying a predicate or return the first element, if any. Read more
source§

fn contains<Q>(&mut self, query: &Q) -> boolwhere + P: FnMut(&Self::Item) -> bool,

Find the value of the first element satisfying a predicate or return the first element, if any. Read more
source§

fn contains<Q>(&mut self, query: &Q) -> boolwhere Self: Sized, Self::Item: Borrow<Q>, - Q: PartialEq<Q>,

Returns true if the given item is present in this iterator. Read more
source§

fn all_equal(&mut self) -> boolwhere + Q: PartialEq<Q>,

Returns true if the given item is present in this iterator. Read more
source§

fn all_equal(&mut self) -> boolwhere Self: Sized, - Self::Item: PartialEq<Self::Item>,

Check whether all elements compare equal. Read more
source§

fn all_unique(&mut self) -> boolwhere + Self::Item: PartialEq<Self::Item>,

Check whether all elements compare equal. Read more
source§

fn all_equal_value( + &mut self +) -> Result<Self::Item, Option<(Self::Item, Self::Item)>>where Self: Sized, - Self::Item: Eq + Hash,

Check whether all elements are unique (non equal). Read more
source§

fn dropping(self, n: usize) -> Selfwhere + Self::Item: PartialEq<Self::Item>,

If there are elements and they are all equal, return a single copy of that element. +If there are no elements, return an Error containing None. +If there are elements and they are not all equal, return a tuple containing the first +two non-equal elements found. Read more
source§

fn all_unique(&mut self) -> boolwhere + Self: Sized, + Self::Item: Eq + Hash,

Check whether all elements are unique (non equal). Read more
source§

fn dropping(self, n: usize) -> Selfwhere Self: Sized,

Consume the first n elements from the iterator eagerly, -and return the same iterator again. Read more
source§

fn dropping_back(self, n: usize) -> Selfwhere +and return the same iterator again. Read more

source§

fn dropping_back(self, n: usize) -> Selfwhere Self: Sized + DoubleEndedIterator,

Consume the last n elements from the iterator eagerly, -and return the same iterator again. Read more
source§

fn foreach<F>(self, f: F)where +and return the same iterator again. Read more

source§

fn foreach<F>(self, f: F)where F: FnMut(Self::Item), - Self: Sized,

👎Deprecated since 0.8.0: Use .for_each() instead
Run the closure f eagerly on each element of the iterator. Read more
source§

fn concat(self) -> Self::Itemwhere + Self: Sized,

👎Deprecated since 0.8.0: Use .for_each() instead
Run the closure f eagerly on each element of the iterator. Read more
source§

fn concat(self) -> Self::Itemwhere Self: Sized, - Self::Item: Extend<<Self::Item as IntoIterator>::Item> + IntoIterator + Default,

Combine all an iterator’s elements into one element by using Extend. Read more
source§

fn collect_vec(self) -> Vec<Self::Item, Global>where + Self::Item: Extend<<Self::Item as IntoIterator>::Item> + IntoIterator + Default,

Combine all an iterator’s elements into one element by using Extend. Read more
source§

fn collect_vec(self) -> Vec<Self::Item, Global>where Self: Sized,

.collect_vec() is simply a type specialization of Iterator::collect, -for convenience.
source§

fn try_collect<T, U, E>(self) -> Result<U, E>where +for convenience.

source§

fn try_collect<T, U, E>(self) -> Result<U, E>where Self: Sized + Iterator<Item = Result<T, E>>, Result<U, E>: FromIterator<Result<T, E>>,

.try_collect() is more convenient way of writing -.collect::<Result<_, _>>() Read more
source§

fn set_from<'a, A, J>(&mut self, from: J) -> usizewhere +.collect::<Result<_, _>>() Read more

source§

fn set_from<'a, A, J>(&mut self, from: J) -> usizewhere A: 'a, Self: Iterator<Item = &'a mut A>, J: IntoIterator<Item = A>,

Assign to each reference in self from the from iterator, -stopping at the shortest of the two iterators. Read more
source§

fn join(&mut self, sep: &str) -> Stringwhere - Self::Item: Display,

Combine all iterator elements into one String, separated by sep. Read more
source§

fn format(self, sep: &str) -> Format<'_, Self>where - Self: Sized,

Format all iterator elements, separated by sep. Read more
source§

fn format_with<F>(self, sep: &str, format: F) -> FormatWith<'_, Self, F>where +stopping at the shortest of the two iterators. Read more

source§

fn join(&mut self, sep: &str) -> Stringwhere + Self::Item: Display,

Combine all iterator elements into one String, separated by sep. Read more
source§

fn format(self, sep: &str) -> Format<'_, Self>where + Self: Sized,

Format all iterator elements, separated by sep. Read more
source§

fn format_with<F>(self, sep: &str, format: F) -> FormatWith<'_, Self, F>where Self: Sized, - F: FnMut(Self::Item, &mut dyn FnMut(&dyn Display) -> Result<(), Error>) -> Result<(), Error>,

Format all iterator elements, separated by sep. Read more
source§

fn fold_results<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>where + F: FnMut(Self::Item, &mut dyn FnMut(&dyn Display) -> Result<(), Error>) -> Result<(), Error>,

Format all iterator elements, separated by sep. Read more
source§

fn fold_results<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>where Self: Iterator<Item = Result<A, E>>, - F: FnMut(B, A) -> B,

👎Deprecated since 0.10.0: Use .fold_ok() instead
See .fold_ok().
source§

fn fold_ok<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>where + F: FnMut(B, A) -> B,

👎Deprecated since 0.10.0: Use .fold_ok() instead
See .fold_ok().
source§

fn fold_ok<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>where Self: Iterator<Item = Result<A, E>>, - F: FnMut(B, A) -> B,

Fold Result values from an iterator. Read more
source§

fn fold_options<A, B, F>(&mut self, start: B, f: F) -> Option<B>where + F: FnMut(B, A) -> B,

Fold Result values from an iterator. Read more
source§

fn fold_options<A, B, F>(&mut self, start: B, f: F) -> Option<B>where Self: Iterator<Item = Option<A>>, - F: FnMut(B, A) -> B,

Fold Option values from an iterator. Read more
source§

fn fold1<F>(self, f: F) -> Option<Self::Item>where + F: FnMut(B, A) -> B,

Fold Option values from an iterator. Read more
source§

fn fold1<F>(self, f: F) -> Option<Self::Item>where F: FnMut(Self::Item, Self::Item) -> Self::Item, - Self: Sized,

👎Deprecated since 0.10.2: Use Iterator::reduce instead
Accumulator of the elements in the iterator. Read more
source§

fn tree_fold1<F>(self, f: F) -> Option<Self::Item>where + Self: Sized,

👎Deprecated since 0.10.2: Use Iterator::reduce instead
Accumulator of the elements in the iterator. Read more
source§

fn tree_fold1<F>(self, f: F) -> Option<Self::Item>where F: FnMut(Self::Item, Self::Item) -> Self::Item, - Self: Sized,

Accumulate the elements in the iterator in a tree-like manner. Read more
source§

fn fold_while<B, F>(&mut self, init: B, f: F) -> FoldWhile<B>where + Self: Sized,

Accumulate the elements in the iterator in a tree-like manner. Read more
source§

fn fold_while<B, F>(&mut self, init: B, f: F) -> FoldWhile<B>where Self: Sized, - F: FnMut(B, Self::Item) -> FoldWhile<B>,

An iterator method that applies a function, producing a single, final value. Read more
source§

fn sum1<S>(self) -> Option<S>where + F: FnMut(B, Self::Item) -> FoldWhile<B>,

An iterator method that applies a function, producing a single, final value. Read more
source§

fn sum1<S>(self) -> Option<S>where Self: Sized, - S: Sum<Self::Item>,

Iterate over the entire iterator and add all the elements. Read more
source§

fn product1<P>(self) -> Option<P>where + S: Sum<Self::Item>,

Iterate over the entire iterator and add all the elements. Read more
source§

fn product1<P>(self) -> Option<P>where Self: Sized, - P: Product<Self::Item>,

Iterate over the entire iterator and multiply all the elements. Read more
source§

fn sorted_unstable(self) -> IntoIter<Self::Item, Global>where + P: Product<Self::Item>,

Iterate over the entire iterator and multiply all the elements. Read more
source§

fn sorted_unstable(self) -> IntoIter<Self::Item, Global>where Self: Sized, - Self::Item: Ord,

Sort all iterator elements into a new iterator in ascending order. Read more
source§

fn sorted_unstable_by<F>(self, cmp: F) -> IntoIter<Self::Item, Global>where + Self::Item: Ord,

Sort all iterator elements into a new iterator in ascending order. Read more
source§

fn sorted_unstable_by<F>(self, cmp: F) -> IntoIter<Self::Item, Global>where Self: Sized, - F: FnMut(&Self::Item, &Self::Item) -> Ordering,

Sort all iterator elements into a new iterator in ascending order. Read more
source§

fn sorted_unstable_by_key<K, F>(self, f: F) -> IntoIter<Self::Item, Global>where + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

Sort all iterator elements into a new iterator in ascending order. Read more
source§

fn sorted_unstable_by_key<K, F>(self, f: F) -> IntoIter<Self::Item, Global>where Self: Sized, K: Ord, - F: FnMut(&Self::Item) -> K,

Sort all iterator elements into a new iterator in ascending order. Read more
source§

fn sorted(self) -> IntoIter<Self::Item, Global>where + F: FnMut(&Self::Item) -> K,

Sort all iterator elements into a new iterator in ascending order. Read more
source§

fn sorted(self) -> IntoIter<Self::Item, Global>where Self: Sized, - Self::Item: Ord,

Sort all iterator elements into a new iterator in ascending order. Read more
source§

fn sorted_by<F>(self, cmp: F) -> IntoIter<Self::Item, Global>where + Self::Item: Ord,

Sort all iterator elements into a new iterator in ascending order. Read more
source§

fn sorted_by<F>(self, cmp: F) -> IntoIter<Self::Item, Global>where Self: Sized, - F: FnMut(&Self::Item, &Self::Item) -> Ordering,

Sort all iterator elements into a new iterator in ascending order. Read more
source§

fn sorted_by_key<K, F>(self, f: F) -> IntoIter<Self::Item, Global>where + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

Sort all iterator elements into a new iterator in ascending order. Read more
source§

fn sorted_by_key<K, F>(self, f: F) -> IntoIter<Self::Item, Global>where Self: Sized, K: Ord, - F: FnMut(&Self::Item) -> K,

Sort all iterator elements into a new iterator in ascending order. Read more
source§

fn sorted_by_cached_key<K, F>(self, f: F) -> IntoIter<Self::Item, Global>where + F: FnMut(&Self::Item) -> K,

Sort all iterator elements into a new iterator in ascending order. Read more
source§

fn sorted_by_cached_key<K, F>(self, f: F) -> IntoIter<Self::Item, Global>where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

Sort all iterator elements into a new iterator in ascending order. The key function is -called exactly once per key. Read more
source§

fn k_smallest(self, k: usize) -> IntoIter<Self::Item, Global>where +called exactly once per key. Read more

source§

fn k_smallest(self, k: usize) -> IntoIter<Self::Item, Global>where Self: Sized, - Self::Item: Ord,

Sort the k smallest elements into a new iterator, in ascending order. Read more
source§

fn partition_map<A, B, F, L, R>(self, predicate: F) -> (A, B)where + Self::Item: Ord,

Sort the k smallest elements into a new iterator, in ascending order. Read more
source§

fn partition_map<A, B, F, L, R>(self, predicate: F) -> (A, B)where Self: Sized, F: FnMut(Self::Item) -> Either<L, R>, A: Default + Extend<L>, B: Default + Extend<R>,

Collect all iterator elements into one of two partitions. Unlike Iterator::partition, each partition may -have a distinct type. Read more
source§

fn partition_result<A, B, T, E>(self) -> (A, B)where +have a distinct type. Read more

source§

fn partition_result<A, B, T, E>(self) -> (A, B)where Self: Iterator<Item = Result<T, E>> + Sized, A: Default + Extend<T>, B: Default + Extend<E>,

Partition a sequence of Results into one list of all the Ok elements -and another list of all the Err elements. Read more
source§

fn into_group_map<K, V>(self) -> HashMap<K, Vec<V, Global>, RandomState>where +and another list of all the Err elements. Read more

source§

fn into_group_map<K, V>(self) -> HashMap<K, Vec<V, Global>, RandomState>where Self: Iterator<Item = (K, V)> + Sized, K: Hash + Eq,

Return a HashMap of keys mapped to Vecs of values. Keys and values -are taken from (Key, Value) tuple pairs yielded by the input iterator. Read more
source§

fn into_group_map_by<K, V, F>( +are taken from (Key, Value) tuple pairs yielded by the input iterator. Read more

source§

fn into_group_map_by<K, V, F>( self, f: F ) -> HashMap<K, Vec<V, Global>, RandomState>where Self: Iterator<Item = V> + Sized, K: Hash + Eq, F: Fn(&V) -> K,

Return an Iterator on a HashMap. Keys mapped to Vecs of values. The key is specified -in the closure. Read more
source§

fn into_grouping_map<K, V>(self) -> GroupingMap<Self>where +in the closure. Read more

source§

fn into_grouping_map<K, V>(self) -> GroupingMap<Self>where Self: Iterator<Item = (K, V)> + Sized, - K: Hash + Eq,

Constructs a GroupingMap to be used later with one of the efficient -group-and-fold operations it allows to perform. Read more
source§

fn into_grouping_map_by<K, V, F>( + K: Hash + Eq,

Constructs a GroupingMap to be used later with one of the efficient +group-and-fold operations it allows to perform. Read more
source§

fn into_grouping_map_by<K, V, F>( self, key_mapper: F ) -> GroupingMap<MapForGrouping<Self, F>>where Self: Iterator<Item = V> + Sized, K: Hash + Eq, - F: FnMut(&V) -> K,

Constructs a GroupingMap to be used later with one of the efficient -group-and-fold operations it allows to perform. Read more
source§

fn min_set(self) -> Vec<Self::Item, Global>where + F: FnMut(&V) -> K,

Constructs a GroupingMap to be used later with one of the efficient +group-and-fold operations it allows to perform. Read more
source§

fn min_set(self) -> Vec<Self::Item, Global>where Self: Sized, - Self::Item: Ord,

Return all minimum elements of an iterator. Read more
source§

fn min_set_by<F>(self, compare: F) -> Vec<Self::Item, Global>where + Self::Item: Ord,

Return all minimum elements of an iterator. Read more
source§

fn min_set_by<F>(self, compare: F) -> Vec<Self::Item, Global>where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

Return all minimum elements of an iterator, as determined by -the specified function. Read more
source§

fn min_set_by_key<K, F>(self, key: F) -> Vec<Self::Item, Global>where +the specified function. Read more

source§

fn min_set_by_key<K, F>(self, key: F) -> Vec<Self::Item, Global>where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

Return all minimum elements of an iterator, as determined by -the specified function. Read more
source§

fn max_set(self) -> Vec<Self::Item, Global>where +the specified function. Read more

source§

fn max_set(self) -> Vec<Self::Item, Global>where Self: Sized, - Self::Item: Ord,

Return all maximum elements of an iterator. Read more
source§

fn max_set_by<F>(self, compare: F) -> Vec<Self::Item, Global>where + Self::Item: Ord,

Return all maximum elements of an iterator. Read more
source§

fn max_set_by<F>(self, compare: F) -> Vec<Self::Item, Global>where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

Return all maximum elements of an iterator, as determined by -the specified function. Read more
source§

fn max_set_by_key<K, F>(self, key: F) -> Vec<Self::Item, Global>where +the specified function. Read more

source§

fn max_set_by_key<K, F>(self, key: F) -> Vec<Self::Item, Global>where Self: Sized, K: Ord, - F: FnMut(&Self::Item) -> K,

Return all minimum elements of an iterator, as determined by -the specified function. Read more
source§

fn minmax(self) -> MinMaxResult<Self::Item>where + F: FnMut(&Self::Item) -> K,

Return all maximum elements of an iterator, as determined by +the specified function. Read more
source§

fn minmax(self) -> MinMaxResult<Self::Item>where Self: Sized, - Self::Item: PartialOrd<Self::Item>,

Return the minimum and maximum elements in the iterator. Read more
source§

fn minmax_by_key<K, F>(self, key: F) -> MinMaxResult<Self::Item>where + Self::Item: PartialOrd<Self::Item>,

Return the minimum and maximum elements in the iterator. Read more
source§

fn minmax_by_key<K, F>(self, key: F) -> MinMaxResult<Self::Item>where Self: Sized, K: PartialOrd<K>, F: FnMut(&Self::Item) -> K,

Return the minimum and maximum element of an iterator, as determined by -the specified function. Read more
source§

fn minmax_by<F>(self, compare: F) -> MinMaxResult<Self::Item>where +the specified function. Read more

source§

fn minmax_by<F>(self, compare: F) -> MinMaxResult<Self::Item>where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

Return the minimum and maximum element of an iterator, as determined by -the specified comparison function. Read more
source§

fn position_max(self) -> Option<usize>where +the specified comparison function. Read more

source§

fn position_max(self) -> Option<usize>where Self: Sized, - Self::Item: Ord,

Return the position of the maximum element in the iterator. Read more
source§

fn position_max_by_key<K, F>(self, key: F) -> Option<usize>where + Self::Item: Ord,

Return the position of the maximum element in the iterator. Read more
source§

fn position_max_by_key<K, F>(self, key: F) -> Option<usize>where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

Return the position of the maximum element in the iterator, as -determined by the specified function. Read more
source§

fn position_max_by<F>(self, compare: F) -> Option<usize>where +determined by the specified function. Read more

source§

fn position_max_by<F>(self, compare: F) -> Option<usize>where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

Return the position of the maximum element in the iterator, as -determined by the specified comparison function. Read more
source§

fn position_min(self) -> Option<usize>where +determined by the specified comparison function. Read more

source§

fn position_min(self) -> Option<usize>where Self: Sized, - Self::Item: Ord,

Return the position of the minimum element in the iterator. Read more
source§

fn position_min_by_key<K, F>(self, key: F) -> Option<usize>where + Self::Item: Ord,

Return the position of the minimum element in the iterator. Read more
source§

fn position_min_by_key<K, F>(self, key: F) -> Option<usize>where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

Return the position of the minimum element in the iterator, as -determined by the specified function. Read more
source§

fn position_min_by<F>(self, compare: F) -> Option<usize>where +determined by the specified function. Read more

source§

fn position_min_by<F>(self, compare: F) -> Option<usize>where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

Return the position of the minimum element in the iterator, as -determined by the specified comparison function. Read more
source§

fn position_minmax(self) -> MinMaxResult<usize>where +determined by the specified comparison function. Read more

source§

fn position_minmax(self) -> MinMaxResult<usize>where Self: Sized, Self::Item: PartialOrd<Self::Item>,

Return the positions of the minimum and maximum elements in -the iterator. Read more
source§

fn position_minmax_by_key<K, F>(self, key: F) -> MinMaxResult<usize>where +the iterator. Read more

source§

fn position_minmax_by_key<K, F>(self, key: F) -> MinMaxResult<usize>where Self: Sized, K: PartialOrd<K>, F: FnMut(&Self::Item) -> K,

Return the postions of the minimum and maximum elements of an -iterator, as determined by the specified function. Read more
source§

fn position_minmax_by<F>(self, compare: F) -> MinMaxResult<usize>where +iterator, as determined by the specified function. Read more

source§

fn position_minmax_by<F>(self, compare: F) -> MinMaxResult<usize>where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

Return the postions of the minimum and maximum elements of an -iterator, as determined by the specified comparison function. Read more
source§

fn exactly_one(self) -> Result<Self::Item, ExactlyOneError<Self>>where +iterator, as determined by the specified comparison function. Read more

source§

fn exactly_one(self) -> Result<Self::Item, ExactlyOneError<Self>>where Self: Sized,

If the iterator yields exactly one element, that element will be returned, otherwise an error will be returned containing an iterator that has the same output as the input -iterator. Read more
source§

fn at_most_one(self) -> Result<Option<Self::Item>, ExactlyOneError<Self>>where +iterator. Read more

source§

fn at_most_one(self) -> Result<Option<Self::Item>, ExactlyOneError<Self>>where Self: Sized,

If the iterator yields no elements, Ok(None) will be returned. If the iterator yields exactly one element, that element will be returned, otherwise an error will be returned -containing an iterator that has the same output as the input iterator. Read more
source§

fn multipeek(self) -> MultiPeek<Self>where +containing an iterator that has the same output as the input iterator. Read more

source§

fn multipeek(self) -> MultiPeek<Self>where Self: Sized,

An iterator adaptor that allows the user to peek at multiple .next() -values without advancing the base iterator. Read more
source§

fn counts(self) -> HashMap<Self::Item, usize, RandomState>where +values without advancing the base iterator. Read more

source§

fn counts(self) -> HashMap<Self::Item, usize, RandomState>where Self: Sized, Self::Item: Eq + Hash,

Collect the items in this iterator and return a HashMap which contains each item that appears in the iterator and the number -of times it appears. Read more
source§

fn counts_by<K, F>(self, f: F) -> HashMap<K, usize, RandomState>where +of times it appears. Read more

source§

fn counts_by<K, F>(self, f: F) -> HashMap<K, usize, RandomState>where Self: Sized, K: Eq + Hash, F: FnMut(Self::Item) -> K,

Collect the items in this iterator and return a HashMap which contains each item that appears in the iterator and the number of times it appears, -determining identity using a keying function. Read more
source§

fn multiunzip<FromI>(self) -> FromIwhere +determining identity using a keying function. Read more

source§

fn multiunzip<FromI>(self) -> FromIwhere Self: Sized + MultiUnzip<FromI>,

Converts an iterator of tuples into a tuple of containers. Read more
source§

impl<T> Same<T> for T

§

type Output = T

Should always be Self
source§

impl<T, U> TryFrom<U> for Twhere U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
const: unstable · source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
source§

impl<T, U> TryInto<U> for Twhere U: TryFrom<T>,

§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
const: unstable · source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
\ No newline at end of file diff --git a/dev/uucore/parse_size/enum.ParseSizeError.html b/dev/uucore/parse_size/enum.ParseSizeError.html index 0ca3c48d9..0d9e19735 100644 --- a/dev/uucore/parse_size/enum.ParseSizeError.html +++ b/dev/uucore/parse_size/enum.ParseSizeError.html @@ -2,7 +2,7 @@ InvalidSuffix(String), ParseFailure(String), SizeTooBig(String), -}

Variants§

§

InvalidSuffix(String)

§

ParseFailure(String)

§

SizeTooBig(String)

Trait Implementations§

source§

impl Debug for ParseSizeError

source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
source§

impl Display for ParseSizeError

source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>

Formats the value using the given formatter. Read more
source§

impl Error for ParseSizeError

source§

fn description(&self) -> &str

👎Deprecated since 1.42.0: use the Display impl or to_string()
Read more
1.30.0 · source§

fn source(&self) -> Option<&(dyn Error + 'static)>

The lower-level source of this error, if any. Read more
1.0.0 · source§

fn cause(&self) -> Option<&dyn Error>

👎Deprecated since 1.33.0: replaced by Error::source, which can support downcasting
source§

fn provide<'a>(&'a self, demand: &mut Demand<'a>)

🔬This is a nightly-only experimental API. (error_generic_member_access)
Provides type based access to context intended for error reports. Read more
source§

impl PartialEq<ParseSizeError> for ParseSizeError

source§

fn eq(&self, other: &ParseSizeError) -> bool

This method tests for self and other values to be equal, and is used +}

Variants§

§

InvalidSuffix(String)

§

ParseFailure(String)

§

SizeTooBig(String)

Trait Implementations§

source§

impl Debug for ParseSizeError

source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
source§

impl Display for ParseSizeError

source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>

Formats the value using the given formatter. Read more
source§

impl Error for ParseSizeError

source§

fn description(&self) -> &str

👎Deprecated since 1.42.0: use the Display impl or to_string()
Read more
1.30.0 · source§

fn source(&self) -> Option<&(dyn Error + 'static)>

The lower-level source of this error, if any. Read more
1.0.0 · source§

fn cause(&self) -> Option<&dyn Error>

👎Deprecated since 1.33.0: replaced by Error::source, which can support downcasting
source§

fn provide<'a>(&'a self, demand: &mut Demand<'a>)

🔬This is a nightly-only experimental API. (error_generic_member_access)
Provides type based access to context intended for error reports. Read more
source§

impl PartialEq<ParseSizeError> for ParseSizeError

source§

fn eq(&self, other: &ParseSizeError) -> bool

This method tests for self and other values to be equal, and is used by ==.
1.0.0 · source§

fn ne(&self, other: &Rhs) -> bool

This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.
source§

impl Eq for ParseSizeError

source§

impl StructuralEq for ParseSizeError

source§

impl StructuralPartialEq for ParseSizeError

Auto Trait Implementations§

Blanket Implementations§

source§

impl<T> Any for Twhere T: 'static + ?Sized,

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for Twhere diff --git a/dev/uucore/perms/entries/struct.Group.html b/dev/uucore/perms/entries/struct.Group.html index e9d2802fe..83a9f649a 100644 --- a/dev/uucore/perms/entries/struct.Group.html +++ b/dev/uucore/perms/entries/struct.Group.html @@ -3,7 +3,7 @@ pub gid: gid_t, }

Fields§

§name: String

AKA group.gr_name

§gid: gid_t

AKA group.gr_gid

-

Trait Implementations§

source§

impl Clone for Group

source§

fn clone(&self) -> Group

Returns a copy of the value. Read more
1.0.0 · source§

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source. Read more
source§

impl Debug for Group

source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
source§

impl<'a> Locate<&'a str> for Group

source§

fn locate(k: &'a str) -> IOResult<Self>

source§

impl Locate<u32> for Group

source§

fn locate(k: gid_t) -> IOResult<Self>

Auto Trait Implementations§

§

impl RefUnwindSafe for Group

§

impl Send for Group

§

impl Sync for Group

§

impl Unpin for Group

§

impl UnwindSafe for Group

Blanket Implementations§

source§

impl<T> Any for Twhere +

Trait Implementations§

source§

impl Clone for Group

source§

fn clone(&self) -> Group

Returns a copy of the value. Read more
1.0.0 · source§

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source. Read more
source§

impl Debug for Group

source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
source§

impl<'a> Locate<&'a str> for Group

source§

fn locate(k: &'a str) -> IOResult<Self>

source§

impl Locate<u32> for Group

source§

fn locate(k: gid_t) -> IOResult<Self>

Auto Trait Implementations§

§

impl RefUnwindSafe for Group

§

impl Send for Group

§

impl Sync for Group

§

impl Unpin for Group

§

impl UnwindSafe for Group

Blanket Implementations§

source§

impl<T> Any for Twhere T: 'static + ?Sized,

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for Twhere T: ?Sized,

const: unstable · source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for Twhere T: ?Sized,

const: unstable · source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

const: unstable · source§

fn from(t: T) -> T

Returns the argument unchanged.

diff --git a/dev/uucore/perms/entries/struct.Passwd.html b/dev/uucore/perms/entries/struct.Passwd.html index a29e06820..50002a490 100644 --- a/dev/uucore/perms/entries/struct.Passwd.html +++ b/dev/uucore/perms/entries/struct.Passwd.html @@ -27,7 +27,7 @@ call getgrouplist().

not update ngroups if ngroups is too small. Therefore, if not updated by getgrouplist, ngroups needs to be increased in a loop until getgrouplist stops returning -1.

-

Trait Implementations§

source§

impl Clone for Passwd

source§

fn clone(&self) -> Passwd

Returns a copy of the value. Read more
1.0.0 · source§

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source. Read more
source§

impl Debug for Passwd

source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
source§

impl<'a> Locate<&'a str> for Passwd

source§

fn locate(k: &'a str) -> IOResult<Self>

source§

impl Locate<u32> for Passwd

source§

fn locate(k: uid_t) -> IOResult<Self>

Auto Trait Implementations§

Blanket Implementations§

source§

impl<T> Any for Twhere +

Trait Implementations§

source§

impl Clone for Passwd

source§

fn clone(&self) -> Passwd

Returns a copy of the value. Read more
1.0.0 · source§

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source. Read more
source§

impl Debug for Passwd

source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
source§

impl<'a> Locate<&'a str> for Passwd

source§

fn locate(k: &'a str) -> IOResult<Self>

source§

impl Locate<u32> for Passwd

source§

fn locate(k: uid_t) -> IOResult<Self>

Auto Trait Implementations§

Blanket Implementations§

source§

impl<T> Any for Twhere T: 'static + ?Sized,

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for Twhere T: ?Sized,

const: unstable · source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for Twhere T: ?Sized,

const: unstable · source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

const: unstable · source§

fn from(t: T) -> T

Returns the argument unchanged.

diff --git a/dev/uucore/utmpx/struct.UtmpxIter.html b/dev/uucore/utmpx/struct.UtmpxIter.html index ed4411cc4..beb5484ba 100644 --- a/dev/uucore/utmpx/struct.UtmpxIter.html +++ b/dev/uucore/utmpx/struct.UtmpxIter.html @@ -181,86 +181,89 @@ function. From<T> for U chooses to do.

source§

impl<I> IntoIterator for Iwhere - I: Iterator,

§

type Item = <I as Iterator>::Item

The type of the elements being iterated over.
§

type IntoIter = I

Which kind of iterator are we turning this into?
const: unstable · source§

fn into_iter(self) -> I

Creates an iterator from a value. Read more
source§

impl<T> Itertools for Twhere - T: Iterator + ?Sized,

source§

fn interleave<J>( + I: Iterator,

§

type Item = <I as Iterator>::Item

The type of the elements being iterated over.
§

type IntoIter = I

Which kind of iterator are we turning this into?
const: unstable · source§

fn into_iter(self) -> I

Creates an iterator from a value. Read more
source§

impl<T> Itertools for Twhere + T: Iterator + ?Sized,

source§

fn interleave<J>( self, other: J ) -> Interleave<Self, <J as IntoIterator>::IntoIter>where J: IntoIterator<Item = Self::Item>, - Self: Sized,

Alternate elements from two iterators until both have run out. Read more
source§

fn interleave_shortest<J>( + Self: Sized,

Alternate elements from two iterators until both have run out. Read more
source§

fn interleave_shortest<J>( self, other: J ) -> InterleaveShortest<Self, <J as IntoIterator>::IntoIter>where J: IntoIterator<Item = Self::Item>, Self: Sized,

Alternate elements from two iterators until at least one of them has run -out. Read more
source§

fn intersperse( +out. Read more

source§

fn intersperse( self, element: Self::Item ) -> IntersperseWith<Self, IntersperseElementSimple<Self::Item>>where Self: Sized, Self::Item: Clone,

An iterator adaptor to insert a particular value -between each element of the adapted iterator. Read more
source§

fn intersperse_with<F>(self, element: F) -> IntersperseWith<Self, F>where +between each element of the adapted iterator. Read more

source§

fn intersperse_with<F>(self, element: F) -> IntersperseWith<Self, F>where Self: Sized, F: FnMut() -> Self::Item,

An iterator adaptor to insert a particular value created by a function -between each element of the adapted iterator. Read more
source§

fn zip_longest<J>( +between each element of the adapted iterator. Read more

source§

fn zip_longest<J>( self, other: J ) -> ZipLongest<Self, <J as IntoIterator>::IntoIter>where J: IntoIterator, Self: Sized,

Create an iterator which iterates over both this and the specified -iterator simultaneously, yielding pairs of two optional elements. Read more
source§

fn zip_eq<J>(self, other: J) -> ZipEq<Self, <J as IntoIterator>::IntoIter>where +iterator simultaneously, yielding pairs of two optional elements. Read more

source§

fn zip_eq<J>(self, other: J) -> ZipEq<Self, <J as IntoIterator>::IntoIter>where J: IntoIterator, Self: Sized,

Create an iterator which iterates over both this and the specified -iterator simultaneously, yielding pairs of elements. Read more
source§

fn batching<B, F>(self, f: F) -> Batching<Self, F>where +iterator simultaneously, yielding pairs of elements. Read more

source§

fn batching<B, F>(self, f: F) -> Batching<Self, F>where F: FnMut(&mut Self) -> Option<B>, Self: Sized,

A “meta iterator adaptor”. Its closure receives a reference to the iterator and may pick off as many elements as it likes, to produce the -next iterator element. Read more
source§

fn group_by<K, F>(self, key: F) -> GroupBy<K, Self, F>where +next iterator element. Read more

source§

fn group_by<K, F>(self, key: F) -> GroupBy<K, Self, F>where Self: Sized, F: FnMut(&Self::Item) -> K, K: PartialEq<K>,

Return an iterable that can group iterator elements. Consecutive elements that map to the same key (“runs”), are assigned -to the same group. Read more
source§

fn chunks(self, size: usize) -> IntoChunks<Self>where - Self: Sized,

Return an iterable that can chunk the iterator. Read more
source§

fn tuple_windows<T>(self) -> TupleWindows<Self, T>where +to the same group. Read more

source§

fn chunks(self, size: usize) -> IntoChunks<Self>where + Self: Sized,

Return an iterable that can chunk the iterator. Read more
source§

fn tuple_windows<T>(self) -> TupleWindows<Self, T>where Self: Sized + Iterator<Item = <T as TupleCollect>::Item>, T: HomogeneousTuple, <T as TupleCollect>::Item: Clone,

Return an iterator over all contiguous windows producing tuples of -a specific size (up to 12). Read more
source§

fn circular_tuple_windows<T>(self) -> CircularTupleWindows<Self, T>where +a specific size (up to 12). Read more

source§

fn circular_tuple_windows<T>(self) -> CircularTupleWindows<Self, T>where Self: Sized + Clone + Iterator<Item = <T as TupleCollect>::Item> + ExactSizeIterator, T: TupleCollect + Clone, <T as TupleCollect>::Item: Clone,

Return an iterator over all windows, wrapping back to the first elements when the window would otherwise exceed the length of the -iterator, producing tuples of a specific size (up to 12). Read more
source§

fn tuples<T>(self) -> Tuples<Self, T>where +iterator, producing tuples of a specific size (up to 12). Read more

source§

fn tuples<T>(self) -> Tuples<Self, T>where Self: Sized + Iterator<Item = <T as TupleCollect>::Item>, T: HomogeneousTuple,

Return an iterator that groups the items in tuples of a specific size -(up to 12). Read more
source§

fn tee(self) -> (Tee<Self>, Tee<Self>)where +(up to 12). Read more

source§

fn tee(self) -> (Tee<Self>, Tee<Self>)where Self: Sized, Self::Item: Clone,

Split into an iterator pair that both yield all elements from -the original iterator. Read more
source§

fn step(self, n: usize) -> Step<Self>where +the original iterator. Read more

source§

fn step(self, n: usize) -> Step<Self>where Self: Sized,

👎Deprecated since 0.8.0: Use std .step_by() instead
Return an iterator adaptor that steps n elements in the base iterator -for each iteration. Read more
source§

fn map_into<R>(self) -> MapSpecialCase<Self, MapSpecialCaseFnInto<R>>where +for each iteration. Read more

source§

fn map_into<R>(self) -> MapSpecialCase<Self, MapSpecialCaseFnInto<R>>where Self: Sized, - Self::Item: Into<R>,

Convert each item of the iterator using the Into trait. Read more
source§

fn map_results<F, T, U, E>( + Self::Item: Into<R>,

Convert each item of the iterator using the Into trait. Read more
source§

fn map_results<F, T, U, E>( self, f: F ) -> MapSpecialCase<Self, MapSpecialCaseFnOk<F>>where Self: Iterator<Item = Result<T, E>> + Sized, - F: FnMut(T) -> U,

👎Deprecated since 0.10.0: Use .map_ok() instead
See .map_ok().
source§

fn map_ok<F, T, U, E>(self, f: F) -> MapSpecialCase<Self, MapSpecialCaseFnOk<F>>where + F: FnMut(T) -> U,

👎Deprecated since 0.10.0: Use .map_ok() instead
See .map_ok().
source§

fn map_ok<F, T, U, E>(self, f: F) -> MapSpecialCase<Self, MapSpecialCaseFnOk<F>>where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(T) -> U,

Return an iterator adaptor that applies the provided closure to every Result::Ok value. Result::Err values are -unchanged. Read more
source§

fn filter_ok<F, T, E>(self, f: F) -> FilterOk<Self, F>where +unchanged. Read more

source§

fn filter_ok<F, T, E>(self, f: F) -> FilterOk<Self, F>where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(&T) -> bool,

Return an iterator adaptor that filters every Result::Ok value with the provided closure. Result::Err values are -unchanged. Read more
source§

fn filter_map_ok<F, T, U, E>(self, f: F) -> FilterMapOk<Self, F>where +unchanged. Read more

source§

fn filter_map_ok<F, T, U, E>(self, f: F) -> FilterMapOk<Self, F>where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(T) -> Option<U>,

Return an iterator adaptor that filters and transforms every Result::Ok value with the provided closure. Result::Err -values are unchanged. Read more
source§

fn flatten_ok<T, E>(self) -> FlattenOk<Self, T, E>where +values are unchanged. Read more

source§

fn flatten_ok<T, E>(self) -> FlattenOk<Self, T, E>where Self: Iterator<Item = Result<T, E>> + Sized, T: IntoIterator,

Return an iterator adaptor that flattens every Result::Ok value into -a series of Result::Ok values. Result::Err values are unchanged. Read more
source§

fn merge<J>( +a series of Result::Ok values. Result::Err values are unchanged. Read more

source§

fn process_results<F, T, E, R>(self, processor: F) -> Result<R, E>where + Self: Iterator<Item = Result<T, E>> + Sized, + F: FnOnce(ProcessResults<'_, Self, E>) -> R,

“Lift” a function of the values of the current iterator so as to process +an iterator of Result values instead. Read more
source§

fn merge<J>( self, other: J ) -> MergeBy<Self, <J as IntoIterator>::IntoIter, MergeLte>where @@ -268,7 +271,7 @@ a series of Result::Ok values. Result::Err values are Self::Item: PartialOrd<Self::Item>, J: IntoIterator<Item = Self::Item>,

Return an iterator adaptor that merges the two base iterators in ascending order. If both base iterators are sorted (ascending), the -result is sorted. Read more
source§

fn merge_by<J, F>( +result is sorted. Read more

source§

fn merge_by<J, F>( self, other: J, is_first: F @@ -276,26 +279,27 @@ result is sorted. Sized, J: IntoIterator<Item = Self::Item>, F: FnMut(&Self::Item, &Self::Item) -> bool,

Return an iterator adaptor that merges the two base iterators in order. -This is much like .merge() but allows for a custom ordering. Read more
source§

fn merge_join_by<J, F>( +This is much like .merge() but allows for a custom ordering. Read more

source§

fn merge_join_by<J, F, T>( self, other: J, cmp_fn: F ) -> MergeJoinBy<Self, <J as IntoIterator>::IntoIter, F>where J: IntoIterator, - F: FnMut(&Self::Item, &<J as IntoIterator>::Item) -> Ordering, + F: FnMut(&Self::Item, &<J as IntoIterator>::Item) -> T, + T: OrderingOrBool<Self::Item, <J as IntoIterator>::Item>, Self: Sized,

Create an iterator that merges items from both this and the specified -iterator in ascending order. Read more
source§

fn kmerge(self) -> KMergeBy<<Self::Item as IntoIterator>::IntoIter, KMergeByLt>where +iterator in ascending order. Read more

source§

fn kmerge(self) -> KMergeBy<<Self::Item as IntoIterator>::IntoIter, KMergeByLt>where Self: Sized, Self::Item: IntoIterator, <Self::Item as IntoIterator>::Item: PartialOrd<<Self::Item as IntoIterator>::Item>,

Return an iterator adaptor that flattens an iterator of iterators by -merging them in ascending order. Read more
source§

fn kmerge_by<F>( +merging them in ascending order. Read more

source§

fn kmerge_by<F>( self, first: F ) -> KMergeBy<<Self::Item as IntoIterator>::IntoIter, F>where Self: Sized, Self::Item: IntoIterator, F: FnMut(&<Self::Item as IntoIterator>::Item, &<Self::Item as IntoIterator>::Item) -> bool,

Return an iterator adaptor that flattens an iterator of iterators by -merging them according to the given closure. Read more
source§

fn cartesian_product<J>( +merging them according to the given closure. Read more

source§

fn cartesian_product<J>( self, other: J ) -> Product<Self, <J as IntoIterator>::IntoIter>where @@ -303,32 +307,32 @@ merging them according to the given closure. Item: Clone, J: IntoIterator, <J as IntoIterator>::IntoIter: Clone,

Return an iterator adaptor that iterates over the cartesian product of -the element sets of two iterators self and J. Read more
source§

fn multi_cartesian_product( +the element sets of two iterators self and J. Read more

source§

fn multi_cartesian_product( self ) -> MultiProduct<<Self::Item as IntoIterator>::IntoIter>where Self: Sized, Self::Item: IntoIterator, <Self::Item as IntoIterator>::IntoIter: Clone, <Self::Item as IntoIterator>::Item: Clone,

Return an iterator adaptor that iterates over the cartesian product of -all subiterators returned by meta-iterator self. Read more
source§

fn coalesce<F>(self, f: F) -> CoalesceBy<Self, F, Self::Item>where +all subiterators returned by meta-iterator self. Read more

source§

fn coalesce<F>(self, f: F) -> CoalesceBy<Self, F, Self::Item>where Self: Sized, F: FnMut(Self::Item, Self::Item) -> Result<Self::Item, (Self::Item, Self::Item)>,

Return an iterator adaptor that uses the passed-in closure to -optionally merge together consecutive elements. Read more
source§

fn dedup(self) -> CoalesceBy<Self, DedupPred2CoalescePred<DedupEq>, Self::Item>where +optionally merge together consecutive elements. Read more

source§

fn dedup(self) -> CoalesceBy<Self, DedupPred2CoalescePred<DedupEq>, Self::Item>where Self: Sized, Self::Item: PartialEq<Self::Item>,

Remove duplicates from sections of consecutive identical elements. -If the iterator is sorted, all elements will be unique. Read more
source§

fn dedup_by<Cmp>( +If the iterator is sorted, all elements will be unique. Read more

source§

fn dedup_by<Cmp>( self, cmp: Cmp ) -> CoalesceBy<Self, DedupPred2CoalescePred<Cmp>, Self::Item>where Self: Sized, Cmp: FnMut(&Self::Item, &Self::Item) -> bool,

Remove duplicates from sections of consecutive identical elements, determining equality using a comparison function. -If the iterator is sorted, all elements will be unique. Read more
source§

fn dedup_with_count( +If the iterator is sorted, all elements will be unique. Read more

source§

fn dedup_with_count( self ) -> CoalesceBy<Self, DedupPredWithCount2CoalescePred<DedupEq>, (usize, Self::Item)>where Self: Sized,

Remove duplicates from sections of consecutive identical elements, while keeping a count of how many repeated elements were present. -If the iterator is sorted, all elements will be unique. Read more
source§

fn dedup_by_with_count<Cmp>( +If the iterator is sorted, all elements will be unique. Read more

source§

fn dedup_by_with_count<Cmp>( self, cmp: Cmp ) -> CoalesceBy<Self, DedupPredWithCount2CoalescePred<Cmp>, (usize, Self::Item)>where @@ -336,238 +340,252 @@ If the iterator is sorted, all elements will be unique. FnMut(&Self::Item, &Self::Item) -> bool,

Remove duplicates from sections of consecutive identical elements, while keeping a count of how many repeated elements were present. This will determine equality using a comparison function. -If the iterator is sorted, all elements will be unique. Read more
source§

fn duplicates(self) -> DuplicatesBy<Self, Self::Item, ById>where +If the iterator is sorted, all elements will be unique. Read more

source§

fn duplicates(self) -> DuplicatesBy<Self, Self::Item, ById>where Self: Sized, Self::Item: Eq + Hash,

Return an iterator adaptor that produces elements that appear more than once during the -iteration. Duplicates are detected using hash and equality. Read more
source§

fn duplicates_by<V, F>(self, f: F) -> DuplicatesBy<Self, V, ByFn<F>>where +iteration. Duplicates are detected using hash and equality. Read more

source§

fn duplicates_by<V, F>(self, f: F) -> DuplicatesBy<Self, V, ByFn<F>>where Self: Sized, V: Eq + Hash, F: FnMut(&Self::Item) -> V,

Return an iterator adaptor that produces elements that appear more than once during the -iteration. Duplicates are detected using hash and equality. Read more
source§

fn unique(self) -> Unique<Self>where +iteration. Duplicates are detected using hash and equality. Read more

source§

fn unique(self) -> Unique<Self>where Self: Sized, Self::Item: Clone + Eq + Hash,

Return an iterator adaptor that filters out elements that have already been produced once during the iteration. Duplicates -are detected using hash and equality. Read more
source§

fn unique_by<V, F>(self, f: F) -> UniqueBy<Self, V, F>where +are detected using hash and equality. Read more

source§

fn unique_by<V, F>(self, f: F) -> UniqueBy<Self, V, F>where Self: Sized, V: Eq + Hash, F: FnMut(&Self::Item) -> V,

Return an iterator adaptor that filters out elements that have -already been produced once during the iteration. Read more
source§

fn peeking_take_while<F>(&mut self, accept: F) -> PeekingTakeWhile<'_, Self, F>where +already been produced once during the iteration. Read more

source§

fn peeking_take_while<F>(&mut self, accept: F) -> PeekingTakeWhile<'_, Self, F>where Self: Sized + PeekingNext, F: FnMut(&Self::Item) -> bool,

Return an iterator adaptor that borrows from this iterator and -takes items while the closure accept returns true. Read more
source§

fn take_while_ref<F>(&mut self, accept: F) -> TakeWhileRef<'_, Self, F>where +takes items while the closure accept returns true. Read more

source§

fn take_while_ref<F>(&mut self, accept: F) -> TakeWhileRef<'_, Self, F>where Self: Clone, F: FnMut(&Self::Item) -> bool,

Return an iterator adaptor that borrows from a Clone-able iterator -to only pick off elements while the predicate accept returns true. Read more
source§

fn while_some<A>(self) -> WhileSome<Self>where +to only pick off elements while the predicate accept returns true. Read more

source§

fn take_while_inclusive<F>( + &mut self, + accept: F +) -> TakeWhileInclusive<'_, Self, F>where + Self: Sized, + F: FnMut(&Self::Item) -> bool,

Returns an iterator adaptor that consumes elements while the given +predicate is true, including the element for which the predicate +first returned false. Read more
source§

fn while_some<A>(self) -> WhileSome<Self>where Self: Sized + Iterator<Item = Option<A>>,

Return an iterator adaptor that filters Option<A> iterator elements -and produces A. Stops on the first None encountered. Read more
source§

fn tuple_combinations<T>(self) -> TupleCombinations<Self, T>where +and produces A. Stops on the first None encountered. Read more

source§

fn tuple_combinations<T>(self) -> TupleCombinations<Self, T>where Self: Sized + Clone, Self::Item: Clone, T: HasCombination<Self>,

Return an iterator adaptor that iterates over the combinations of the -elements from an iterator. Read more
source§

fn combinations(self, k: usize) -> Combinations<Self>where +elements from an iterator. Read more

source§

fn combinations(self, k: usize) -> Combinations<Self>where Self: Sized, Self::Item: Clone,

Return an iterator adaptor that iterates over the k-length combinations of -the elements from an iterator. Read more
source§

fn combinations_with_replacement( +the elements from an iterator. Read more

source§

fn combinations_with_replacement( self, k: usize ) -> CombinationsWithReplacement<Self>where Self: Sized, Self::Item: Clone,

Return an iterator that iterates over the k-length combinations of -the elements from an iterator, with replacement. Read more
source§

fn permutations(self, k: usize) -> Permutations<Self>where +the elements from an iterator, with replacement. Read more

source§

fn permutations(self, k: usize) -> Permutations<Self>where Self: Sized, Self::Item: Clone,

Return an iterator adaptor that iterates over all k-permutations of the -elements from an iterator. Read more
source§

fn powerset(self) -> Powerset<Self>where +elements from an iterator. Read more

source§

fn powerset(self) -> Powerset<Self>where Self: Sized, Self::Item: Clone,

Return an iterator that iterates through the powerset of the elements from an -iterator. Read more
source§

fn pad_using<F>(self, min: usize, f: F) -> PadUsing<Self, F>where +iterator. Read more

source§

fn pad_using<F>(self, min: usize, f: F) -> PadUsing<Self, F>where Self: Sized, F: FnMut(usize) -> Self::Item,

Return an iterator adaptor that pads the sequence to a minimum length of -min by filling missing elements using a closure f. Read more
source§

fn with_position(self) -> WithPosition<Self>where - Self: Sized,

Return an iterator adaptor that wraps each element in a Position to -ease special-case handling of the first or last elements. Read more
source§

fn positions<P>(self, predicate: P) -> Positions<Self, P>where +min by filling missing elements using a closure f. Read more

source§

fn with_position(self) -> WithPosition<Self>where + Self: Sized,

Return an iterator adaptor that combines each element with a Position to +ease special-case handling of the first or last elements. Read more
source§

fn positions<P>(self, predicate: P) -> Positions<Self, P>where Self: Sized, P: FnMut(Self::Item) -> bool,

Return an iterator adaptor that yields the indices of all elements -satisfying a predicate, counted from the start of the iterator. Read more
source§

fn update<F>(self, updater: F) -> Update<Self, F>where +satisfying a predicate, counted from the start of the iterator. Read more

source§

fn update<F>(self, updater: F) -> Update<Self, F>where Self: Sized, F: FnMut(&mut Self::Item),

Return an iterator adaptor that applies a mutating function -to each element before yielding it. Read more
source§

fn next_tuple<T>(&mut self) -> Option<T>where +to each element before yielding it. Read more

source§

fn next_tuple<T>(&mut self) -> Option<T>where Self: Sized + Iterator<Item = <T as TupleCollect>::Item>, T: HomogeneousTuple,

Advances the iterator and returns the next items grouped in a tuple of -a specific size (up to 12). Read more
source§

fn collect_tuple<T>(self) -> Option<T>where +a specific size (up to 12). Read more

source§

fn collect_tuple<T>(self) -> Option<T>where Self: Sized + Iterator<Item = <T as TupleCollect>::Item>, T: HomogeneousTuple,

Collects all items from the iterator into a tuple of a specific size -(up to 12). Read more
source§

fn find_position<P>(&mut self, pred: P) -> Option<(usize, Self::Item)>where - P: FnMut(&Self::Item) -> bool,

Find the position and value of the first element satisfying a predicate. Read more
source§

fn find_or_last<P>(self, predicate: P) -> Option<Self::Item>where +(up to 12). Read more

source§

fn find_position<P>(&mut self, pred: P) -> Option<(usize, Self::Item)>where + P: FnMut(&Self::Item) -> bool,

Find the position and value of the first element satisfying a predicate. Read more
source§

fn find_or_last<P>(self, predicate: P) -> Option<Self::Item>where Self: Sized, - P: FnMut(&Self::Item) -> bool,

Find the value of the first element satisfying a predicate or return the last element, if any. Read more
source§

fn find_or_first<P>(self, predicate: P) -> Option<Self::Item>where + P: FnMut(&Self::Item) -> bool,

Find the value of the first element satisfying a predicate or return the last element, if any. Read more
source§

fn find_or_first<P>(self, predicate: P) -> Option<Self::Item>where Self: Sized, - P: FnMut(&Self::Item) -> bool,

Find the value of the first element satisfying a predicate or return the first element, if any. Read more
source§

fn contains<Q>(&mut self, query: &Q) -> boolwhere + P: FnMut(&Self::Item) -> bool,

Find the value of the first element satisfying a predicate or return the first element, if any. Read more
source§

fn contains<Q>(&mut self, query: &Q) -> boolwhere Self: Sized, Self::Item: Borrow<Q>, - Q: PartialEq<Q>,

Returns true if the given item is present in this iterator. Read more
source§

fn all_equal(&mut self) -> boolwhere + Q: PartialEq<Q>,

Returns true if the given item is present in this iterator. Read more
source§

fn all_equal(&mut self) -> boolwhere Self: Sized, - Self::Item: PartialEq<Self::Item>,

Check whether all elements compare equal. Read more
source§

fn all_unique(&mut self) -> boolwhere + Self::Item: PartialEq<Self::Item>,

Check whether all elements compare equal. Read more
source§

fn all_equal_value( + &mut self +) -> Result<Self::Item, Option<(Self::Item, Self::Item)>>where Self: Sized, - Self::Item: Eq + Hash,

Check whether all elements are unique (non equal). Read more
source§

fn dropping(self, n: usize) -> Selfwhere + Self::Item: PartialEq<Self::Item>,

If there are elements and they are all equal, return a single copy of that element. +If there are no elements, return an Error containing None. +If there are elements and they are not all equal, return a tuple containing the first +two non-equal elements found. Read more
source§

fn all_unique(&mut self) -> boolwhere + Self: Sized, + Self::Item: Eq + Hash,

Check whether all elements are unique (non equal). Read more
source§

fn dropping(self, n: usize) -> Selfwhere Self: Sized,

Consume the first n elements from the iterator eagerly, -and return the same iterator again. Read more
source§

fn dropping_back(self, n: usize) -> Selfwhere +and return the same iterator again. Read more

source§

fn dropping_back(self, n: usize) -> Selfwhere Self: Sized + DoubleEndedIterator,

Consume the last n elements from the iterator eagerly, -and return the same iterator again. Read more
source§

fn foreach<F>(self, f: F)where +and return the same iterator again. Read more

source§

fn foreach<F>(self, f: F)where F: FnMut(Self::Item), - Self: Sized,

👎Deprecated since 0.8.0: Use .for_each() instead
Run the closure f eagerly on each element of the iterator. Read more
source§

fn concat(self) -> Self::Itemwhere + Self: Sized,

👎Deprecated since 0.8.0: Use .for_each() instead
Run the closure f eagerly on each element of the iterator. Read more
source§

fn concat(self) -> Self::Itemwhere Self: Sized, - Self::Item: Extend<<Self::Item as IntoIterator>::Item> + IntoIterator + Default,

Combine all an iterator’s elements into one element by using Extend. Read more
source§

fn collect_vec(self) -> Vec<Self::Item, Global>where + Self::Item: Extend<<Self::Item as IntoIterator>::Item> + IntoIterator + Default,

Combine all an iterator’s elements into one element by using Extend. Read more
source§

fn collect_vec(self) -> Vec<Self::Item, Global>where Self: Sized,

.collect_vec() is simply a type specialization of Iterator::collect, -for convenience.
source§

fn try_collect<T, U, E>(self) -> Result<U, E>where +for convenience.

source§

fn try_collect<T, U, E>(self) -> Result<U, E>where Self: Sized + Iterator<Item = Result<T, E>>, Result<U, E>: FromIterator<Result<T, E>>,

.try_collect() is more convenient way of writing -.collect::<Result<_, _>>() Read more
source§

fn set_from<'a, A, J>(&mut self, from: J) -> usizewhere +.collect::<Result<_, _>>() Read more

source§

fn set_from<'a, A, J>(&mut self, from: J) -> usizewhere A: 'a, Self: Iterator<Item = &'a mut A>, J: IntoIterator<Item = A>,

Assign to each reference in self from the from iterator, -stopping at the shortest of the two iterators. Read more
source§

fn join(&mut self, sep: &str) -> Stringwhere - Self::Item: Display,

Combine all iterator elements into one String, separated by sep. Read more
source§

fn format(self, sep: &str) -> Format<'_, Self>where - Self: Sized,

Format all iterator elements, separated by sep. Read more
source§

fn format_with<F>(self, sep: &str, format: F) -> FormatWith<'_, Self, F>where +stopping at the shortest of the two iterators. Read more

source§

fn join(&mut self, sep: &str) -> Stringwhere + Self::Item: Display,

Combine all iterator elements into one String, separated by sep. Read more
source§

fn format(self, sep: &str) -> Format<'_, Self>where + Self: Sized,

Format all iterator elements, separated by sep. Read more
source§

fn format_with<F>(self, sep: &str, format: F) -> FormatWith<'_, Self, F>where Self: Sized, - F: FnMut(Self::Item, &mut dyn FnMut(&dyn Display) -> Result<(), Error>) -> Result<(), Error>,

Format all iterator elements, separated by sep. Read more
source§

fn fold_results<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>where + F: FnMut(Self::Item, &mut dyn FnMut(&dyn Display) -> Result<(), Error>) -> Result<(), Error>,

Format all iterator elements, separated by sep. Read more
source§

fn fold_results<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>where Self: Iterator<Item = Result<A, E>>, - F: FnMut(B, A) -> B,

👎Deprecated since 0.10.0: Use .fold_ok() instead
See .fold_ok().
source§

fn fold_ok<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>where + F: FnMut(B, A) -> B,

👎Deprecated since 0.10.0: Use .fold_ok() instead
See .fold_ok().
source§

fn fold_ok<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>where Self: Iterator<Item = Result<A, E>>, - F: FnMut(B, A) -> B,

Fold Result values from an iterator. Read more
source§

fn fold_options<A, B, F>(&mut self, start: B, f: F) -> Option<B>where + F: FnMut(B, A) -> B,

Fold Result values from an iterator. Read more
source§

fn fold_options<A, B, F>(&mut self, start: B, f: F) -> Option<B>where Self: Iterator<Item = Option<A>>, - F: FnMut(B, A) -> B,

Fold Option values from an iterator. Read more
source§

fn fold1<F>(self, f: F) -> Option<Self::Item>where + F: FnMut(B, A) -> B,

Fold Option values from an iterator. Read more
source§

fn fold1<F>(self, f: F) -> Option<Self::Item>where F: FnMut(Self::Item, Self::Item) -> Self::Item, - Self: Sized,

👎Deprecated since 0.10.2: Use Iterator::reduce instead
Accumulator of the elements in the iterator. Read more
source§

fn tree_fold1<F>(self, f: F) -> Option<Self::Item>where + Self: Sized,

👎Deprecated since 0.10.2: Use Iterator::reduce instead
Accumulator of the elements in the iterator. Read more
source§

fn tree_fold1<F>(self, f: F) -> Option<Self::Item>where F: FnMut(Self::Item, Self::Item) -> Self::Item, - Self: Sized,

Accumulate the elements in the iterator in a tree-like manner. Read more
source§

fn fold_while<B, F>(&mut self, init: B, f: F) -> FoldWhile<B>where + Self: Sized,

Accumulate the elements in the iterator in a tree-like manner. Read more
source§

fn fold_while<B, F>(&mut self, init: B, f: F) -> FoldWhile<B>where Self: Sized, - F: FnMut(B, Self::Item) -> FoldWhile<B>,

An iterator method that applies a function, producing a single, final value. Read more
source§

fn sum1<S>(self) -> Option<S>where + F: FnMut(B, Self::Item) -> FoldWhile<B>,

An iterator method that applies a function, producing a single, final value. Read more
source§

fn sum1<S>(self) -> Option<S>where Self: Sized, - S: Sum<Self::Item>,

Iterate over the entire iterator and add all the elements. Read more
source§

fn product1<P>(self) -> Option<P>where + S: Sum<Self::Item>,

Iterate over the entire iterator and add all the elements. Read more
source§

fn product1<P>(self) -> Option<P>where Self: Sized, - P: Product<Self::Item>,

Iterate over the entire iterator and multiply all the elements. Read more
source§

fn sorted_unstable(self) -> IntoIter<Self::Item, Global>where + P: Product<Self::Item>,

Iterate over the entire iterator and multiply all the elements. Read more
source§

fn sorted_unstable(self) -> IntoIter<Self::Item, Global>where Self: Sized, - Self::Item: Ord,

Sort all iterator elements into a new iterator in ascending order. Read more
source§

fn sorted_unstable_by<F>(self, cmp: F) -> IntoIter<Self::Item, Global>where + Self::Item: Ord,

Sort all iterator elements into a new iterator in ascending order. Read more
source§

fn sorted_unstable_by<F>(self, cmp: F) -> IntoIter<Self::Item, Global>where Self: Sized, - F: FnMut(&Self::Item, &Self::Item) -> Ordering,

Sort all iterator elements into a new iterator in ascending order. Read more
source§

fn sorted_unstable_by_key<K, F>(self, f: F) -> IntoIter<Self::Item, Global>where + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

Sort all iterator elements into a new iterator in ascending order. Read more
source§

fn sorted_unstable_by_key<K, F>(self, f: F) -> IntoIter<Self::Item, Global>where Self: Sized, K: Ord, - F: FnMut(&Self::Item) -> K,

Sort all iterator elements into a new iterator in ascending order. Read more
source§

fn sorted(self) -> IntoIter<Self::Item, Global>where + F: FnMut(&Self::Item) -> K,

Sort all iterator elements into a new iterator in ascending order. Read more
source§

fn sorted(self) -> IntoIter<Self::Item, Global>where Self: Sized, - Self::Item: Ord,

Sort all iterator elements into a new iterator in ascending order. Read more
source§

fn sorted_by<F>(self, cmp: F) -> IntoIter<Self::Item, Global>where + Self::Item: Ord,

Sort all iterator elements into a new iterator in ascending order. Read more
source§

fn sorted_by<F>(self, cmp: F) -> IntoIter<Self::Item, Global>where Self: Sized, - F: FnMut(&Self::Item, &Self::Item) -> Ordering,

Sort all iterator elements into a new iterator in ascending order. Read more
source§

fn sorted_by_key<K, F>(self, f: F) -> IntoIter<Self::Item, Global>where + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

Sort all iterator elements into a new iterator in ascending order. Read more
source§

fn sorted_by_key<K, F>(self, f: F) -> IntoIter<Self::Item, Global>where Self: Sized, K: Ord, - F: FnMut(&Self::Item) -> K,

Sort all iterator elements into a new iterator in ascending order. Read more
source§

fn sorted_by_cached_key<K, F>(self, f: F) -> IntoIter<Self::Item, Global>where + F: FnMut(&Self::Item) -> K,

Sort all iterator elements into a new iterator in ascending order. Read more
source§

fn sorted_by_cached_key<K, F>(self, f: F) -> IntoIter<Self::Item, Global>where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

Sort all iterator elements into a new iterator in ascending order. The key function is -called exactly once per key. Read more
source§

fn k_smallest(self, k: usize) -> IntoIter<Self::Item, Global>where +called exactly once per key. Read more

source§

fn k_smallest(self, k: usize) -> IntoIter<Self::Item, Global>where Self: Sized, - Self::Item: Ord,

Sort the k smallest elements into a new iterator, in ascending order. Read more
source§

fn partition_map<A, B, F, L, R>(self, predicate: F) -> (A, B)where + Self::Item: Ord,

Sort the k smallest elements into a new iterator, in ascending order. Read more
source§

fn partition_map<A, B, F, L, R>(self, predicate: F) -> (A, B)where Self: Sized, F: FnMut(Self::Item) -> Either<L, R>, A: Default + Extend<L>, B: Default + Extend<R>,

Collect all iterator elements into one of two partitions. Unlike Iterator::partition, each partition may -have a distinct type. Read more
source§

fn partition_result<A, B, T, E>(self) -> (A, B)where +have a distinct type. Read more

source§

fn partition_result<A, B, T, E>(self) -> (A, B)where Self: Iterator<Item = Result<T, E>> + Sized, A: Default + Extend<T>, B: Default + Extend<E>,

Partition a sequence of Results into one list of all the Ok elements -and another list of all the Err elements. Read more
source§

fn into_group_map<K, V>(self) -> HashMap<K, Vec<V, Global>, RandomState>where +and another list of all the Err elements. Read more

source§

fn into_group_map<K, V>(self) -> HashMap<K, Vec<V, Global>, RandomState>where Self: Iterator<Item = (K, V)> + Sized, K: Hash + Eq,

Return a HashMap of keys mapped to Vecs of values. Keys and values -are taken from (Key, Value) tuple pairs yielded by the input iterator. Read more
source§

fn into_group_map_by<K, V, F>( +are taken from (Key, Value) tuple pairs yielded by the input iterator. Read more

source§

fn into_group_map_by<K, V, F>( self, f: F ) -> HashMap<K, Vec<V, Global>, RandomState>where Self: Iterator<Item = V> + Sized, K: Hash + Eq, F: Fn(&V) -> K,

Return an Iterator on a HashMap. Keys mapped to Vecs of values. The key is specified -in the closure. Read more
source§

fn into_grouping_map<K, V>(self) -> GroupingMap<Self>where +in the closure. Read more

source§

fn into_grouping_map<K, V>(self) -> GroupingMap<Self>where Self: Iterator<Item = (K, V)> + Sized, - K: Hash + Eq,

Constructs a GroupingMap to be used later with one of the efficient -group-and-fold operations it allows to perform. Read more
source§

fn into_grouping_map_by<K, V, F>( + K: Hash + Eq,

Constructs a GroupingMap to be used later with one of the efficient +group-and-fold operations it allows to perform. Read more
source§

fn into_grouping_map_by<K, V, F>( self, key_mapper: F ) -> GroupingMap<MapForGrouping<Self, F>>where Self: Iterator<Item = V> + Sized, K: Hash + Eq, - F: FnMut(&V) -> K,

Constructs a GroupingMap to be used later with one of the efficient -group-and-fold operations it allows to perform. Read more
source§

fn min_set(self) -> Vec<Self::Item, Global>where + F: FnMut(&V) -> K,

Constructs a GroupingMap to be used later with one of the efficient +group-and-fold operations it allows to perform. Read more
source§

fn min_set(self) -> Vec<Self::Item, Global>where Self: Sized, - Self::Item: Ord,

Return all minimum elements of an iterator. Read more
source§

fn min_set_by<F>(self, compare: F) -> Vec<Self::Item, Global>where + Self::Item: Ord,

Return all minimum elements of an iterator. Read more
source§

fn min_set_by<F>(self, compare: F) -> Vec<Self::Item, Global>where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

Return all minimum elements of an iterator, as determined by -the specified function. Read more
source§

fn min_set_by_key<K, F>(self, key: F) -> Vec<Self::Item, Global>where +the specified function. Read more

source§

fn min_set_by_key<K, F>(self, key: F) -> Vec<Self::Item, Global>where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

Return all minimum elements of an iterator, as determined by -the specified function. Read more
source§

fn max_set(self) -> Vec<Self::Item, Global>where +the specified function. Read more

source§

fn max_set(self) -> Vec<Self::Item, Global>where Self: Sized, - Self::Item: Ord,

Return all maximum elements of an iterator. Read more
source§

fn max_set_by<F>(self, compare: F) -> Vec<Self::Item, Global>where + Self::Item: Ord,

Return all maximum elements of an iterator. Read more
source§

fn max_set_by<F>(self, compare: F) -> Vec<Self::Item, Global>where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

Return all maximum elements of an iterator, as determined by -the specified function. Read more
source§

fn max_set_by_key<K, F>(self, key: F) -> Vec<Self::Item, Global>where +the specified function. Read more

source§

fn max_set_by_key<K, F>(self, key: F) -> Vec<Self::Item, Global>where Self: Sized, K: Ord, - F: FnMut(&Self::Item) -> K,

Return all minimum elements of an iterator, as determined by -the specified function. Read more
source§

fn minmax(self) -> MinMaxResult<Self::Item>where + F: FnMut(&Self::Item) -> K,

Return all maximum elements of an iterator, as determined by +the specified function. Read more
source§

fn minmax(self) -> MinMaxResult<Self::Item>where Self: Sized, - Self::Item: PartialOrd<Self::Item>,

Return the minimum and maximum elements in the iterator. Read more
source§

fn minmax_by_key<K, F>(self, key: F) -> MinMaxResult<Self::Item>where + Self::Item: PartialOrd<Self::Item>,

Return the minimum and maximum elements in the iterator. Read more
source§

fn minmax_by_key<K, F>(self, key: F) -> MinMaxResult<Self::Item>where Self: Sized, K: PartialOrd<K>, F: FnMut(&Self::Item) -> K,

Return the minimum and maximum element of an iterator, as determined by -the specified function. Read more
source§

fn minmax_by<F>(self, compare: F) -> MinMaxResult<Self::Item>where +the specified function. Read more

source§

fn minmax_by<F>(self, compare: F) -> MinMaxResult<Self::Item>where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

Return the minimum and maximum element of an iterator, as determined by -the specified comparison function. Read more
source§

fn position_max(self) -> Option<usize>where +the specified comparison function. Read more

source§

fn position_max(self) -> Option<usize>where Self: Sized, - Self::Item: Ord,

Return the position of the maximum element in the iterator. Read more
source§

fn position_max_by_key<K, F>(self, key: F) -> Option<usize>where + Self::Item: Ord,

Return the position of the maximum element in the iterator. Read more
source§

fn position_max_by_key<K, F>(self, key: F) -> Option<usize>where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

Return the position of the maximum element in the iterator, as -determined by the specified function. Read more
source§

fn position_max_by<F>(self, compare: F) -> Option<usize>where +determined by the specified function. Read more

source§

fn position_max_by<F>(self, compare: F) -> Option<usize>where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

Return the position of the maximum element in the iterator, as -determined by the specified comparison function. Read more
source§

fn position_min(self) -> Option<usize>where +determined by the specified comparison function. Read more

source§

fn position_min(self) -> Option<usize>where Self: Sized, - Self::Item: Ord,

Return the position of the minimum element in the iterator. Read more
source§

fn position_min_by_key<K, F>(self, key: F) -> Option<usize>where + Self::Item: Ord,

Return the position of the minimum element in the iterator. Read more
source§

fn position_min_by_key<K, F>(self, key: F) -> Option<usize>where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

Return the position of the minimum element in the iterator, as -determined by the specified function. Read more
source§

fn position_min_by<F>(self, compare: F) -> Option<usize>where +determined by the specified function. Read more

source§

fn position_min_by<F>(self, compare: F) -> Option<usize>where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

Return the position of the minimum element in the iterator, as -determined by the specified comparison function. Read more
source§

fn position_minmax(self) -> MinMaxResult<usize>where +determined by the specified comparison function. Read more

source§

fn position_minmax(self) -> MinMaxResult<usize>where Self: Sized, Self::Item: PartialOrd<Self::Item>,

Return the positions of the minimum and maximum elements in -the iterator. Read more
source§

fn position_minmax_by_key<K, F>(self, key: F) -> MinMaxResult<usize>where +the iterator. Read more

source§

fn position_minmax_by_key<K, F>(self, key: F) -> MinMaxResult<usize>where Self: Sized, K: PartialOrd<K>, F: FnMut(&Self::Item) -> K,

Return the postions of the minimum and maximum elements of an -iterator, as determined by the specified function. Read more
source§

fn position_minmax_by<F>(self, compare: F) -> MinMaxResult<usize>where +iterator, as determined by the specified function. Read more

source§

fn position_minmax_by<F>(self, compare: F) -> MinMaxResult<usize>where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

Return the postions of the minimum and maximum elements of an -iterator, as determined by the specified comparison function. Read more
source§

fn exactly_one(self) -> Result<Self::Item, ExactlyOneError<Self>>where +iterator, as determined by the specified comparison function. Read more

source§

fn exactly_one(self) -> Result<Self::Item, ExactlyOneError<Self>>where Self: Sized,

If the iterator yields exactly one element, that element will be returned, otherwise an error will be returned containing an iterator that has the same output as the input -iterator. Read more
source§

fn at_most_one(self) -> Result<Option<Self::Item>, ExactlyOneError<Self>>where +iterator. Read more

source§

fn at_most_one(self) -> Result<Option<Self::Item>, ExactlyOneError<Self>>where Self: Sized,

If the iterator yields no elements, Ok(None) will be returned. If the iterator yields exactly one element, that element will be returned, otherwise an error will be returned -containing an iterator that has the same output as the input iterator. Read more
source§

fn multipeek(self) -> MultiPeek<Self>where +containing an iterator that has the same output as the input iterator. Read more

source§

fn multipeek(self) -> MultiPeek<Self>where Self: Sized,

An iterator adaptor that allows the user to peek at multiple .next() -values without advancing the base iterator. Read more
source§

fn counts(self) -> HashMap<Self::Item, usize, RandomState>where +values without advancing the base iterator. Read more

source§

fn counts(self) -> HashMap<Self::Item, usize, RandomState>where Self: Sized, Self::Item: Eq + Hash,

Collect the items in this iterator and return a HashMap which contains each item that appears in the iterator and the number -of times it appears. Read more
source§

fn counts_by<K, F>(self, f: F) -> HashMap<K, usize, RandomState>where +of times it appears. Read more

source§

fn counts_by<K, F>(self, f: F) -> HashMap<K, usize, RandomState>where Self: Sized, K: Eq + Hash, F: FnMut(Self::Item) -> K,

Collect the items in this iterator and return a HashMap which contains each item that appears in the iterator and the number of times it appears, -determining identity using a keying function. Read more
source§

fn multiunzip<FromI>(self) -> FromIwhere +determining identity using a keying function. Read more

source§

fn multiunzip<FromI>(self) -> FromIwhere Self: Sized + MultiUnzip<FromI>,

Converts an iterator of tuples into a tuple of containers. Read more
source§

impl<T> Same<T> for T

§

type Output = T

Should always be Self
source§

impl<T, U> TryFrom<U> for Twhere U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
const: unstable · source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
source§

impl<T, U> TryInto<U> for Twhere U: TryFrom<T>,

§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
const: unstable · source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
\ No newline at end of file