diff --git a/rust/help.html b/rust/help.html index c0a0e9b8..769c8576 100644 --- a/rust/help.html +++ b/rust/help.html @@ -1 +1 @@ -Rustdoc help

Rustdoc help

Back
\ No newline at end of file +Help

Rustdoc help

Back
\ No newline at end of file diff --git a/rust/implementors/bitflags/traits/trait.Flags.js b/rust/implementors/bitflags/traits/trait.Flags.js deleted file mode 100644 index d0077db9..00000000 --- a/rust/implementors/bitflags/traits/trait.Flags.js +++ /dev/null @@ -1,3 +0,0 @@ -(function() {var implementors = { -"sudachi":[["impl Flags for CategoryType"],["impl Flags for InfoSubset"]] -};if (window.register_implementors) {window.register_implementors(implementors);} else {window.pending_implementors = implementors;}})() \ No newline at end of file diff --git a/rust/implementors/bitflags/traits/trait.PublicFlags.js b/rust/implementors/bitflags/traits/trait.PublicFlags.js deleted file mode 100644 index 8c889285..00000000 --- a/rust/implementors/bitflags/traits/trait.PublicFlags.js +++ /dev/null @@ -1,3 +0,0 @@ -(function() {var implementors = { -"sudachi":[["impl PublicFlags for CategoryType"],["impl PublicFlags for InfoSubset"]] -};if (window.register_implementors) {window.register_implementors(implementors);} else {window.pending_implementors = implementors;}})() \ No newline at end of file diff --git a/rust/implementors/core/clone/trait.Clone.js b/rust/implementors/core/clone/trait.Clone.js deleted file mode 100644 index 41fe4cf0..00000000 --- a/rust/implementors/core/clone/trait.Clone.js +++ /dev/null @@ -1,3 +0,0 @@ -(function() {var implementors = { -"sudachi":[["impl Clone for ConfigBuilder"],["impl Clone for Mode"],["impl Clone for WordInfo"],["impl Clone for CreatedWords"],["impl Clone for BoundaryMode"],["impl Clone for HeaderVersion"],["impl Clone for UserDictVersion"],["impl Clone for CharacterCategory"],["impl Clone for TrieEntry"],["impl Clone for WordId"],["impl Clone for ResultNode"],["impl Clone for PosMatcher"],["impl Clone for SurfaceProjection"],["impl Clone for SystemDictVersion"],["impl Clone for Node"],["impl Clone for CategoryType"],["impl Clone for HasWord"],["impl Clone for Config"],["impl Clone for InputBuffer"],["impl Clone for Header"],["impl Clone for WordInfoData"],["impl Clone for InfoSubset"]] -};if (window.register_implementors) {window.register_implementors(implementors);} else {window.pending_implementors = implementors;}})() \ No newline at end of file diff --git a/rust/implementors/core/cmp/trait.Eq.js b/rust/implementors/core/cmp/trait.Eq.js deleted file mode 100644 index 21bf6091..00000000 --- a/rust/implementors/core/cmp/trait.Eq.js +++ /dev/null @@ -1,3 +0,0 @@ -(function() {var implementors = { -"sudachi":[["impl Eq for Mode"],["impl Eq for CreatedWords"],["impl Eq for LexiconEntry"],["impl Eq for UserDictVersion"],["impl Eq for HeaderVersion"],["impl Eq for CategoryType"],["impl Eq for Error"],["impl Eq for HasWord"],["impl Eq for BoundaryMode"],["impl Eq for InfoSubset"],["impl Eq for TrieEntry"],["impl Eq for LexiconSetError"],["impl Eq for HeaderError"],["impl Eq for SurfaceProjection"],["impl Eq for SystemDictVersion"],["impl Eq for WordId"],["impl Eq for Header"]] -};if (window.register_implementors) {window.register_implementors(implementors);} else {window.pending_implementors = implementors;}})() \ No newline at end of file diff --git a/rust/implementors/core/cmp/trait.PartialEq.js b/rust/implementors/core/cmp/trait.PartialEq.js deleted file mode 100644 index 17eaf068..00000000 --- a/rust/implementors/core/cmp/trait.PartialEq.js +++ /dev/null @@ -1,3 +0,0 @@ -(function() {var implementors = { -"sudachi":[["impl PartialEq<CreatedWords> for CreatedWords"],["impl PartialEq<UserDictVersion> for UserDictVersion"],["impl PartialEq<BoundaryMode> for BoundaryMode"],["impl PartialEq<LexiconSetError> for LexiconSetError"],["impl PartialEq<InfoSubset> for InfoSubset"],["impl PartialEq<Mode> for Mode"],["impl PartialEq<HeaderVersion> for HeaderVersion"],["impl PartialEq<SystemDictVersion> for SystemDictVersion"],["impl PartialEq<CategoryType> for CategoryType"],["impl PartialEq<SurfaceProjection> for SurfaceProjection"],["impl PartialEq<WordId> for WordId"],["impl PartialEq<TrieEntry> for TrieEntry"],["impl<I: PartialEq> PartialEq<SudachiNomError<I>> for SudachiNomError<I>"],["impl PartialEq<HasWord> for HasWord"],["impl PartialEq<LexiconEntry> for LexiconEntry"],["impl PartialEq<HeaderError> for HeaderError"],["impl PartialEq<Error> for Error"],["impl PartialEq<Header> for Header"]] -};if (window.register_implementors) {window.register_implementors(implementors);} else {window.pending_implementors = implementors;}})() \ No newline at end of file diff --git a/rust/implementors/core/cmp/trait.PartialOrd.js b/rust/implementors/core/cmp/trait.PartialOrd.js deleted file mode 100644 index c0fbb0a7..00000000 --- a/rust/implementors/core/cmp/trait.PartialOrd.js +++ /dev/null @@ -1,3 +0,0 @@ -(function() {var implementors = { -"sudachi":[["impl PartialOrd<WordId> for WordId"]] -};if (window.register_implementors) {window.register_implementors(implementors);} else {window.pending_implementors = implementors;}})() \ No newline at end of file diff --git a/rust/implementors/core/convert/trait.From.js b/rust/implementors/core/convert/trait.From.js deleted file mode 100644 index cc4e3bf8..00000000 --- a/rust/implementors/core/convert/trait.From.js +++ /dev/null @@ -1,3 +0,0 @@ -(function() {var implementors = { -"sudachi":[["impl From<Error> for ConfigError"],["impl From<Error> for BuildFailure"],["impl From<Error> for SudachiError"],["impl From<Error> for SudachiError"],["impl From<PluginError> for SudachiError"],["impl From<ParseIntError> for SudachiError"],["impl From<Error> for PluginError"],["impl From<ConfigError> for SudachiError"],["impl<I: Debug> From<Err<SudachiNomError<I>>> for SudachiError"],["impl From<HeaderError> for SudachiError"],["impl From<Error> for PluginError"],["impl From<Error> for PluginError"],["impl From<Error> for ConfigError"],["impl From<Error> for SudachiError"],["impl From<FromUtf16Error> for SudachiError"],["impl From<LexiconSetError> for SudachiError"],["impl From<WordInfoData> for WordInfo"],["impl From<Error> for SudachiError"],["impl From<DicBuildError> for SudachiError"],["impl From<WordInfo> for WordInfoData"]] -};if (window.register_implementors) {window.register_implementors(implementors);} else {window.pending_implementors = implementors;}})() \ No newline at end of file diff --git a/rust/implementors/core/default/trait.Default.js b/rust/implementors/core/default/trait.Default.js deleted file mode 100644 index 4a9d1045..00000000 --- a/rust/implementors/core/default/trait.Default.js +++ /dev/null @@ -1,3 +0,0 @@ -(function() {var implementors = { -"sudachi":[["impl Default for CharacterCategory"],["impl Default for Config"],["impl Default for JoinNumericPlugin"],["impl Default for CategoryType"],["impl Default for CreatedWords"],["impl Default for JoinKatakanaOovPlugin"],["impl Default for SimpleOovPlugin"],["impl Default for SurfaceProjection"],["impl Default for DefaultInputTextPlugin"],["impl Default for BoundaryMode"],["impl Default for WordInfoData"],["impl Default for MeCabOovPlugin"],["impl Default for WordInfo"],["impl Default for InfoSubset"],["impl Default for Lattice"],["impl Default for InputBuffer"]] -};if (window.register_implementors) {window.register_implementors(implementors);} else {window.pending_implementors = implementors;}})() \ No newline at end of file diff --git a/rust/implementors/core/error/trait.Error.js b/rust/implementors/core/error/trait.Error.js deleted file mode 100644 index 48d662fd..00000000 --- a/rust/implementors/core/error/trait.Error.js +++ /dev/null @@ -1,3 +0,0 @@ -(function() {var implementors = { -"sudachi":[["impl Error for PluginError"],["impl Error for Error"],["impl Error for SudachiError"],["impl Error for LexiconSetError"],["impl Error for BuildFailure"],["impl Error for HeaderError"],["impl Error for DicBuildError"],["impl Error for ConfigError"]] -};if (window.register_implementors) {window.register_implementors(implementors);} else {window.pending_implementors = implementors;}})() \ No newline at end of file diff --git a/rust/implementors/core/fmt/trait.Binary.js b/rust/implementors/core/fmt/trait.Binary.js deleted file mode 100644 index a73365ac..00000000 --- a/rust/implementors/core/fmt/trait.Binary.js +++ /dev/null @@ -1,3 +0,0 @@ -(function() {var implementors = { -"sudachi":[["impl Binary for CategoryType"],["impl Binary for InfoSubset"]] -};if (window.register_implementors) {window.register_implementors(implementors);} else {window.pending_implementors = implementors;}})() \ No newline at end of file diff --git a/rust/implementors/core/fmt/trait.Debug.js b/rust/implementors/core/fmt/trait.Debug.js deleted file mode 100644 index c64d92db..00000000 --- a/rust/implementors/core/fmt/trait.Debug.js +++ /dev/null @@ -1,3 +0,0 @@ -(function() {var implementors = { -"sudachi":[["impl Debug for CreatedWords"],["impl Debug for InfoSubset"],["impl Debug for ConfigBuilder"],["impl Debug for Config"],["impl Debug for PluginError"],["impl Debug for HeaderError"],["impl Debug for LexiconSetError"],["impl Debug for Error"],["impl Debug for HeaderVersion"],["impl Debug for TrieEntry"],["impl Debug for WordInfoData"],["impl Debug for Node"],["impl Debug for BoundaryMode"],["impl Debug for CategoryType"],["impl Debug for BuildFailure"],["impl Debug for LexiconEntry"],["impl Debug for UserDictVersion"],["impl Debug for SystemDictVersion"],["impl Debug for CharacterCategory"],["impl Debug for Mode"],["impl Debug for SudachiError"],["impl Debug for ConfigError"],["impl Debug for HasWord"],["impl Debug for WordId"],["impl Debug for DicBuildError"],["impl Debug for Header"],["impl Debug for SurfaceProjection"],["impl<T: DictionaryAccess> Debug for Morpheme<'_, T>"],["impl<I: Debug> Debug for SudachiNomError<I>"]] -};if (window.register_implementors) {window.register_implementors(implementors);} else {window.pending_implementors = implementors;}})() \ No newline at end of file diff --git a/rust/implementors/core/fmt/trait.Display.js b/rust/implementors/core/fmt/trait.Display.js deleted file mode 100644 index e30767e4..00000000 --- a/rust/implementors/core/fmt/trait.Display.js +++ /dev/null @@ -1,3 +0,0 @@ -(function() {var implementors = { -"sudachi":[["impl Display for PluginError"],["impl Display for HeaderError"],["impl Display for ResultNode"],["impl Display for DicBuildError"],["impl Display for WordId"],["impl Display for ConfigError"],["impl Display for LexiconSetError"],["impl Display for Error"],["impl Display for SudachiError"],["impl Display for BuildFailure"],["impl Display for Mode"]] -};if (window.register_implementors) {window.register_implementors(implementors);} else {window.pending_implementors = implementors;}})() \ No newline at end of file diff --git a/rust/implementors/core/iter/traits/collect/trait.Extend.js b/rust/implementors/core/iter/traits/collect/trait.Extend.js deleted file mode 100644 index 15e1b0dc..00000000 --- a/rust/implementors/core/iter/traits/collect/trait.Extend.js +++ /dev/null @@ -1,3 +0,0 @@ -(function() {var implementors = { -"sudachi":[["impl Extend<CategoryType> for CategoryType"],["impl Extend<InfoSubset> for InfoSubset"]] -};if (window.register_implementors) {window.register_implementors(implementors);} else {window.pending_implementors = implementors;}})() \ No newline at end of file diff --git a/rust/implementors/core/iter/traits/iterator/trait.Iterator.js b/rust/implementors/core/iter/traits/iterator/trait.Iterator.js deleted file mode 100644 index 4b171dda..00000000 --- a/rust/implementors/core/iter/traits/iterator/trait.Iterator.js +++ /dev/null @@ -1,3 +0,0 @@ -(function() {var implementors = { -"sudachi":[["impl<'a> Iterator for TrieEntryIter<'a>"],["impl<'s, 'x> Iterator for SentenceIter<'s, 'x>"],["impl Iterator for CharCategoryIter<'_>"],["impl<'a, T: DictionaryAccess> Iterator for MorphemeIter<'a, T>"],["impl Iterator for WordIdIter"],["impl Iterator for NodeSplitIterator<'_>"]] -};if (window.register_implementors) {window.register_implementors(implementors);} else {window.pending_implementors = implementors;}})() \ No newline at end of file diff --git a/rust/implementors/core/iter/traits/marker/trait.FusedIterator.js b/rust/implementors/core/iter/traits/marker/trait.FusedIterator.js deleted file mode 100644 index ec4cf60f..00000000 --- a/rust/implementors/core/iter/traits/marker/trait.FusedIterator.js +++ /dev/null @@ -1,3 +0,0 @@ -(function() {var implementors = { -"sudachi":[["impl FusedIterator for TrieEntryIter<'_>"],["impl FusedIterator for NodeSplitIterator<'_>"],["impl FusedIterator for WordIdIter"],["impl FusedIterator for CharCategoryIter<'_>"],["impl<'a, T: DictionaryAccess> FusedIterator for MorphemeIter<'a, T>"]] -};if (window.register_implementors) {window.register_implementors(implementors);} else {window.pending_implementors = implementors;}})() \ No newline at end of file diff --git a/rust/implementors/core/marker/trait.Copy.js b/rust/implementors/core/marker/trait.Copy.js deleted file mode 100644 index e8af47ae..00000000 --- a/rust/implementors/core/marker/trait.Copy.js +++ /dev/null @@ -1,3 +0,0 @@ -(function() {var implementors = { -"sudachi":[["impl Copy for WordId"],["impl Copy for CategoryType"],["impl Copy for BoundaryMode"],["impl Copy for HasWord"],["impl Copy for CreatedWords"],["impl Copy for SurfaceProjection"],["impl Copy for Mode"],["impl Copy for InfoSubset"]] -};if (window.register_implementors) {window.register_implementors(implementors);} else {window.pending_implementors = implementors;}})() \ No newline at end of file diff --git a/rust/implementors/core/marker/trait.StructuralEq.js b/rust/implementors/core/marker/trait.StructuralEq.js deleted file mode 100644 index 43298db3..00000000 --- a/rust/implementors/core/marker/trait.StructuralEq.js +++ /dev/null @@ -1,3 +0,0 @@ -(function() {var implementors = { -"sudachi":[["impl StructuralEq for LexiconSetError"],["impl StructuralEq for UserDictVersion"],["impl StructuralEq for InfoSubset"],["impl StructuralEq for CreatedWords"],["impl StructuralEq for SurfaceProjection"],["impl StructuralEq for WordId"],["impl StructuralEq for CategoryType"],["impl StructuralEq for BoundaryMode"],["impl StructuralEq for SystemDictVersion"],["impl StructuralEq for Header"],["impl StructuralEq for HasWord"],["impl StructuralEq for TrieEntry"],["impl StructuralEq for LexiconEntry"],["impl StructuralEq for Error"],["impl StructuralEq for Mode"],["impl StructuralEq for HeaderError"],["impl StructuralEq for HeaderVersion"]] -};if (window.register_implementors) {window.register_implementors(implementors);} else {window.pending_implementors = implementors;}})() \ No newline at end of file diff --git a/rust/implementors/core/marker/trait.StructuralPartialEq.js b/rust/implementors/core/marker/trait.StructuralPartialEq.js deleted file mode 100644 index 32d2200d..00000000 --- a/rust/implementors/core/marker/trait.StructuralPartialEq.js +++ /dev/null @@ -1,3 +0,0 @@ -(function() {var implementors = { -"sudachi":[["impl StructuralPartialEq for CategoryType"],["impl StructuralPartialEq for SurfaceProjection"],["impl StructuralPartialEq for WordId"],["impl StructuralPartialEq for UserDictVersion"],["impl StructuralPartialEq for InfoSubset"],["impl StructuralPartialEq for Error"],["impl StructuralPartialEq for TrieEntry"],["impl StructuralPartialEq for HeaderVersion"],["impl StructuralPartialEq for Header"],["impl StructuralPartialEq for LexiconSetError"],["impl StructuralPartialEq for LexiconEntry"],["impl<I> StructuralPartialEq for SudachiNomError<I>"],["impl StructuralPartialEq for Mode"],["impl StructuralPartialEq for SystemDictVersion"],["impl StructuralPartialEq for HasWord"],["impl StructuralPartialEq for BoundaryMode"],["impl StructuralPartialEq for CreatedWords"],["impl StructuralPartialEq for HeaderError"]] -};if (window.register_implementors) {window.register_implementors(implementors);} else {window.pending_implementors = implementors;}})() \ No newline at end of file diff --git a/rust/implementors/core/ops/arith/trait.Sub.js b/rust/implementors/core/ops/arith/trait.Sub.js deleted file mode 100644 index 9bd6854e..00000000 --- a/rust/implementors/core/ops/arith/trait.Sub.js +++ /dev/null @@ -1,3 +0,0 @@ -(function() {var implementors = { -"sudachi":[["impl Sub<CategoryType> for CategoryType"],["impl Sub<InfoSubset> for InfoSubset"]] -};if (window.register_implementors) {window.register_implementors(implementors);} else {window.pending_implementors = implementors;}})() \ No newline at end of file diff --git a/rust/implementors/core/ops/arith/trait.SubAssign.js b/rust/implementors/core/ops/arith/trait.SubAssign.js deleted file mode 100644 index dffac5ca..00000000 --- a/rust/implementors/core/ops/arith/trait.SubAssign.js +++ /dev/null @@ -1,3 +0,0 @@ -(function() {var implementors = { -"sudachi":[["impl SubAssign<CategoryType> for CategoryType"],["impl SubAssign<InfoSubset> for InfoSubset"]] -};if (window.register_implementors) {window.register_implementors(implementors);} else {window.pending_implementors = implementors;}})() \ No newline at end of file diff --git a/rust/implementors/core/ops/bit/trait.BitAnd.js b/rust/implementors/core/ops/bit/trait.BitAnd.js deleted file mode 100644 index 7d7d07f6..00000000 --- a/rust/implementors/core/ops/bit/trait.BitAnd.js +++ /dev/null @@ -1,3 +0,0 @@ -(function() {var implementors = { -"sudachi":[["impl BitAnd<InfoSubset> for InfoSubset"],["impl BitAnd<CategoryType> for CategoryType"]] -};if (window.register_implementors) {window.register_implementors(implementors);} else {window.pending_implementors = implementors;}})() \ No newline at end of file diff --git a/rust/implementors/core/ops/bit/trait.BitAndAssign.js b/rust/implementors/core/ops/bit/trait.BitAndAssign.js deleted file mode 100644 index 5295a782..00000000 --- a/rust/implementors/core/ops/bit/trait.BitAndAssign.js +++ /dev/null @@ -1,3 +0,0 @@ -(function() {var implementors = { -"sudachi":[["impl BitAndAssign<InfoSubset> for InfoSubset"],["impl BitAndAssign<CategoryType> for CategoryType"]] -};if (window.register_implementors) {window.register_implementors(implementors);} else {window.pending_implementors = implementors;}})() \ No newline at end of file diff --git a/rust/implementors/core/ops/bit/trait.BitOr.js b/rust/implementors/core/ops/bit/trait.BitOr.js deleted file mode 100644 index 3345f5ca..00000000 --- a/rust/implementors/core/ops/bit/trait.BitOr.js +++ /dev/null @@ -1,3 +0,0 @@ -(function() {var implementors = { -"sudachi":[["impl BitOr<InfoSubset> for InfoSubset"],["impl BitOr<CategoryType> for CategoryType"]] -};if (window.register_implementors) {window.register_implementors(implementors);} else {window.pending_implementors = implementors;}})() \ No newline at end of file diff --git a/rust/implementors/core/ops/bit/trait.BitOrAssign.js b/rust/implementors/core/ops/bit/trait.BitOrAssign.js deleted file mode 100644 index 7a8b7540..00000000 --- a/rust/implementors/core/ops/bit/trait.BitOrAssign.js +++ /dev/null @@ -1,3 +0,0 @@ -(function() {var implementors = { -"sudachi":[["impl BitOrAssign<InfoSubset> for InfoSubset"],["impl BitOrAssign<CategoryType> for CategoryType"]] -};if (window.register_implementors) {window.register_implementors(implementors);} else {window.pending_implementors = implementors;}})() \ No newline at end of file diff --git a/rust/implementors/core/ops/bit/trait.BitXor.js b/rust/implementors/core/ops/bit/trait.BitXor.js deleted file mode 100644 index 36526ac4..00000000 --- a/rust/implementors/core/ops/bit/trait.BitXor.js +++ /dev/null @@ -1,3 +0,0 @@ -(function() {var implementors = { -"sudachi":[["impl BitXor<CategoryType> for CategoryType"],["impl BitXor<InfoSubset> for InfoSubset"]] -};if (window.register_implementors) {window.register_implementors(implementors);} else {window.pending_implementors = implementors;}})() \ No newline at end of file diff --git a/rust/implementors/core/ops/bit/trait.BitXorAssign.js b/rust/implementors/core/ops/bit/trait.BitXorAssign.js deleted file mode 100644 index de1be530..00000000 --- a/rust/implementors/core/ops/bit/trait.BitXorAssign.js +++ /dev/null @@ -1,3 +0,0 @@ -(function() {var implementors = { -"sudachi":[["impl BitXorAssign<CategoryType> for CategoryType"],["impl BitXorAssign<InfoSubset> for InfoSubset"]] -};if (window.register_implementors) {window.register_implementors(implementors);} else {window.pending_implementors = implementors;}})() \ No newline at end of file diff --git a/rust/implementors/core/str/traits/trait.FromStr.js b/rust/implementors/core/str/traits/trait.FromStr.js deleted file mode 100644 index 93247a39..00000000 --- a/rust/implementors/core/str/traits/trait.FromStr.js +++ /dev/null @@ -1,3 +0,0 @@ -(function() {var implementors = { -"sudachi":[["impl FromStr for CategoryType"],["impl FromStr for Mode"]] -};if (window.register_implementors) {window.register_implementors(implementors);} else {window.pending_implementors = implementors;}})() \ No newline at end of file diff --git a/rust/implementors/serde/de/trait.Deserialize.js b/rust/implementors/serde/de/trait.Deserialize.js deleted file mode 100644 index 185fb195..00000000 --- a/rust/implementors/serde/de/trait.Deserialize.js +++ /dev/null @@ -1,3 +0,0 @@ -(function() {var implementors = { -"sudachi":[["impl<'de> Deserialize<'de> for SurfaceProjection"],["impl<'de> Deserialize<'de> for ConfigBuilder"],["impl<'de> Deserialize<'de> for BoundaryMode"]] -};if (window.register_implementors) {window.register_implementors(implementors);} else {window.pending_implementors = implementors;}})() \ No newline at end of file diff --git a/rust/search-index.js b/rust/search-index.js index 0cfa72c8..26d6630d 100644 --- a/rust/search-index.js +++ b/rust/search-index.js @@ -1,5 +1,5 @@ var searchIndex = JSON.parse('{\ -"sudachi":{"doc":"Clone of Sudachi, a Japanese morphological analyzer","t":"AAAAAAAAAAONNNQEDILLLLLLLLLLALLLLLLLLLLLLLALAALALLAALLLKLLLLLLLDESNNNLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLDLLLLLLLLLLLLLLLLDDLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLDLLLLLLLLLLLLLLLLLLLLLLLLLLLIDIDIKLLLLLLLLLLFFKLKLLLLLLLLLLLKLLLLLKLLLLLLLKLLLLLLLKLLDLLLLLLLLLLLLLLLLLLIDLLLLKKLKLKKLLLLDDENNNNNNNNNNNNNELLLLLLLLLMLLLLLLLMLLFFLLLLLLLLLLLLLLLLLLLLLLMLLLLLLMMMLLLLLLLLMLLLLLLLLLLLLLLLLLLMLDDLLLLAAAAALLLALMMAMLLLALMAMLLALLLAALLLLLLLAINEDNELLLLLLLKLALLLLLLLLLKLLLLLLLALLLLLLLLLLLLLENDGNNNNNNNNNNNNNNNNNNNLLLLMMLLLLLLLLLMLLLLLLLLLMMMMMMMDLLLLLLLLLLLSSSDSSSSSSSSSSSSSSSLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLDDENNNNLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLDLLLLLLLLLLLLDLLLLLLLLLLLLLLLLSSDSLLMLLLLLLLLMLLLMLLLNDEENNNSNENENNNNNLLLLLLLLLLLLLLLLLLMMLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLMLDDRLLLLMLLLLLLLLLLLLLLLLALLLLLLLMAAADDDLLLLLLLLLMLLLLLLLLLLLLLLLLLLLLLLLLLLLMDDLLLLLLLLLLLLLLLLLLLDDDLMLMLLLLLLLLLLLLLLMLMLLLLLLLLMLLLLLMLMLMLMLMLLLLLLLLLLLLMDLLLLLLLLLLLLLDENNNLLLLLLLLLLLLLLLLLLLLLLLLLLLLLFFFFFNNNEDLLLLLLLLLLLLLLLLLLLSSDSSSSSSSSLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLSSSSDLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLNNNNNNNNNNNNNNNNNNNNNNNNNNNNNEEGGNLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLMMMMDDILLLLLLKLKLKLLKLLLLKLLLLLLLLLLLLLLKLLLLLLLLLLLLKLLLLLLLLLLLQQNNNIENLLKKAKALLLLLLALAALLLLLMMILLLKKILLALLKKLDLLLLLLLLLLLILLLAKAKADLLLLLLLLLLENNLLLLLLLLLLLLLLLLLDLLLLLLLLLLILLLAAKKDLLLLLLLLLLDLLLLLLLLLLDLLLLLLLLLLLLLLLLLCCCCCDDLLLLMLLLLLLLLLLLLLLDDILLLLLLLLLLLLKLLLLLLLLL","n":["analysis","config","dic","error","input_text","plugin","pos","prelude","sentence_detector","sentence_splitter","sudachi_dso_plugin","A","B","C","Dictionary","Mode","Node","Tokenize","begin","borrow","borrow","borrow_mut","borrow_mut","clone","clone","clone_into","clone_into","cost","created","end","eq","equivalent","equivalent","equivalent","fmt","fmt","fmt","from","from","from_str","into","into","lattice","left_id","mlist","morpheme","new","node","right_id","set_range","stateful_tokenizer","stateless_tokenizer","to_owned","to_owned","to_string","tokenize","try_from","try_from","try_into","try_into","type_id","type_id","word_id","CreatedWords","HasWord","MAX_VALUE","Maybe","No","Yes","add","add_word","borrow","borrow","borrow_mut","borrow_mut","clone","clone","clone_into","clone_into","default","empty","eq","eq","equivalent","equivalent","equivalent","equivalent","equivalent","equivalent","fmt","fmt","from","from","has_word","into","into","is_empty","not_empty","single","to_owned","to_owned","try_from","try_from","try_into","try_into","type_id","type_id","Lattice","borrow","borrow_mut","connect_eos","connect_node","default","dump","fill_top_path","from","has_previous_node","insert","into","node","reset","try_from","try_into","type_id","MorphemeIter","MorphemeList","borrow","borrow","borrow_mut","borrow_mut","clear","collect_results","copy_slice","dict","empty","empty_clone","from","from","from_components","get","get_internal_cost","into","into","into_iter","is_empty","iter","len","len","lookup","next","size_hint","split","split_into","subset","surface","try_from","try_from","try_into","try_into","type_id","type_id","Morpheme","begin","begin_c","borrow","borrow_mut","dictionary_form","dictionary_id","end","end_c","fmt","from","get_word_info","index","into","is_oov","normalized_form","part_of_speech","part_of_speech_id","reading_form","split","split_into","surface","synonym_group_ids","total_cost","try_from","try_into","type_id","word_id","LatticeNode","NodeSplitIterator","PathCost","ResultNode","RightId","begin","begin","begin_bytes","borrow","borrow","borrow_mut","borrow_mut","bytes_range","char_range","clone","clone_into","concat_nodes","concat_oov_nodes","cost","cost","end","end","end_bytes","fmt","from","from","into","into","into_iter","is_connected_to_bos","is_oov","is_special_node","left_id","left_id","new","next","num_codepts","num_splits","right_id","right_id","set_bytes_range","set_char_range","size_hint","split","to_owned","to_string","total_cost","total_cost","try_from","try_from","try_into","try_into","type_id","type_id","word_id","word_id","word_info","StatefulTokenizer","borrow","borrow_mut","create","dict","dict_clone","do_tokenize","from","into","into_morpheme_list","new","reset","set_debug","set_mode","set_subset","swap_result","try_from","try_into","type_id","DictionaryAccess","StatelessTokenizer","as_dict","borrow","borrow_mut","from","grammar","input_text_plugins","into","lexicon","new","oov_provider_plugins","path_rewrite_plugins","tokenize","try_from","try_into","type_id","Config","ConfigBuilder","ConfigError","Dictionary","DictionaryAndSurface","FileNotFound","InvalidFormat","Io","MissingArgument","Normalized","NormalizedAndSurface","NormalizedNouns","PathResolution","Reading","SerdeError","Surface","SurfaceProjection","borrow","borrow","borrow","borrow","borrow_mut","borrow_mut","borrow_mut","borrow_mut","build","character_definition_file","clone","clone","clone","clone_into","clone_into","clone_into","complete_path","connection_cost_plugins","default","default","default_config_location","default_resource_dir","deserialize","deserialize","empty","eq","equivalent","equivalent","equivalent","fallback","fmt","fmt","fmt","fmt","fmt","from","from","from","from","from","from","from_bytes","from_file","from_opt_file","input_text_plugins","into","into","into","into","minimal_at","new","oov_provider_plugins","path_rewrite_plugins","projection","required_subset","resolve_paths","resolved_system_dict","resolved_user_dicts","resource_path","root_directory","source","system_dict","system_dict","to_owned","to_owned","to_owned","to_string","try_from","try_from","try_from","try_from","try_from","try_into","try_into","try_into","try_into","type_id","type_id","type_id","type_id","user_dict","user_dicts","with_system_dic","DictionaryLoader","LoadedDictionary","borrow","borrow","borrow_mut","borrow_mut","build","category_type","character_category","connect","dictionary","from","from","from_system_dictionary","grammar","grammar","grammar","grammar","header","header","input_text_plugins","into","into","lexicon","lexicon","lexicon","lexicon_set","lexicon_set","oov_provider_plugins","path_rewrite_plugins","read","read_any_dictionary","read_system_dictionary","read_user_dictionary","storage","subset","to_loaded","try_from","try_from","try_into","try_into","type_id","type_id","word_id","AsDataSource","Data","DataSource","DictBuilder","File","NoDic","borrow","borrow","borrow","borrow_mut","borrow_mut","borrow_mut","compile","convert","convert","error","from","from","from","grammar","input_text_plugins","into","into","into","lexicon","name","name","new_system","new_user","oov_provider_plugins","path_rewrite_plugins","read_conn","read_lexicon","report","report","resolve","set_compile_time","set_description","try_from","try_from","try_from","try_into","try_into","try_into","type_id","type_id","type_id","BuildFailure","CsvError","DicBuildError","DicWriteResult","EmptySurface","Err","InvalidCharLiteral","InvalidConnSize","InvalidFieldSize","InvalidI16Literal","InvalidSize","InvalidSplit","InvalidSplitWordReference","InvalidU32Literal","InvalidWordId","Io","NoRawField","Ok","PosLimitExceeded","SplitFormatError","TrieBuildFailure","UnresolvedSplits","WordIdTableNotBuilt","borrow","borrow","borrow_mut","borrow_mut","cause","file","fmt","fmt","fmt","fmt","from","from","from","into","into","line","source","to_string","to_string","try_from","try_from","try_into","try_into","type_id","type_id","actual","actual","expected","expected","field","field","original","DictPartReport","borrow","borrow_mut","from","into","is_write","part","size","time","try_from","try_into","type_id","ALL","ALPHA","CYRILLIC","CategoryType","DEFAULT","GREEK","HIRAGANA","KANJI","KANJINUMERIC","KATAKANA","NOOOVBOW","NOOOVBOW2","NUMERIC","SPACE","SYMBOL","USER1","USER2","USER3","USER4","all","bitand","bitand_assign","bitor","bitor_assign","bits","bits","bitxor","bitxor_assign","borrow","borrow_mut","clone","clone_into","complement","contains","count","default","difference","empty","eq","equivalent","equivalent","equivalent","extend","fmt","fmt","fmt","fmt","fmt","from","from_bits","from_bits_retain","from_bits_retain","from_bits_truncate","from_iter","from_name","from_str","hash","insert","intersection","intersects","into","into_iter","is_all","is_empty","iter","iter_names","not","remove","set","sub","sub_assign","symmetric_difference","to_owned","toggle","try_from","try_into","type_id","union","CharCategoryIter","CharacterCategory","Error","InvalidCategoryType","InvalidChar","InvalidFormat","MultipleTypeDefinition","borrow","borrow","borrow","borrow_mut","borrow_mut","borrow_mut","clone","clone_into","default","eq","equivalent","equivalent","equivalent","fmt","fmt","fmt","from","from","from","from_file","from_reader","get_category_types","into","into","into","into_iter","iter","multiunzip","next","to_owned","to_string","try_from","try_from","try_from","try_into","try_into","try_into","type_id","type_id","type_id","ConnectionMatrix","borrow","borrow_mut","cost","from","from_offset_size","into","num_left","num_right","try_from","try_into","type_id","update","JapaneseDictionary","borrow","borrow_mut","from","from_cfg","from_cfg_storage","grammar","grammar","input_text_plugins","into","lexicon","lexicon","oov_provider_plugins","path_rewrite_plugins","try_from","try_into","type_id","BOS_PARAMETER","EOS_PARAMETER","Grammar","INHIBITED_CONNECTION","borrow","borrow_mut","character_category","conn_matrix","connect_cost","from","get_part_of_speech_id","into","merge","parse","pos_components","pos_list","register_pos","set_character_category","set_connect_cost","storage_size","try_from","try_into","type_id","CannotParse","Header","HeaderError","HeaderVersion","InvalidSystemDictVersion","InvalidUserDictVersion","InvalidVersion","STORAGE_SIZE","SystemDict","SystemDictVersion","UserDict","UserDictVersion","Version1","Version1","Version2","Version2","Version3","borrow","borrow","borrow","borrow","borrow","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","clone","clone","clone","clone","clone_into","clone_into","clone_into","clone_into","create_time","description","eq","eq","eq","eq","eq","equivalent","equivalent","equivalent","equivalent","equivalent","equivalent","equivalent","equivalent","equivalent","equivalent","equivalent","equivalent","equivalent","equivalent","equivalent","fmt","fmt","fmt","fmt","fmt","fmt","from","from","from","from","from","from_u64","has_grammar","has_synonym_group_ids","into","into","into","into","into","new","parse","set_time","to_owned","to_owned","to_owned","to_owned","to_string","to_u64","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","version","write_to","Lexicon","LexiconEntry","MAX_DICTIONARIES","borrow","borrow","borrow_mut","borrow_mut","end","eq","equivalent","equivalent","equivalent","fmt","from","from","get_word_info","get_word_param","into","into","lookup","new","parse","set_dic_id","size","trie","try_from","try_from","try_into","try_into","type_id","type_id","update_cost","word_id","word_id_table","word_infos","word_params","Trie","TrieEntry","TrieEntryIter","borrow","borrow","borrow","borrow_mut","borrow_mut","borrow_mut","clone","clone_into","common_prefix_iterator","end","eq","equivalent","equivalent","equivalent","fmt","from","from","from","into","into","into","into_iter","new","new","new_owned","next","to_owned","total_size","try_from","try_from","try_from","try_into","try_into","try_into","type_id","type_id","type_id","value","WordIdIter","WordIdTable","borrow","borrow","borrow_mut","borrow_mut","entries","from","from","into","into","into_iter","new","next","storage_size","try_from","try_from","try_into","try_into","type_id","type_id","WordInfo","WordInfoData","WordInfos","a_unit_split","a_unit_split","b_unit_split","b_unit_split","borrow","borrow","borrow","borrow_data","borrow_mut","borrow_mut","borrow_mut","clone","clone","clone_into","clone_into","default","default","dictionary_form","dictionary_form","dictionary_form_word_id","dictionary_form_word_id","fmt","from","from","from","from","from","get_word_info","head_word_length","head_word_length","into","into","into","new","normalized_form","normalized_form","pos_id","pos_id","reading_form","reading_form","surface","surface","synonym_group_ids","synonym_group_ids","to_owned","to_owned","try_from","try_from","try_from","try_into","try_into","try_into","type_id","type_id","type_id","word_structure","word_structure","WordParams","borrow","borrow_mut","from","get_cost","get_params","into","new","set_cost","size","storage_size","try_from","try_into","type_id","LexiconSet","LexiconSetError","TooLargeDictionaryId","TooLargeWordId","TooManyDictionaries","append","borrow","borrow","borrow_mut","borrow_mut","eq","equivalent","equivalent","equivalent","fmt","fmt","from","from","get_word_info","get_word_info_subset","get_word_param","into","into","is_full","lookup","new","size","to_string","try_from","try_from","try_into","try_into","type_id","type_id","skip_u32_array","skip_wid_array","u32_array_parser","u32_parser","u32_wid_array_parser","Borrowed","File","Owned","Storage","SudachiDicData","add_user","as_ref","borrow","borrow","borrow_mut","borrow_mut","from","from","into","into","new","system","system_static_slice","try_from","try_from","try_into","try_into","type_id","type_id","DIC_FORM_WORD_ID","HEAD_WORD_LENGTH","InfoSubset","NORMALIZED_FORM","POS_ID","READING_FORM","SPLIT_A","SPLIT_B","SURFACE","SYNONYM_GROUP_ID","WORD_STRUCTURE","all","bitand","bitand_assign","bitor","bitor_assign","bits","bits","bitxor","bitxor_assign","borrow","borrow_mut","clone","clone_into","complement","contains","default","difference","empty","eq","equivalent","equivalent","equivalent","extend","fmt","fmt","fmt","fmt","fmt","from","from_bits","from_bits_retain","from_bits_retain","from_bits_truncate","from_iter","from_name","insert","intersection","intersects","into","into_iter","is_all","is_empty","iter","iter_names","normalize","not","remove","set","sub","sub_assign","symmetric_difference","to_owned","toggle","try_from","try_into","type_id","union","BOS","EOS","INVALID","MAX_WORD","WordId","as_raw","borrow","borrow_mut","checked","clone","clone_into","cmp","compare","dic","eq","equivalent","equivalent","equivalent","fmt","fmt","from","from_raw","hash","into","is_oov","is_special","is_system","is_user","new","oov","partial_cmp","to_owned","to_string","try_from","try_into","type_id","word","ConfigError","DictionaryCompilationError","EosBosDisconnect","Err","Err","ErrWithContext","FromUtf16","InputTooLong","InvalidCharacterCategory","InvalidCharacterCategoryType","InvalidDataFormat","InvalidDictionaryGrammar","InvalidHeader","InvalidPartOfSpeech","InvalidRange","InvalidUtf16FromNom","Io","LexiconSetError","MorphemeListBorrowed","NoOOVPluginProvided","Nom","NomParseError","Ok","Ok","OutOfBounds","ParseIntError","PluginError","RegexError","SerdeError","SudachiError","SudachiNomError","SudachiNomResult","SudachiResult","Utf16String","append","borrow","borrow","borrow_mut","borrow_mut","eq","fmt","fmt","fmt","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from_error_kind","into","into","source","to_string","try_from","try_from","try_into","try_into","type_id","type_id","with_context","cause","cause","context","context","InputBuffer","InputEditor","InputTextIndex","borrow","borrow","borrow_mut","borrow_mut","build","can_bow","cat_at_char","cat_at_char","cat_continuous_len","cat_continuous_len","cat_of_range","cat_of_range","ch_idx","char_distance","char_distance","clone","clone_into","curr_byte_offsets","curr_slice","curr_slice","curr_slice_c","current","current_chars","default","from","from","from","get_original_index","get_word_candidate_length","into","into","into_original","new","orig_slice","orig_slice","orig_slice_c","original","refresh_chars","replace_char","replace_char_iter","replace_own","replace_ref","reset","start_build","swap_original","to_curr_byte_idx","to_orig","to_orig","to_orig_byte_idx","to_orig_char_idx","to_owned","try_from","try_from","try_into","try_into","type_id","type_id","with_editor","BoxType","InitFnType","InvalidDataFormat","Io","Libloading","PluginCategory","PluginError","SerdeError","borrow","borrow_mut","bundled_impl","configurations","connect_cost","do_setup","dso","fmt","fmt","from","from","from","from","input_text","into","oov","path_rewrite","source","to_string","try_from","try_into","type_id","message","source","EditConnectionCostPlugin","bundled_impl","configurations","do_setup","edit","set_up","InputTextPlugin","bundled_impl","configurations","default_input_text","do_setup","rewrite","rewrite_impl","set_up","uses_chars","DefaultInputTextPlugin","borrow","borrow_mut","default","from","into","rewrite_impl","set_up","try_from","try_into","type_id","uses_chars","OovProviderPlugin","bundled_impl","configurations","do_setup","mecab_oov","provide_oov","regex_oov","set_up","simple_oov","MeCabOovPlugin","borrow","borrow_mut","default","from","into","provide_oov","set_up","try_from","try_into","type_id","BoundaryMode","Relaxed","Strict","borrow","borrow_mut","clone","clone_into","default","deserialize","eq","equivalent","equivalent","equivalent","fmt","from","into","to_owned","try_from","try_into","type_id","SimpleOovPlugin","borrow","borrow_mut","default","from","into","provide_oov","set_up","try_from","try_into","type_id","PathRewritePlugin","bundled_impl","configurations","do_setup","join_katakana_oov","join_numeric","rewrite","set_up","JoinKatakanaOovPlugin","borrow","borrow_mut","default","from","into","rewrite","set_up","try_from","try_into","type_id","JoinNumericPlugin","borrow","borrow_mut","default","from","into","rewrite","set_up","try_from","try_into","type_id","PosMatcher","borrow","borrow_mut","clone","clone_into","difference","entries","from","intersection","into","matches_id","new","num_entries","to_owned","try_from","try_into","type_id","union","Mode","Morpheme","MorphemeList","SudachiError","SudachiResult","NonBreakChecker","SentenceDetector","borrow","borrow","borrow_mut","borrow_mut","bos","from","from","get_eos","into","into","new","new","try_from","try_from","try_into","try_into","type_id","type_id","with_limit","SentenceIter","SentenceSplitter","SplitSentences","borrow","borrow","borrow_mut","borrow_mut","from","from","into","into","into_iter","multiunzip","new","next","split","split","try_from","try_from","try_into","try_into","type_id","type_id","with_checker","with_limit"],"q":[[0,"sudachi"],[11,"sudachi::analysis"],[63,"sudachi::analysis::created"],[107,"sudachi::analysis::lattice"],[124,"sudachi::analysis::mlist"],[161,"sudachi::analysis::morpheme"],[189,"sudachi::analysis::node"],[246,"sudachi::analysis::stateful_tokenizer"],[265,"sudachi::analysis::stateless_tokenizer"],[282,"sudachi::config"],[382,"sudachi::dic"],[426,"sudachi::dic::build"],[473,"sudachi::dic::build::error"],[521,"sudachi::dic::build::error::BuildFailure"],[528,"sudachi::dic::build::report"],[540,"sudachi::dic::category_type"],[618,"sudachi::dic::character_category"],[665,"sudachi::dic::connect"],[678,"sudachi::dic::dictionary"],[695,"sudachi::dic::grammar"],[718,"sudachi::dic::header"],[820,"sudachi::dic::lexicon"],[856,"sudachi::dic::lexicon::trie"],[897,"sudachi::dic::lexicon::word_id_table"],[918,"sudachi::dic::lexicon::word_infos"],[978,"sudachi::dic::lexicon::word_params"],[992,"sudachi::dic::lexicon_set"],[1026,"sudachi::dic::read"],[1031,"sudachi::dic::storage"],[1055,"sudachi::dic::subset"],[1123,"sudachi::dic::word_id"],[1160,"sudachi::error"],[1229,"sudachi::error::SudachiError"],[1233,"sudachi::input_text"],[1294,"sudachi::plugin"],[1324,"sudachi::plugin::PluginError"],[1326,"sudachi::plugin::connect_cost"],[1332,"sudachi::plugin::input_text"],[1341,"sudachi::plugin::input_text::default_input_text"],[1353,"sudachi::plugin::oov"],[1362,"sudachi::plugin::oov::mecab_oov"],[1373,"sudachi::plugin::oov::regex_oov"],[1393,"sudachi::plugin::oov::simple_oov"],[1404,"sudachi::plugin::path_rewrite"],[1412,"sudachi::plugin::path_rewrite::join_katakana_oov"],[1423,"sudachi::plugin::path_rewrite::join_numeric"],[1434,"sudachi::pos"],[1452,"sudachi::prelude"],[1457,"sudachi::sentence_detector"],[1478,"sudachi::sentence_splitter"],[1503,"core::fmt"],[1504,"core::fmt"],[1505,"alloc::string"],[1506,"core::any"],[1507,"core::convert"],[1508,"core::marker"],[1509,"std::io"],[1510,"alloc::vec"],[1511,"core::clone"],[1512,"core::option"],[1513,"core::cell"],[1514,"core::ops::range"],[1515,"core::ops::deref"],[1516,"alloc::boxed"],[1517,"std::path"],[1518,"std::path"],[1519,"std::io::error"],[1520,"serde_json::error"],[1521,"core::error"],[1522,"std::time"],[1523,"core::time"],[1524,"core::iter::traits::collect"],[1525,"core::hash"],[1526,"bitflags::iter"],[1527,"bitflags::iter"],[1528,"core::cmp"],[1529,"nom::error"],[1530,"core::cmp"],[1531,"alloc::string"],[1532,"nom::internal"],[1533,"core::ops::function"],[1534,"serde_json::value"],[1535,"libloading::error"]],"d":["","","","","","","","","","","Create an entry point into sudachi DSO plugin","Short","Middle (similar to “word”)","Named Entity","","Unit to split text","","Able to tokenize Japanese text","","","","","","","","","","","","","","","","","","","","Returns the argument unchanged.","Returns the argument unchanged.","","Calls U::from(self).","Calls U::from(self).","","","","","","","","","","","","","","Break text into Morphemes","","","","","","","","Bitset which represents that a word of a specified length …","","Maximum supported length of the word","","","","","","","","","","","","","","","","","","","","","","","","","","Returns the argument unchanged.","Returns the argument unchanged.","","Calls U::from(self).","Calls U::from(self).","","","","","","","","","","","","Lattice which is constructed for performing the Viterbi …","","","Find EOS node – finish the lattice construction","Find the path with the minimal cost through the lattice to …","","","Fill the path with the minimum cost (indices only). …","Returns the argument unchanged.","Checks if there exist at least one at the word end boundary","Insert a single node in the lattice, founding the path to …","Calls U::from(self).","Lookup a node for the index","Prepare lattice for the next analysis of a sentence with …","","","","Iterates over morpheme list","","","","","","Clears morphemes from analysis result","","","","Returns an empty morpheme list","","Returns the argument unchanged.","Returns the argument unchanged.","Creates MorphemeList from components","","Gets the whole cost of the path","Calls U::from(self).","Calls U::from(self).","","","","","","","","","Returns a new morpheme list splitting the morpheme with a …","Splits morphemes and writes them into the resulting list …","","","","","","","","","A morpheme (basic semantic unit of language)","Returns the begin index in bytes of the morpheme in the …","Returns the codepoint offset of the morpheme begin in the …","","","Returns the dictionary form of morpheme","Returns the dictionary id where the morpheme belongs","Returns the end index in bytes of the morpheme in the …","Returns the codepoint offset of the morpheme begin in the …","","Returns the argument unchanged.","","Returns the index of this morpheme","Calls U::from(self).","Returns if this morpheme is out of vocabulary","Returns the normalized form of morpheme","Returns the part of speech","","Returns the reading form of morpheme.","Returns new morpheme list splitting the morpheme with …","Splits morpheme and writes sub-morphemes into the provided …","Returns a substring of the original text which corresponds …","","Returns total cost from the beginning of the path","","","","Returns the word id of morpheme","","","Accessor trait for the full path cost","Full lattice node, as the result of analysis. All indices …","Accessor trait for right connection id","","","Returns begin offset in bytes of node surface in a sentence","","","","","Returns range in bytes (for easy string slicing)","Utility method for extracting [begin, end) codepoint range.","","","Concatenate the nodes in the range and replace …","Concatenate the nodes in the range and set pos_id.","","","","","Returns end offset in bytes of node surface in a sentence","","Returns the argument unchanged.","Returns the argument unchanged.","Calls U::from(self).","Calls U::from(self).","","","Is true when the word does not come from the dictionary. …","If a node is a special system node like BOS or EOS. Java …","","","","","Returns number of codepoints in the current node","Returns number of splits in a specified mode","","","","","","Split the node with a specified mode using the dictionary …","","","","","","","","","","","","","","","","","Create a new debug stateful tokenizer with the following …","Borrow current dictionary","Get a clone of current dictionary","Perform the actual tokenization so the analysis result …","Returns the argument unchanged.","Calls U::from(self).","Consume the Tokenizer and produce MorphemeList","Create a new non-debug stateful tokenizer","Prepare StatefulTokenizer for the next data. Data must be …","Set debug flag and returns the current one","Set the analysis mode and returns the current one","Analyzer will read only following [WordInfo] field subset","Swap result data with the current analyzer","","","","Provides access to dictionary data","Implementation of a Tokenizer which does not have …","","","","Returns the argument unchanged.","","","Calls U::from(self).","","","","","","","","","Setting data loaded from config file","Struct corresponds with raw config json file. You must use …","Sudachi Error","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","Resolves a possibly relative path with regards to all …","","","","","","","","","","","","","","","","","","","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).","Creates a minimal config with the provided resource …","","","","","Return required InfoSubset for the current projection type","","","","","","","","","","","","","","","","","","","","","","","","","","","","Sets the system dictionary to the provided path","A single system or user dictionary","A dictionary consists of one system_dict and zero or more …","","","","","","","","","","Returns the argument unchanged.","Returns the argument unchanged.","Creates a system dictionary from bytes, and load a …","","","","","","","","Calls U::from(self).","Calls U::from(self).","","","","","","","","","Creates a binary dictionary from bytes","Creates a system binary dictionary from bytes","Creates a user binary dictionary from bytes","","","","","","","","","","","","","","Builds a binary dictionary from csv lexicon and connection …","","","","","","","","","Compile the binary dictionary and write it to the …","","","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","","","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","","","","Creates a new builder for system dictionary","Creates a new builder for user dictionary","","","Read the connection matrix from either a file or an …","Read the csv lexicon from either a file or an in-memory …","","Return dictionary build report","Resolve the dictionary references.","Set the dictionary compile time to the specified time …","Set the dictionary description","","","","","","","","","","Actual specific errors for dictionary compilation","","Dictionary building-process related parent error. Captures …","","","Contains the error value","","","","","","","","","","","","Contains the success value","","","","","","","","","","","","","","","","Returns the argument unchanged.","","Returns the argument unchanged.","Calls U::from(self).","Calls U::from(self).","","","","","","","","","","","","","","","","","","","","","Returns the argument unchanged.","Calls U::from(self).","","","","","","","","All categories at once except NOOOVBOW/2 ","Latin alphabets. ","Cyrillic alphabets. ","A set of categories for a character","The fall back category. ","Greek alphabets. ","Hiragana characters. ","CJKV ideographic characters. ","Kanji numeric characters. ","Katakana characters. ","This character cannot be the beginning of an OOV word ","This and next characters cannot be the beginning of an OOV …","Numerical characters. ","White spaces. ","Symbols. ","User defined category. ","User defined category. ","User defined category. ","User defined category. ","Get a flags value with all known bits set.","The bitwise and (&) of the bits in two flags values.","The bitwise and (&) of the bits in two flags values.","The bitwise or (|) of the bits in two flags values.","The bitwise or (|) of the bits in two flags values.","","Get the underlying bits value.","The bitwise exclusive-or (^) of the bits in two flags …","The bitwise exclusive-or (^) of the bits in two flags …","","","","","The bitwise negation (!) of the bits in a flags value, …","Whether all set bits in a source flags value are also set …","","","The intersection of a source flags value with the …","Get a flags value with all bits unset.","","","","","The bitwise or (|) of the bits in each flags value.","","","","","","Returns the argument unchanged.","Convert from a bits value.","Convert from a bits value exactly.","","Convert from a bits value, unsetting any unknown bits.","The bitwise or (|) of the bits in each flags value.","Get a flags value with the bits of a flag with the given …","","","The bitwise or (|) of the bits in two flags values.","The bitwise and (&) of the bits in two flags values.","Whether any set bits in a source flags value are also set …","Calls U::from(self).","","Whether all known bits in this flags value are set.","Whether all bits in this flags value are unset.","Yield a set of contained flags values.","Yield a set of contained named flags values.","The bitwise negation (!) of the bits in a flags value, …","The intersection of a source flags value with the …","Call insert when value is true or remove when value is …","The intersection of a source flags value with the …","The intersection of a source flags value with the …","The bitwise exclusive-or (^) of the bits in two flags …","","The bitwise exclusive-or (^) of the bits in two flags …","","","","The bitwise or (|) of the bits in two flags values.","","CharacterCategory holds mapping from character to …","Sudachi error","","","","","","","","","","","","","","","","","","","","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Creates a character category from file","","Returns a set of category types which given char has","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","","","","","","","","","","","","","","","","","","","Gets the value of the connection matrix","Returns the argument unchanged.","","Calls U::from(self).","Returns maximum number of left connection ID","Returns maximum number of right connection ID","","","","","","","","Returns the argument unchanged.","Creates a dictionary from the specified configuration …","Creats a dictionary from the specified configuration and …","","Returns grammar with the correct lifetime","","Calls U::from(self).","","Returns lexicon with the correct lifetime","","","","","","","","Dictionary grammar","","","","The mapping from character to character_category_type","","Returns connection cost of nodes","Returns the argument unchanged.","Returns a pos_id of given pos in the grammar","Calls U::from(self).","Merge a another grammar into this grammar","Creates a Grammar from dictionary bytes","Gets POS components for POS ID. Panics if out of bounds.","","","Sets character category","Sets connect cost for a specific pair of ids","","","","","","Dictionary header","Sudachi error","Header version","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","","Returns if this header version has grammar","Returns if this header version has synonym group ids","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Creates new system dictionary header Its version field …","Creates a new header from a dictionary bytes","Set creation time","","","","","","","","","","","","","","","","","","","","","","","","Dictionary lexicon","Result of the Lexicon lookup","The first 4 bits of word_id are used to indicate that from …","","","","","Byte index of the word end","","","","","","Returns the argument unchanged.","Returns the argument unchanged.","Returns WordInfo for given word_id","Returns word_param for given word_id. Params are (left_id, …","Calls U::from(self).","Calls U::from(self).","Returns an iterator of word_id and end of words that …","","","Assign lexicon id to the current Lexicon","","","","","","","","","update word_param cost based on current tokenizer","Id of the returned word","","","","","","","","","","","","","","","","Offset of word end","","","","","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","","","","","","","","","","","","","","","","","Value of Trie, this is not the pointer to WordId, but the …","","","","","","","","Returns the argument unchanged.","Returns the argument unchanged.","Calls U::from(self).","Calls U::from(self).","","","","","","","","","","","WordInfo API.","Internal storage of the WordInfo. It is not accessible by …","","","","","","","","","","","","","","","","","","","","","","","","Returns the argument unchanged.","","Returns the argument unchanged.","","Returns the argument unchanged.","","","","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","","","","","","","","","","","","","","","","","","","","","","","","","","","","Returns the argument unchanged.","","","Calls U::from(self).","","","","","","","","Set of Lexicons","Sudachi error","","","","Add a lexicon to the lexicon list","","","","","","","","","","","Returns the argument unchanged.","Returns the argument unchanged.","Returns WordInfo for given WordId","Returns WordInfo for given WordId. Only fills a requested …","Returns word_param for given word_id","Calls U::from(self).","Calls U::from(self).","Returns if dictionary capacity is full","Returns iterator which yields all words in the dictionary, …","Creates a LexiconSet given a lexicon","","","","","","","","","","","","","","","","","","","","","","","","","Returns the argument unchanged.","Returns the argument unchanged.","Calls U::from(self).","Calls U::from(self).","","","","","","","","","","","","","","","","","","","","","Get a flags value with all known bits set.","The bitwise and (&) of the bits in two flags values.","The bitwise and (&) of the bits in two flags values.","The bitwise or (|) of the bits in two flags values.","The bitwise or (|) of the bits in two flags values.","","Get the underlying bits value.","The bitwise exclusive-or (^) of the bits in two flags …","The bitwise exclusive-or (^) of the bits in two flags …","","","","","The bitwise negation (!) of the bits in a flags value, …","Whether all set bits in a source flags value are also set …","","The intersection of a source flags value with the …","Get a flags value with all bits unset.","","","","","The bitwise or (|) of the bits in each flags value.","","","","","","Returns the argument unchanged.","Convert from a bits value.","","Convert from a bits value exactly.","Convert from a bits value, unsetting any unknown bits.","The bitwise or (|) of the bits in each flags value.","Get a flags value with the bits of a flag with the given …","The bitwise or (|) of the bits in two flags values.","The bitwise and (&) of the bits in two flags values.","Whether any set bits in a source flags value are also set …","Calls U::from(self).","","Whether all known bits in this flags value are set.","Whether all bits in this flags value are unset.","Yield a set of contained flags values.","Yield a set of contained named flags values.","","The bitwise negation (!) of the bits in a flags value, …","The intersection of a source flags value with the …","Call insert when value is true or remove when value is …","The intersection of a source flags value with the …","The intersection of a source flags value with the …","The bitwise exclusive-or (^) of the bits in two flags …","","The bitwise exclusive-or (^) of the bits in two flags …","","","","The bitwise or (|) of the bits in two flags values.","","","","","Dictionary word ID","","","","Creates the WordId with correctness checking","","","","","Extract Dictionary ID","","","","","","","Returns the argument unchanged.","Create WordId from the compressed representation","","Calls U::from(self).","Check if the word is OOV An OOV node can come of OOV …","Checks if the WordId corresponds to a special node","Check if the word comes from the system dictionary","Check if the word comes from the user dictionary","Create WordId from parts","Creates an OOV node for pos_id","","","","","","","Extract Word ID","","","","Contains the error value","Contains the error value","","","","","","","","","","","","","","","","","","Contains the success value","Contains the success value","","","","","","Sudachi error","Custum nom error","","","Failed to parse utf16 string","","","","","","","","","","","Returns the argument unchanged.","","","","","","","","","","","","Returns the argument unchanged.","","Calls U::from(self).","Calls U::from(self).","","","","","","","","","","","","","","InputBuffer - prepares the input data for the analysis","","Provides fast indexed access into the input text","","","","","Finalizes InputBuffer state, making it RO","Whether the byte can start a new word. Supports bytes not …","Character category at char offset","","Number of chars to the right of the offset with the same …","","Common character category inside the range. Indexed by …","","","Distance in chars between the char indexed by index and …","","","","Returns byte offsets of current chars","Returns substring of the current (modified) text by …","","Input: Mod Char Idx","Borrow modified data","Borrow array of current characters","","Returns the argument unchanged.","Returns the argument unchanged.","Creates input from the passed string. Should be used …","Get index of the current byte in original sentence Bytes …","Returns char length to the next can_bow point","Calls U::from(self).","Calls U::from(self).","Return original data as owned, consuming itself ","Creates new InputBuffer","Returns substring of original text by indices from the …","","Input: Mod Char Idx","Borrow original data","Recompute chars from modified string (useful if the …","Replace range with char","Replace range with char, followed by chars from iterator","Replace range with owned String","Replace range with a &str","Resets the input buffer, so it could be used to process …","Moves InputBuffer into RW state, making it possible to …","Swaps original data with the passed location","Mod Char Idx -> Mod Byte Idx","Translate range from current state to original. …","","Mod Char Idx -> Orig Byte Idx","Mod Char Idx -> Orig Char Idx","","","","","","","","Execute a function which can modify the contents of the …","Boxed type of the plugin. Should be Box.","Type of the initialization function. It must take 0 …","","","","A category of Plugins","","","","","Create bundled plugin for plugin name Instead of full name …","Extract plugin configurations from the config","","Perform initial setup. We can’t call set_up of the …","","","","","Returns the argument unchanged.","","","","Calls U::from(self).","","","","","","","","","","Trait of plugin to edit connection cost in the grammar","","","","Edits the grammar","Loads necessary information for the plugin","Trait of plugin to modify the input text before …","","","","","Perform rewrites","Actual implementation of rewriting. Call apply_rewrite …","Loads necessary information for the plugin","Whether the rewrite process uses chars","Provides basic normalization of the input text","","","","Returns the argument unchanged.","Calls U::from(self).","","","","","","","Trait of plugin to provide oov node during tokenization","","","","","Generate a list of oov nodes offset - char idx","","Loads necessary information for the plugin","","provides MeCab oov nodes","","","","Returns the argument unchanged.","Calls U::from(self).","","","","","","","","","","","","","","","","","","","","Returns the argument unchanged.","Calls U::from(self).","","","","","Provides a OOV node with single character if no words …","","","","Returns the argument unchanged.","Calls U::from(self).","","","","","","Trait of plugin to rewrite the path from lattice","","","","","","Returns a rewritten path","Loads necessary information for the plugin","Concatenates katakana oov nodes into one","","","","Returns the argument unchanged.","Calls U::from(self).","","","","","","Concatenates numeric nodes as one","","","","Returns the argument unchanged.","Calls U::from(self).","","","","","","","","","","","","","Returns the argument unchanged.","","Calls U::from(self).","","","","","","","","","","","","","","A checker for words that cross boundaries","A sentence boundary detector","","","","","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the byte index of the detected end of the sentence.","Calls U::from(self).","Calls U::from(self).","","","","","","","","","","","","","","","","","Returns the argument unchanged.","Returns the argument unchanged.","Calls U::from(self).","Calls U::from(self).","","","","","","","","","","","","","",""],"i":[0,0,0,0,0,0,0,0,0,0,0,3,3,3,133,0,0,0,1,1,3,1,3,1,3,1,3,1,0,1,3,3,3,3,1,3,3,1,3,3,1,3,0,1,0,0,1,0,1,1,0,0,1,3,3,133,1,3,1,3,1,3,1,0,0,17,20,20,20,17,17,17,20,17,20,17,20,17,20,17,17,17,20,17,17,17,20,20,20,17,20,17,20,17,17,20,17,17,17,17,20,17,20,17,20,17,20,0,22,22,22,22,22,22,22,22,22,22,22,22,22,22,22,22,0,0,14,36,14,36,14,14,14,14,14,14,14,36,14,14,14,14,36,36,14,14,14,36,14,36,36,14,14,14,14,14,36,14,36,14,36,0,35,35,35,35,35,35,35,35,35,35,35,35,35,35,35,35,35,35,35,35,35,35,35,35,35,35,35,0,0,0,0,0,134,33,33,43,33,43,33,33,134,33,33,0,0,134,33,134,33,33,33,43,33,43,33,43,135,134,134,134,33,33,43,134,33,136,33,33,33,43,33,33,33,135,33,43,33,43,33,43,33,134,33,33,0,31,31,31,31,31,31,31,31,31,31,31,31,31,31,31,31,31,31,0,0,44,44,44,44,30,30,44,30,44,30,30,44,44,44,44,0,0,0,52,52,54,54,54,54,52,52,52,54,52,54,52,0,54,52,51,50,54,52,51,50,50,51,52,51,50,52,51,50,51,51,52,51,0,0,52,50,50,52,52,52,52,50,54,54,52,51,50,54,54,54,52,51,50,50,50,50,51,54,52,51,50,51,51,51,51,51,52,51,51,51,50,50,54,50,51,52,51,50,54,54,52,52,51,50,54,52,51,50,54,52,51,50,50,51,51,0,0,62,63,62,63,0,0,0,0,0,62,63,62,0,62,62,63,0,63,62,62,63,0,62,63,0,62,62,62,0,63,63,63,0,0,63,62,63,62,63,62,63,0,0,65,0,0,65,0,65,66,64,65,66,64,64,67,65,0,65,66,64,66,66,65,66,64,66,67,65,64,64,66,66,64,64,0,64,64,64,64,65,66,64,65,66,64,65,66,64,0,71,0,0,71,137,71,71,71,71,71,71,71,71,71,71,71,137,71,71,71,71,71,70,71,70,71,70,70,70,70,71,71,70,71,71,70,71,70,71,70,71,70,71,70,71,70,71,138,139,138,139,139,140,140,0,68,68,68,68,68,68,68,68,68,68,68,73,73,73,0,73,73,73,73,73,73,73,73,73,73,73,73,73,73,73,73,73,73,73,73,73,73,73,73,73,73,73,73,73,73,73,73,73,73,73,73,73,73,73,73,73,73,73,73,73,73,73,73,73,73,73,73,73,73,73,73,73,73,73,73,73,73,73,73,73,73,73,73,73,73,73,73,73,73,0,0,0,79,79,79,79,82,79,78,82,79,78,78,78,78,79,79,79,79,79,79,78,82,79,78,78,78,78,82,79,78,82,78,82,82,78,79,82,79,78,82,79,78,82,79,78,0,23,23,23,23,23,23,23,23,23,23,23,23,0,83,83,83,83,83,83,83,83,83,83,83,83,83,83,83,83,26,26,0,26,26,26,26,26,26,26,26,26,26,26,26,26,26,26,26,26,26,26,26,90,0,0,0,90,90,90,89,86,0,86,0,87,88,87,88,88,90,86,87,88,89,90,86,87,88,89,86,87,88,89,86,87,88,89,89,89,90,86,87,88,89,90,90,90,86,86,86,87,87,87,88,88,88,89,89,89,90,90,86,87,88,89,90,86,87,88,89,86,89,89,90,86,87,88,89,89,89,89,86,87,88,89,90,86,90,86,87,88,89,90,86,87,88,89,90,86,87,88,89,89,89,0,0,0,93,92,93,92,92,92,92,92,92,92,93,92,93,93,93,92,93,92,93,93,93,0,93,92,93,92,93,92,93,92,0,0,0,0,0,0,96,97,95,96,97,95,95,95,96,95,95,95,95,95,95,96,97,95,96,97,95,97,96,95,96,97,95,96,96,97,95,96,97,95,96,97,95,95,0,0,98,99,98,99,98,98,99,98,99,99,98,99,98,98,99,98,99,98,99,0,0,0,39,100,39,100,101,100,39,39,101,100,39,100,39,100,39,100,39,39,100,39,100,100,101,100,100,39,39,101,39,100,101,100,39,101,39,100,39,100,39,100,39,100,39,100,100,39,101,100,39,101,100,39,101,100,39,39,100,0,102,102,102,102,102,102,102,102,102,102,102,102,102,0,0,103,103,103,27,27,103,27,103,103,103,103,103,103,103,27,103,27,27,27,27,103,27,27,27,27,103,27,103,27,103,27,103,0,0,0,0,0,105,105,105,0,0,84,105,105,84,105,84,105,84,105,84,84,84,84,105,84,105,84,105,84,34,34,0,34,34,34,34,34,34,34,34,34,34,34,34,34,34,34,34,34,34,34,34,34,34,34,34,34,34,34,34,34,34,34,34,34,34,34,34,34,34,34,34,34,34,34,34,34,34,34,34,34,34,34,34,34,34,34,34,34,34,34,34,34,34,34,34,34,12,12,12,12,0,12,12,12,12,12,12,12,12,12,12,12,12,12,12,12,12,12,12,12,12,12,12,12,12,12,12,12,12,12,12,12,12,110,110,110,15,104,110,110,110,110,110,110,110,110,110,110,110,110,110,110,110,108,110,15,104,108,110,110,110,110,0,0,0,0,108,108,110,108,110,108,108,110,110,108,110,110,110,110,110,110,110,110,110,110,110,110,110,108,108,110,108,110,110,110,108,110,108,110,108,110,141,142,141,142,0,0,0,117,25,117,25,25,25,143,25,143,25,143,25,25,143,25,25,25,25,143,25,25,25,25,25,117,25,25,25,25,117,25,25,25,143,25,25,25,25,117,117,117,117,25,25,25,25,143,25,25,25,25,117,25,117,25,117,25,25,144,144,113,113,113,0,0,113,113,113,144,144,0,144,0,113,113,113,113,113,113,0,113,0,0,113,113,113,113,113,145,145,0,146,146,146,146,146,0,46,46,0,46,46,46,46,46,0,121,121,121,121,121,121,121,121,121,121,121,0,48,48,48,0,48,0,48,0,0,122,122,122,122,122,122,122,122,122,122,0,123,123,123,123,123,123,123,123,123,123,123,123,123,123,123,123,123,123,123,0,124,124,124,124,124,124,124,124,124,124,0,49,49,49,0,0,49,49,0,125,125,125,125,125,125,125,125,125,125,0,126,126,126,126,126,126,126,126,126,126,0,127,127,127,127,127,127,127,127,127,127,127,127,127,127,127,127,127,0,0,0,0,0,0,0,129,128,129,128,129,129,128,128,129,128,129,128,129,128,129,128,129,128,128,0,0,0,132,131,132,131,132,131,132,131,132,132,131,132,147,131,132,131,132,131,132,131,131,131],"f":[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,[1,2],[-1,-2,[],[]],[-1,-2,[],[]],[-1,-2,[],[]],[-1,-2,[],[]],[1,1],[3,3],[[-1,-2],4,[],[]],[[-1,-2],4,[],[]],[1,5],0,[1,2],[[3,3],6],[[-1,-2],6,[],[]],[[-1,-2],6,[],[]],[[-1,-2],6,[],[]],[[1,7],8],[[3,7],8],[[3,7],8],[-1,-1,[]],[-1,-1,[]],[9,[[10,[3]]]],[-1,-2,[],[]],[-1,-2,[],[]],0,[1,11],0,0,[[11,11,11,11,5,12],1],0,[1,11],[[1,11,11],4],0,0,[-1,-2,[],[]],[-1,-2,[],[]],[-1,13,[]],[[-1,9,3,6],[[15,[14]]],[]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,16,[]],[-1,16,[]],[1,12],0,0,0,0,0,0,[[17,17],17],[[17,-1],17,[[19,[18]]]],[-1,-2,[],[]],[-1,-2,[],[]],[-1,-2,[],[]],[-1,-2,[],[]],[17,17],[20,20],[[-1,-2],4,[],[]],[[-1,-2],4,[],[]],[[],17],[[],17],[[17,17],6],[[20,20],6],[[-1,-2],6,[],[]],[[-1,-2],6,[],[]],[[-1,-2],6,[],[]],[[-1,-2],6,[],[]],[[-1,-2],6,[],[]],[[-1,-2],6,[],[]],[[17,7],8],[[20,7],8],[-1,-1,[]],[-1,-1,[]],[[17,-1],20,[[19,[18]],21]],[-1,-2,[],[]],[-1,-2,[],[]],[17,6],[17,6],[-1,17,[[19,[18]]]],[-1,-2,[],[]],[-1,-2,[],[]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,16,[]],[-1,16,[]],0,[-1,-2,[],[]],[-1,-2,[],[]],[[22,23],[[15,[4]]]],[[22,1,23],[[4,[0,24]]]],[[],22],[[22,25,26,27,-1],[[15,[4]]],28],[[22,[29,[0]]],4],[-1,-1,[]],[[22,2],6],[[22,1,23],24],[-1,-2,[],[]],0,[[22,2],4],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,16,[]],0,0,[-1,-2,[],[]],[-1,-2,[],[]],[-1,-2,[],[]],[-1,-2,[],[]],[[[14,[-1]]],4,30],[[[14,[-1]],[31,[-2]]],[[15,[4]]],30,30],[[[14,[-1]],2,2,[14,[-1]]],4,30],[[[14,[-1]]],-1,30],[-1,[[14,[-1]]],30],[[[14,[-1]]],[[14,[-1]]],[30,32]],[-1,-1,[]],[-1,-1,[]],[[-1,25,[29,[33]],34],[[14,[-1]]],30],[[[14,[-1]],2],[[35,[-1]]],30],[[[14,[-1]]],24,30],[-1,-2,[],[]],[-1,-2,[],[]],[-1,-2,[],[]],[[[14,[-1]]],6,30],[[[14,[-1]]],[[36,[-1]]],30],[[[14,[-1]]],2,30],[[[36,[-1]]],2,30],[[[14,[-1]],9,34],[[15,[2]]],30],[[[36,[-1]]],37,30],[[[36,[-1]]],[[4,[2,[37,[2]]]]],30],[[[14,[-1]],3,2],[[15,[[14,[-1]]]]],[30,32]],[[[14,[-1]],3,2,[14,[-1]]],[[15,[6]]],30],[[[14,[-1]]],34,30],[[[14,[-1]]],[[38,[9]]],30],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,16,[]],[-1,16,[]],0,[[[35,[-1]]],2,30],[[[35,[-1]]],2,30],[-1,-2,[],[]],[-1,-2,[],[]],[[[35,[-1]]],9,30],[[[35,[-1]]],24,30],[[[35,[-1]]],2,30],[[[35,[-1]]],2,30],[[[35,[-1]],7],8,30],[-1,-1,[]],[[[35,[-1]]],39,30],[[[35,[-1]]],2,30],[-1,-2,[],[]],[[[35,[-1]]],6,30],[[[35,[-1]]],9,30],[[[35,[-1]]],[[40,[13]]],30],[[[35,[-1]]],11,30],[[[35,[-1]]],9,30],[[[35,[-1]],3],[[15,[[14,[-1]]]]],[30,32]],[[[35,[-1]],3,[14,[-1]]],[[15,[6]]],30],[[[35,[-1]]],[[38,[9]]],30],[[[35,[-1]]],[[40,[41]]],30],[[[35,[-1]]],24,30],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,16,[]],[[[35,[-1]]],12,30],0,0,0,0,0,[-1,2,[]],[33,2],[33,2],[-1,-2,[],[]],[-1,-2,[],[]],[-1,-2,[],[]],[-1,-2,[],[]],[33,[[42,[2]]]],[-1,[[42,[2]]],[]],[33,33],[[-1,-2],4,[],[]],[[[29,[33]],2,2,[37,[13]]],[[15,[[29,[33]]]]]],[[[29,[33]],2,2,11],[[15,[[29,[33]]]]]],[-1,5,[]],[33,5],[-1,2,[]],[33,2],[33,2],[[33,7],8],[-1,-1,[]],[-1,-1,[]],[-1,-2,[],[]],[-1,-2,[],[]],[-1,-2,[],[]],[-1,6,[]],[-1,6,[]],[-1,6,[]],[-1,11,[]],[33,11],[[1,24,11,11,39],33],[43,37],[-1,2,[]],[[33,3],2],[-1,11,[]],[33,11],[[33,11,11],4],[[33,11,11],4],[43,[[4,[2,[37,[2]]]]]],[[33,3,27,34,25],43],[-1,-2,[],[]],[-1,13,[]],[-1,24,[]],[33,24],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,16,[]],[-1,16,[]],[-1,12,[]],[33,12],[33,39],0,[-1,-2,[],[]],[-1,-2,[],[]],[[-1,6,3],[[31,[-1]]],30],[[[31,[-1]]],-1,30],[[[31,[-1]]],-1,[30,32]],[[[31,[-1]]],[[15,[4]]],30],[-1,-1,[]],[-1,-2,[],[]],[[[31,[-1]]],[[15,[[14,[-1]]]]],30],[[-1,3],[[31,[-1]]],30],[[[31,[-1]]],13,30],[[[31,[-1]],6],6,30],[[[31,[-1]],3],3,30],[[[31,[-1]],34],34,30],[[[31,[-1]],25,[29,[33]],34],4,30],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,16,[]],0,0,[[[44,[-1]]],[],45],[-1,-2,[],[]],[-1,-2,[],[]],[-1,-1,[]],[-1,26,[]],[-1,[[40,[[47,[46]]]]],[]],[-1,-2,[],[]],[-1,27,[]],[-1,[[44,[-1]]],30],[-1,[[40,[[47,[48]]]]],[]],[-1,[[40,[[47,[49]]]]],[]],[[[44,[-1]],9,3,6],[[15,[14]]],[30,32]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,16,[]],0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,[-1,-2,[],[]],[-1,-2,[],[]],[-1,-2,[],[]],[-1,-2,[],[]],[-1,-2,[],[]],[-1,-2,[],[]],[-1,-2,[],[]],[-1,-2,[],[]],[50,51],0,[52,52],[51,51],[50,50],[[-1,-2],4,[],[]],[[-1,-2],4,[],[]],[[-1,-2],4,[],[]],[[51,-1],[[10,[53,54]]],[[56,[55]],[19,[53]]]],0,[[],52],[[],51],[[],53],[[],53],[-1,[[10,[52]]],57],[-1,[[10,[50]]],57],[[],50],[[52,52],6],[[-1,-2],6,[],[]],[[-1,-2],6,[],[]],[[-1,-2],6,[],[]],[[50,50],50],[[54,7],8],[[54,7],8],[[52,7],8],[[51,7],8],[[50,7],8],[-1,-1,[]],[58,54],[59,54],[-1,-1,[]],[-1,-1,[]],[-1,-1,[]],[[[40,[60]]],[[10,[50,54]]]],[55,[[10,[50,54]]]],[[[37,[55]]],[[10,[50,54]]]],0,[-1,-2,[],[]],[-1,-2,[],[]],[-1,-2,[],[]],[-1,-2,[],[]],[-1,51,[[19,[53]]]],[[[37,[53]],[37,[53]],[37,[53]]],[[10,[51,54]]]],0,0,0,[52,34],[[51,13],[[29,[13]]]],[51,[[10,[53,54]]]],[51,[[10,[[29,[53]],54]]]],[[50,-1],50,[[19,[53]]]],[[50,-1],50,[[19,[53]]]],[54,[[37,[61]]]],[[50,-1],50,[[19,[53]]]],0,[-1,-2,[],[]],[-1,-2,[],[]],[-1,-2,[],[]],[-1,13,[]],[-1,[[10,[-2]]],[],[]],[9,[[10,[52]]]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,16,[]],[-1,16,[]],[-1,16,[]],[-1,16,[]],[[50,-1],50,[[19,[53]]]],0,[[51,-1],51,[[19,[53]]]],0,0,[-1,-2,[],[]],[-1,-2,[],[]],[-1,-2,[],[]],[-1,-2,[],[]],0,0,0,0,0,[-1,-1,[]],[-1,-1,[]],[[[40,[60]],55],[[15,[62]]]],0,[62,26],0,0,0,0,[62,[[40,[[47,[46]]]]]],[-1,-2,[],[]],[-1,-2,[],[]],0,[62,27],0,0,0,[62,[[40,[[47,[48]]]]]],[62,[[40,[[47,[49]]]]]],0,[[[40,[60]]],[[15,[63]]]],[[[40,[60]]],[[15,[63]]]],[[[40,[60]]],[[15,[63]]]],0,0,[63,[[37,[62]]]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,16,[]],[-1,16,[]],0,0,0,0,0,0,0,[-1,-2,[],[]],[-1,-2,[],[]],[-1,-2,[],[]],[-1,-2,[],[]],[-1,-2,[],[]],[-1,-2,[],[]],[[[64,[-1]],-2],[[15,[4]]],30,28],[-1,65,[]],[65,65],0,[-1,-1,[]],[-1,-1,[]],[-1,-1,[]],[66,26],[66,[[40,[[47,[46]]]]]],[-1,-2,[],[]],[-1,-2,[],[]],[-1,-2,[],[]],[66,27],[-1,13,[]],[65,13],[[],[[64,[66]]]],[-1,[[64,[-1]]],30],[66,[[40,[[47,[48]]]]]],[66,[[40,[[47,[49]]]]]],[[[64,[-1]],-2],[[15,[4]]],30,67],[[[64,[-1]],-2],[[15,[2]]],30,67],0,[[[64,[-1]]],[[40,[68]]],30],[[[64,[-1]]],[[15,[2]]],30],[[[64,[-1]],-2],69,30,[[19,[69]]]],[[[64,[-1]],-2],4,30,[[19,[13]]]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,16,[]],[-1,16,[]],[-1,16,[]],0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,[-1,-2,[],[]],[-1,-2,[],[]],[-1,-2,[],[]],[-1,-2,[],[]],0,0,[[70,7],8],[[70,7],8],[[71,7],8],[[71,7],8],[-1,-1,[]],[58,71],[-1,-1,[]],[-1,-2,[],[]],[-1,-2,[],[]],0,[71,[[37,[61]]]],[-1,13,[]],[-1,13,[]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,16,[]],[-1,16,[]],0,0,0,0,0,0,0,0,[-1,-2,[],[]],[-1,-2,[],[]],[-1,-1,[]],[-1,-2,[],[]],[68,6],[68,9],[68,2],[68,72],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,16,[]],0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,[[],73],[[73,73],73],[[73,73],4],[[73,73],73],[[73,73],4],[73,41],[73,41],[[73,73],73],[[73,73],4],[-1,-2,[],[]],[-1,-2,[],[]],[73,73],[[-1,-2],4,[],[]],[73,73],[[73,73],6],[73,41],[[],73],[[73,73],73],[[],73],[[73,73],6],[[-1,-2],6,[],[]],[[-1,-2],6,[],[]],[[-1,-2],6,[],[]],[[73,-1],4,74],[[73,7],8],[[73,7],8],[[73,7],8],[[73,7],8],[[73,7],8],[-1,-1,[]],[41,[[37,[73]]]],[41,73],[41,73],[41,73],[-1,73,74],[9,[[37,[73]]]],[9,[[10,[73]]]],[[73,-1],4,75],[[73,73],4],[[73,73],73],[[73,73],6],[-1,-2,[],[]],[73],[73,6],[73,6],[73,[[76,[73]]]],[73,[[77,[73]]]],[73,73],[[73,73],4],[[73,73,6],4],[[73,73],73],[[73,73],4],[[73,73],73],[-1,-2,[],[]],[[73,73],4],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,16,[]],[[73,73],73],0,0,0,0,0,0,0,[-1,-2,[],[]],[-1,-2,[],[]],[-1,-2,[],[]],[-1,-2,[],[]],[-1,-2,[],[]],[-1,-2,[],[]],[78,78],[[-1,-2],4,[],[]],[[],78],[[79,79],6],[[-1,-2],6,[],[]],[[-1,-2],6,[],[]],[[-1,-2],6,[],[]],[[79,7],8],[[79,7],8],[[78,7],8],[-1,-1,[]],[-1,-1,[]],[-1,-1,[]],[55,[[15,[78]]]],[-1,[[15,[78]]],80],[[78,81],73],[-1,-2,[],[]],[-1,-2,[],[]],[-1,-2,[],[]],[-1,-2,[],[]],[78,82],[-1,[[4,[-2,-3]]],[],[],[]],[82,37],[-1,-2,[],[]],[-1,13,[]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,16,[]],[-1,16,[]],[-1,16,[]],0,[-1,-2,[],[]],[-1,-2,[],[]],[[23,11,11],5],[-1,-1,[]],[[[40,[60]],2,2,2],[[15,[23]]]],[-1,-2,[],[]],[23,2],[23,2],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,16,[]],[[23,11,11,5],4],0,[-1,-2,[],[]],[-1,-2,[],[]],[-1,-1,[]],[51,[[15,[83]]]],[[51,84],[[15,[83]]]],[83,26],[83,26],[83,[[40,[[47,[46]]]]]],[-1,-2,[],[]],[83,27],[83,27],[83,[[40,[[47,[48]]]]]],[83,[[40,[[47,[49]]]]]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,16,[]],0,0,0,0,[-1,-2,[],[]],[-1,-2,[],[]],0,[26,23],[[26,5,5],5],[-1,-1,[]],[[26,[40,[-1]]],[[37,[11]]],[[56,[9]]]],[-1,-2,[],[]],[[26,26],4],[[[40,[60]],2],[[15,[26]]]],[[26,11],[[40,[13]]]],0,[[26,[40,[-1]]],[[15,[11]]],[[56,[9]],85]],[[26,78],4],[[26,5,5,5],4],0,[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,16,[]],0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,[-1,-2,[],[]],[-1,-2,[],[]],[-1,-2,[],[]],[-1,-2,[],[]],[-1,-2,[],[]],[-1,-2,[],[]],[-1,-2,[],[]],[-1,-2,[],[]],[-1,-2,[],[]],[-1,-2,[],[]],[86,86],[87,87],[88,88],[89,89],[[-1,-2],4,[],[]],[[-1,-2],4,[],[]],[[-1,-2],4,[],[]],[[-1,-2],4,[],[]],0,0,[[90,90],6],[[86,86],6],[[87,87],6],[[88,88],6],[[89,89],6],[[-1,-2],6,[],[]],[[-1,-2],6,[],[]],[[-1,-2],6,[],[]],[[-1,-2],6,[],[]],[[-1,-2],6,[],[]],[[-1,-2],6,[],[]],[[-1,-2],6,[],[]],[[-1,-2],6,[],[]],[[-1,-2],6,[],[]],[[-1,-2],6,[],[]],[[-1,-2],6,[],[]],[[-1,-2],6,[],[]],[[-1,-2],6,[],[]],[[-1,-2],6,[],[]],[[-1,-2],6,[],[]],[[90,7],8],[[90,7],8],[[86,7],8],[[87,7],8],[[88,7],8],[[89,7],8],[-1,-1,[]],[-1,-1,[]],[-1,-1,[]],[-1,-1,[]],[-1,-1,[]],[91,[[37,[86]]]],[89,6],[89,6],[-1,-2,[],[]],[-1,-2,[],[]],[-1,-2,[],[]],[-1,-2,[],[]],[-1,-2,[],[]],[[],89],[[[40,[60]]],[[10,[89,90]]]],[[89,69],69],[-1,-2,[],[]],[-1,-2,[],[]],[-1,-2,[],[]],[-1,-2,[],[]],[-1,13,[]],[86,91],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,16,[]],[-1,16,[]],[-1,16,[]],[-1,16,[]],[-1,16,[]],0,[[89,-1],[[15,[2]]],28],0,0,0,[-1,-2,[],[]],[-1,-2,[],[]],[-1,-2,[],[]],[-1,-2,[],[]],0,[[92,92],6],[[-1,-2],6,[],[]],[[-1,-2],6,[],[]],[[-1,-2],6,[],[]],[[92,7],8],[-1,-1,[]],[-1,-1,[]],[[93,41,34],[[15,[39]]]],[[93,41],[[4,[5,5,5]]]],[-1,-2,[],[]],[-1,-2,[],[]],[[93,[40,[60]],2],[[0,[94]]]],[[12,2],92],[[[40,[60]],2,6],[[15,[93]]]],[[93,60],4],[93,41],0,[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,16,[]],[-1,16,[]],[[93,-1],[[15,[4]]],30],0,0,0,0,0,0,0,[-1,-2,[],[]],[-1,-2,[],[]],[-1,-2,[],[]],[-1,-2,[],[]],[-1,-2,[],[]],[-1,-2,[],[]],[95,95],[[-1,-2],4,[],[]],[[96,[40,[60]],2],97],0,[[95,95],6],[[-1,-2],6,[],[]],[[-1,-2],6,[],[]],[[-1,-2],6,[],[]],[[95,7],8],[-1,-1,[]],[-1,-1,[]],[-1,-1,[]],[-1,-2,[],[]],[-1,-2,[],[]],[-1,-2,[],[]],[-1,-2,[],[]],[[[40,[60]],2],96],[[41,2],95],[[[29,[41]]],96],[97,37],[-1,-2,[],[]],[96,2],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,16,[]],[-1,16,[]],[-1,16,[]],0,0,0,[-1,-2,[],[]],[-1,-2,[],[]],[-1,-2,[],[]],[-1,-2,[],[]],[[98,2],99],[-1,-1,[]],[-1,-1,[]],[-1,-2,[],[]],[-1,-2,[],[]],[-1,-2,[],[]],[[[40,[60]],41,2],98],[99,37],[98,2],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,16,[]],[-1,16,[]],0,0,0,[39,[[40,[12]]]],0,[39,[[40,[12]]]],0,[-1,-2,[],[]],[-1,-2,[],[]],[-1,-2,[],[]],[39,100],[-1,-2,[],[]],[-1,-2,[],[]],[-1,-2,[],[]],[100,100],[39,39],[[-1,-2],4,[],[]],[[-1,-2],4,[],[]],[[],100],[[],39],[39,9],0,[39,24],0,[[100,7],8],[-1,-1,[]],[39,100],[-1,-1,[]],[100,39],[-1,-1,[]],[[101,41,34],[[15,[39]]]],[39,2],0,[-1,-2,[],[]],[-1,-2,[],[]],[-1,-2,[],[]],[[[40,[60]],2,41,6],101],[39,9],0,[39,11],0,[39,9],0,[39,9],0,[39,[[40,[41]]]],0,[-1,-2,[],[]],[-1,-2,[],[]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,16,[]],[-1,16,[]],[-1,16,[]],[39,[[40,[12]]]],0,0,[-1,-2,[],[]],[-1,-2,[],[]],[-1,-1,[]],[[102,41],5],[[102,41],[[4,[5,5,5]]]],[-1,-2,[],[]],[[[40,[60]],41,2],102],[[102,41,5],4],[102,41],[102,2],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,16,[]],0,0,0,0,0,[[27,93,2],[[10,[4,103]]]],[-1,-2,[],[]],[-1,-2,[],[]],[-1,-2,[],[]],[-1,-2,[],[]],[[103,103],6],[[-1,-2],6,[],[]],[[-1,-2],6,[],[]],[[-1,-2],6,[],[]],[[103,7],8],[[103,7],8],[-1,-1,[]],[-1,-1,[]],[[27,12],[[15,[39]]]],[[27,12,34],[[15,[39]]]],[[27,12],[[4,[5,5,5]]]],[-1,-2,[],[]],[-1,-2,[],[]],[27,6],[[27,[40,[60]],2],[[0,[94]]]],[[93,2],27],[27,41],[-1,13,[]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,16,[]],[-1,16,[]],[[[40,[60]]],[[104,[[40,[60]],[29,[41]]]]]],[[[40,[60]]],[[104,[[40,[60]],[29,[12]]]]]],[[[40,[60]]],[[104,[[40,[60]],[29,[41]]]]]],[[[40,[60]]],[[104,[[40,[60]],41]]]],[[[40,[60]]],[[104,[[40,[60]],[29,[12]]]]]],0,0,0,0,0,[[84,105],4],[105,[[40,[60]]]],[-1,-2,[],[]],[-1,-2,[],[]],[-1,-2,[],[]],[-1,-2,[],[]],[-1,-1,[]],[-1,-1,[]],[-1,-2,[],[]],[-1,-2,[],[]],[105,84],[84,[[40,[60]]]],[84,[[40,[60]]]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,16,[]],[-1,16,[]],0,0,0,0,0,0,0,0,0,0,0,[[],34],[[34,34],34],[[34,34],4],[[34,34],34],[[34,34],4],[34,41],[34,41],[[34,34],34],[[34,34],4],[-1,-2,[],[]],[-1,-2,[],[]],[34,34],[[-1,-2],4,[],[]],[34,34],[[34,34],6],[[],34],[[34,34],34],[[],34],[[34,34],6],[[-1,-2],6,[],[]],[[-1,-2],6,[],[]],[[-1,-2],6,[],[]],[[34,-1],4,74],[[34,7],8],[[34,7],8],[[34,7],8],[[34,7],8],[[34,7],8],[-1,-1,[]],[41,[[37,[34]]]],[41,34],[41,34],[41,34],[-1,34,74],[9,[[37,[34]]]],[[34,34],4],[[34,34],34],[[34,34],6],[-1,-2,[],[]],[34],[34,6],[34,6],[34,[[76,[34]]]],[34,[[77,[34]]]],[34,34],[34,34],[[34,34],4],[[34,34,6],4],[[34,34],34],[[34,34],4],[[34,34],34],[-1,-2,[],[]],[[34,34],4],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,16,[]],[[34,34],34],0,0,0,0,0,[12,41],[-1,-2,[],[]],[-1,-2,[],[]],[[60,41],[[15,[12]]]],[12,12],[[-1,-2],4,[],[]],[[12,12],106],[[-1,-2],106,[],[]],[12,60],[[12,12],6],[[-1,-2],6,[],[]],[[-1,-2],6,[],[]],[[-1,-2],6,[],[]],[[12,7],8],[[12,7],8],[-1,-1,[]],[41,12],[[12,-1],4,75],[-1,-2,[],[]],[12,6],[12,6],[12,6],[12,6],[[60,41],12],[41,12],[[12,12],[[37,[106]]]],[-1,-2,[],[]],[-1,13,[]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,16,[]],[12,41],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,107,[108,[-1]]],[[108,[-1]]],[]],[-1,-2,[],[]],[-1,-2,[],[]],[-1,-2,[],[]],[-1,-2,[],[]],[[[108,[-1]],[108,[-1]]],6,109],[[110,7],8],[[110,7],8],[[[108,[-1]],7],8,111],[90,110],[-1,-1,[]],[103,110],[59,110],[70,110],[79,110],[112,110],[113,110],[58,110],[114,110],[115,110],[[[116,[[108,[-1]]]]],110,111],[54,110],[-1,-1,[]],[[-1,107],[[108,[-1]]],[]],[-1,-2,[],[]],[-1,-2,[],[]],[110,[[37,[61]]]],[-1,13,[]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,16,[]],[-1,16,[]],[[110,-1],110,[[19,[13]]]],0,0,0,0,0,0,0,[-1,-2,[],[]],[-1,-2,[],[]],[-1,-2,[],[]],[-1,-2,[],[]],[[25,26],[[15,[4]]]],[[25,2],6],[[-1,2],73,[]],[[25,2],73],[[-1,2],2,[]],[[25,2],2],[[-1,[42,[2]]],73,[]],[[25,[42,[2]]],73],[[25,2],2],[[-1,2,2],2,[]],[[25,2,2],2],[25,25],[[-1,-2],4,[],[]],[25,[[40,[2]]]],[[-1,[42,[2]]],9,[]],[[25,[42,[2]]],9],[[25,[42,[2]]],9],[25,9],[25,[[40,[81]]]],[[],25],[-1,-1,[]],[-1,-1,[]],[-1,25,[[56,[9]]]],[[25,2],2],[[25,2],2],[-1,-2,[],[]],[-1,-2,[],[]],[25,13],[[],25],[[-1,[42,[2]]],9,[]],[[25,[42,[2]]],9],[[25,[42,[2]]],9],[25,9],[25,4],[[117,[42,[2]],81],4],[[117,[42,[2]],81,-1],4,94],[[117,[42,[2]],13],4],[[117,[42,[2]],9],4],[25,13],[25,[[15,[4]]]],[[25,13],4],[[25,2],2],[[-1,[42,[2]]],[[42,[2]]],[]],[[25,[42,[2]]],[[42,[2]]]],[[25,2],2],[[25,2],2],[-1,-2,[],[]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,16,[]],[-1,16,[]],[[25,-1],[[15,[4]]],118],0,0,0,0,0,0,0,0,[-1,-2,[],[]],[-1,-2,[],[]],[9,37],[51,[[40,[119]]]],0,[[119,51,26],[[15,[4]]]],0,[[113,7],8],[[113,7],8],[120,113],[-1,-1,[]],[58,113],[59,113],0,[-1,-2,[],[]],0,0,[113,[[37,[61]]]],[-1,13,[]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,16,[]],0,0,0,[9,37],[51,[[40,[119]]]],[[119,51,26],[[15,[4]]]],[[-1,26],4,[]],[[-1,119,51,26],[[15,[4]]],[]],0,[9,37],[51,[[40,[119]]]],0,[[119,51,26],[[15,[4]]]],[[-1,25],[[15,[4]]],[]],[[-1,25,117],[[15,[117]]],[]],[[-1,119,51,26],[[15,[4]]],[]],[-1,6,[]],0,[-1,-2,[],[]],[-1,-2,[],[]],[[],121],[-1,-1,[]],[-1,-2,[],[]],[[121,25,117],[[15,[117]]]],[[121,119,51,26],[[15,[4]]]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,16,[]],[121,6],0,[9,37],[51,[[40,[119]]]],[[119,51,26],[[15,[4]]]],0,[[-1,25,2,17,[29,[1]]],[[15,[2]]],[]],0,[[-1,119,51,26],[[15,[4]]],[]],0,0,[-1,-2,[],[]],[-1,-2,[],[]],[[],122],[-1,-1,[]],[-1,-2,[],[]],[[122,25,2,17,[29,[1]]],[[15,[2]]]],[[122,119,51,26],[[15,[4]]]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,16,[]],0,0,0,[-1,-2,[],[]],[-1,-2,[],[]],[123,123],[[-1,-2],4,[],[]],[[],123],[-1,[[10,[123]]],57],[[123,123],6],[[-1,-2],6,[],[]],[[-1,-2],6,[],[]],[[-1,-2],6,[],[]],[[123,7],8],[-1,-1,[]],[-1,-2,[],[]],[-1,-2,[],[]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,16,[]],0,[-1,-2,[],[]],[-1,-2,[],[]],[[],124],[-1,-1,[]],[-1,-2,[],[]],[[124,25,2,17,[29,[1]]],[[15,[2]]]],[[124,119,51,26],[[15,[4]]]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,16,[]],0,[9,37],[51,[[40,[119]]]],[[119,51,26],[[15,[4]]]],0,0,[[-1,25,[29,[33]],22],[[15,[[29,[33]]]]],[]],[[-1,119,51,26],[[15,[4]]],[]],0,[-1,-2,[],[]],[-1,-2,[],[]],[[],125],[-1,-1,[]],[-1,-2,[],[]],[[125,25,[29,[33]],22],[[15,[[29,[33]]]]]],[[125,119,51,26],[[15,[4]]]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,16,[]],0,[-1,-2,[],[]],[-1,-2,[],[]],[[],126],[-1,-1,[]],[-1,-2,[],[]],[[126,25,[29,[33]],22],[[15,[[29,[33]]]]]],[[126,119,51,26],[[15,[4]]]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,16,[]],0,[-1,-2,[],[]],[-1,-2,[],[]],[127,127],[[-1,-2],4,[],[]],[[127,127],127],[127,[[0,[94]]]],[-1,-1,[]],[[127,127],127],[-1,-2,[],[]],[[127,11],6],[-1,127,74],[127,2],[-1,-2,[],[]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,16,[]],[[127,127],127],0,0,0,0,0,0,0,[-1,-2,[],[]],[-1,-2,[],[]],[-1,-2,[],[]],[-1,-2,[],[]],0,[-1,-1,[]],[-1,-1,[]],[[128,9,[37,[129]]],[[15,[130]]]],[-1,-2,[],[]],[-1,-2,[],[]],[27,129],[[],128],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,16,[]],[-1,16,[]],[2,128],0,0,0,[-1,-2,[],[]],[-1,-2,[],[]],[-1,-2,[],[]],[-1,-2,[],[]],[-1,-1,[]],[-1,-1,[]],[-1,-2,[],[]],[-1,-2,[],[]],[-1,-2,[],[]],[-1,[[4,[-2,-3]]],[],[],[]],[[],131],[132,37],[[-1,9],132,[]],[[131,9],132],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,16,[]],[-1,16,[]],[[131,27],131],[2,131]],"c":[151,180,1338],"p":[[3,"Node",11],[15,"usize"],[4,"Mode",11],[15,"tuple"],[15,"i16"],[15,"bool"],[3,"Formatter",1503],[6,"Result",1503],[15,"str"],[4,"Result",1504],[15,"u16"],[3,"WordId",1123],[3,"String",1505],[3,"MorphemeList",124],[6,"SudachiResult",1160],[3,"TypeId",1506],[3,"CreatedWords",63],[15,"i64"],[8,"Into",1507],[4,"HasWord",63],[8,"Copy",1508],[3,"Lattice",107],[3,"ConnectionMatrix",665],[15,"i32"],[3,"InputBuffer",1233],[3,"Grammar",695],[3,"LexiconSet",992],[8,"Write",1509],[3,"Vec",1510],[8,"DictionaryAccess",265],[3,"StatefulTokenizer",246],[8,"Clone",1511],[3,"ResultNode",189],[3,"InfoSubset",1055],[3,"Morpheme",161],[3,"MorphemeIter",124],[4,"Option",1512],[3,"Ref",1513],[3,"WordInfo",918],[15,"slice"],[15,"u32"],[3,"Range",1514],[3,"NodeSplitIterator",189],[3,"StatelessTokenizer",265],[8,"Deref",1515],[8,"InputTextPlugin",1332],[3,"Box",1516],[8,"OovProviderPlugin",1353],[8,"PathRewritePlugin",1404],[3,"ConfigBuilder",282],[3,"Config",282],[4,"SurfaceProjection",282],[3,"PathBuf",1517],[4,"ConfigError",282],[3,"Path",1517],[8,"AsRef",1507],[8,"Deserializer",1518],[3,"Error",1519],[3,"Error",1520],[15,"u8"],[8,"Error",1521],[3,"LoadedDictionary",382],[3,"DictionaryLoader",382],[3,"DictBuilder",426],[4,"DataSource",426],[4,"NoDic",426],[8,"AsDataSource",426],[3,"DictPartReport",528],[3,"SystemTime",1522],[3,"DicBuildError",473],[4,"BuildFailure",473],[3,"Duration",1523],[3,"CategoryType",540],[8,"IntoIterator",1524],[8,"Hasher",1525],[3,"Iter",1526],[3,"IterNames",1526],[3,"CharacterCategory",618],[4,"Error",618],[8,"BufRead",1509],[15,"char"],[3,"CharCategoryIter",618],[3,"JapaneseDictionary",678],[3,"SudachiDicData",1031],[8,"ToString",1505],[4,"HeaderVersion",718],[4,"SystemDictVersion",718],[4,"UserDictVersion",718],[3,"Header",718],[4,"HeaderError",718],[15,"u64"],[3,"LexiconEntry",820],[3,"Lexicon",820],[8,"Iterator",1527],[3,"TrieEntry",856],[3,"Trie",856],[3,"TrieEntryIter",856],[3,"WordIdTable",897],[3,"WordIdIter",897],[3,"WordInfoData",918],[3,"WordInfos",918],[3,"WordParams",978],[4,"LexiconSetError",992],[6,"SudachiNomResult",1160],[4,"Storage",1031],[4,"Ordering",1528],[4,"ErrorKind",1529],[4,"SudachiNomError",1160],[8,"PartialEq",1528],[4,"SudachiError",1160],[8,"Debug",1503],[4,"Error",1530],[4,"PluginError",1294],[3,"FromUtf16Error",1505],[3,"ParseIntError",1531],[4,"Err",1532],[3,"InputEditor",1233],[8,"FnOnce",1533],[4,"Value",1534],[4,"Error",1535],[3,"DefaultInputTextPlugin",1341],[3,"MeCabOovPlugin",1362],[4,"BoundaryMode",1373],[3,"SimpleOovPlugin",1393],[3,"JoinKatakanaOovPlugin",1412],[3,"JoinNumericPlugin",1423],[3,"PosMatcher",1434],[3,"SentenceDetector",1457],[3,"NonBreakChecker",1457],[15,"isize"],[3,"SentenceSplitter",1478],[3,"SentenceIter",1478],[8,"Tokenize",11],[8,"LatticeNode",189],[8,"PathCost",189],[8,"RightId",189],[6,"DicWriteResult",473],[13,"InvalidSize",521],[13,"InvalidFieldSize",521],[13,"SplitFormatError",521],[13,"ErrWithContext",1229],[13,"Io",1229],[8,"InputTextIndex",1233],[8,"PluginCategory",1294],[13,"Libloading",1324],[8,"EditConnectionCostPlugin",1326],[8,"SplitSentences",1478]]}\ +"sudachi":{"doc":"Clone of Sudachi, a Japanese morphological analyzer","t":"AAAAAAAAAAONNNQEDILLLLLLLLLLALLLLLLLLLLLLLALAALALLAALLLKLLLLLLLDESNNNLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLDLLLLLLLLLLLLLLLLDDLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLDLLLLLLLLLLLLLLLLLLLLLLLLLLLIDIDIKLLLLLLLLLLFFKLKLLLLLLLLLLLKLLLLLKLLLLLLLKLLLLLLLKLLDLLLLLLLLLLLLLLLLLLIDLLLLKKLKLKKLLLLDDENNNNNNNNNNNNNELLLLLLLLLMLLLLLLLMLLFFLLLLLLLLLLLLLLLLLLLLLLMLLLLLLMMMLLLLLLLLMLLLLLLLLLLLLLLLLLLMLDDLLLLAAAAALLLALMMAMLLLALMAMLLALLLAALLLLLLLAINEDNELLLLLLLKLALLLLLLLLLKLLLLLLLALLLLLLLLLLLLLENDGNNNNNNNNNNNNNNNNNNNLLLLMMLLLLLLLLLMLLLLLLLLLMMMMMMMDLLLLLLLLLLLSSSDSSSSSSSSSSSSSSSLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLDDENNNNLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLDLLLLLLLLLLLLDLLLLLLLLLLLLLLLLSSDSLLMLLLLLLLLMLLLMLLLNDEENNNSNENENNNNNLLLLLLLLLLLLLLLLLLMMLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLMLDDRLLLLMLLLLLLLLLLLLLLLLALLLLLLLMAAADDDLLLLLLLLLMLLLLLLLLLLLLLLLLLLLLLLLLLLLMDDLLLLLLLLLLLLLLLLLLLDDDLMLMLLLLLLLLLLLLLLMLMLLLLLLLLMLLLLLMLMLMLMLMLLLLLLLLLLLLMDLLLLLLLLLLLLLDENNNLLLLLLLLLLLLLLLLLLLLLLLLLLLLLFFFFFNNNEDLLLLLLLLLLLLLLLLLLLSSDSSSSSSSSLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLSSSSDLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLNNNNNNNNNNNNNNNNNNNNNNNNNNNNNEEGGNLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLMMMMDDILLLLLLKLKLKLLKLLLLKLLLLLLLLLLLLLLKLLLLLLLLLLLLKLLLLLLLLLLLQQNNNIENLLKKAKALLLLLLALAALLLLLMMILLLKKILLALLKKLDLLLLLLLLLLLILLLAKAKADLLLLLLLLLLENNLLLLLLLLLLLLLLLLLDLLLLLLLLLLILLLAAKKDLLLLLLLLLLDLLLLLLLLLLDLLLLLLLLLLLLLLLLLCCCCCDDLLLLMLLLLLLLLLLLLLLDDILLLLLLLLLLLLKLLLLLLLLL","n":["analysis","config","dic","error","input_text","plugin","pos","prelude","sentence_detector","sentence_splitter","sudachi_dso_plugin","A","B","C","Dictionary","Mode","Node","Tokenize","begin","borrow","borrow","borrow_mut","borrow_mut","clone","clone","clone_into","clone_into","cost","created","end","eq","equivalent","equivalent","equivalent","fmt","fmt","fmt","from","from","from_str","into","into","lattice","left_id","mlist","morpheme","new","node","right_id","set_range","stateful_tokenizer","stateless_tokenizer","to_owned","to_owned","to_string","tokenize","try_from","try_from","try_into","try_into","type_id","type_id","word_id","CreatedWords","HasWord","MAX_VALUE","Maybe","No","Yes","add","add_word","borrow","borrow","borrow_mut","borrow_mut","clone","clone","clone_into","clone_into","default","empty","eq","eq","equivalent","equivalent","equivalent","equivalent","equivalent","equivalent","fmt","fmt","from","from","has_word","into","into","is_empty","not_empty","single","to_owned","to_owned","try_from","try_from","try_into","try_into","type_id","type_id","Lattice","borrow","borrow_mut","connect_eos","connect_node","default","dump","fill_top_path","from","has_previous_node","insert","into","node","reset","try_from","try_into","type_id","MorphemeIter","MorphemeList","borrow","borrow","borrow_mut","borrow_mut","clear","collect_results","copy_slice","dict","empty","empty_clone","from","from","from_components","get","get_internal_cost","into","into","into_iter","is_empty","iter","len","len","lookup","next","size_hint","split","split_into","subset","surface","try_from","try_from","try_into","try_into","type_id","type_id","Morpheme","begin","begin_c","borrow","borrow_mut","dictionary_form","dictionary_id","end","end_c","fmt","from","get_word_info","index","into","is_oov","normalized_form","part_of_speech","part_of_speech_id","reading_form","split","split_into","surface","synonym_group_ids","total_cost","try_from","try_into","type_id","word_id","LatticeNode","NodeSplitIterator","PathCost","ResultNode","RightId","begin","begin","begin_bytes","borrow","borrow","borrow_mut","borrow_mut","bytes_range","char_range","clone","clone_into","concat_nodes","concat_oov_nodes","cost","cost","end","end","end_bytes","fmt","from","from","into","into","into_iter","is_connected_to_bos","is_oov","is_special_node","left_id","left_id","new","next","num_codepts","num_splits","right_id","right_id","set_bytes_range","set_char_range","size_hint","split","to_owned","to_string","total_cost","total_cost","try_from","try_from","try_into","try_into","type_id","type_id","word_id","word_id","word_info","StatefulTokenizer","borrow","borrow_mut","create","dict","dict_clone","do_tokenize","from","into","into_morpheme_list","new","reset","set_debug","set_mode","set_subset","swap_result","try_from","try_into","type_id","DictionaryAccess","StatelessTokenizer","as_dict","borrow","borrow_mut","from","grammar","input_text_plugins","into","lexicon","new","oov_provider_plugins","path_rewrite_plugins","tokenize","try_from","try_into","type_id","Config","ConfigBuilder","ConfigError","Dictionary","DictionaryAndSurface","FileNotFound","InvalidFormat","Io","MissingArgument","Normalized","NormalizedAndSurface","NormalizedNouns","PathResolution","Reading","SerdeError","Surface","SurfaceProjection","borrow","borrow","borrow","borrow","borrow_mut","borrow_mut","borrow_mut","borrow_mut","build","character_definition_file","clone","clone","clone","clone_into","clone_into","clone_into","complete_path","connection_cost_plugins","default","default","default_config_location","default_resource_dir","deserialize","deserialize","empty","eq","equivalent","equivalent","equivalent","fallback","fmt","fmt","fmt","fmt","fmt","from","from","from","from","from","from","from_bytes","from_file","from_opt_file","input_text_plugins","into","into","into","into","minimal_at","new","oov_provider_plugins","path_rewrite_plugins","projection","required_subset","resolve_paths","resolved_system_dict","resolved_user_dicts","resource_path","root_directory","source","system_dict","system_dict","to_owned","to_owned","to_owned","to_string","try_from","try_from","try_from","try_from","try_from","try_into","try_into","try_into","try_into","type_id","type_id","type_id","type_id","user_dict","user_dicts","with_system_dic","DictionaryLoader","LoadedDictionary","borrow","borrow","borrow_mut","borrow_mut","build","category_type","character_category","connect","dictionary","from","from","from_system_dictionary","grammar","grammar","grammar","grammar","header","header","input_text_plugins","into","into","lexicon","lexicon","lexicon","lexicon_set","lexicon_set","oov_provider_plugins","path_rewrite_plugins","read","read_any_dictionary","read_system_dictionary","read_user_dictionary","storage","subset","to_loaded","try_from","try_from","try_into","try_into","type_id","type_id","word_id","AsDataSource","Data","DataSource","DictBuilder","File","NoDic","borrow","borrow","borrow","borrow_mut","borrow_mut","borrow_mut","compile","convert","convert","error","from","from","from","grammar","input_text_plugins","into","into","into","lexicon","name","name","new_system","new_user","oov_provider_plugins","path_rewrite_plugins","read_conn","read_lexicon","report","report","resolve","set_compile_time","set_description","try_from","try_from","try_from","try_into","try_into","try_into","type_id","type_id","type_id","BuildFailure","CsvError","DicBuildError","DicWriteResult","EmptySurface","Err","InvalidCharLiteral","InvalidConnSize","InvalidFieldSize","InvalidI16Literal","InvalidSize","InvalidSplit","InvalidSplitWordReference","InvalidU32Literal","InvalidWordId","Io","NoRawField","Ok","PosLimitExceeded","SplitFormatError","TrieBuildFailure","UnresolvedSplits","WordIdTableNotBuilt","borrow","borrow","borrow_mut","borrow_mut","cause","file","fmt","fmt","fmt","fmt","from","from","from","into","into","line","source","to_string","to_string","try_from","try_from","try_into","try_into","type_id","type_id","actual","actual","expected","expected","field","field","original","DictPartReport","borrow","borrow_mut","from","into","is_write","part","size","time","try_from","try_into","type_id","ALL","ALPHA","CYRILLIC","CategoryType","DEFAULT","GREEK","HIRAGANA","KANJI","KANJINUMERIC","KATAKANA","NOOOVBOW","NOOOVBOW2","NUMERIC","SPACE","SYMBOL","USER1","USER2","USER3","USER4","all","bitand","bitand_assign","bitor","bitor_assign","bits","bits","bitxor","bitxor_assign","borrow","borrow_mut","clone","clone_into","complement","contains","count","default","difference","empty","eq","equivalent","equivalent","equivalent","extend","fmt","fmt","fmt","fmt","fmt","from","from_bits","from_bits_retain","from_bits_retain","from_bits_truncate","from_iter","from_name","from_str","hash","insert","intersection","intersects","into","into_iter","is_all","is_empty","iter","iter_names","not","remove","set","sub","sub_assign","symmetric_difference","to_owned","toggle","try_from","try_into","type_id","union","CharCategoryIter","CharacterCategory","Error","InvalidCategoryType","InvalidChar","InvalidFormat","MultipleTypeDefinition","borrow","borrow","borrow","borrow_mut","borrow_mut","borrow_mut","clone","clone_into","default","eq","equivalent","equivalent","equivalent","fmt","fmt","fmt","from","from","from","from_file","from_reader","get_category_types","into","into","into","into_iter","iter","multiunzip","next","to_owned","to_string","try_from","try_from","try_from","try_into","try_into","try_into","type_id","type_id","type_id","ConnectionMatrix","borrow","borrow_mut","cost","from","from_offset_size","into","num_left","num_right","try_from","try_into","type_id","update","JapaneseDictionary","borrow","borrow_mut","from","from_cfg","from_cfg_storage","grammar","grammar","input_text_plugins","into","lexicon","lexicon","oov_provider_plugins","path_rewrite_plugins","try_from","try_into","type_id","BOS_PARAMETER","EOS_PARAMETER","Grammar","INHIBITED_CONNECTION","borrow","borrow_mut","character_category","conn_matrix","connect_cost","from","get_part_of_speech_id","into","merge","parse","pos_components","pos_list","register_pos","set_character_category","set_connect_cost","storage_size","try_from","try_into","type_id","CannotParse","Header","HeaderError","HeaderVersion","InvalidSystemDictVersion","InvalidUserDictVersion","InvalidVersion","STORAGE_SIZE","SystemDict","SystemDictVersion","UserDict","UserDictVersion","Version1","Version1","Version2","Version2","Version3","borrow","borrow","borrow","borrow","borrow","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","clone","clone","clone","clone","clone_into","clone_into","clone_into","clone_into","create_time","description","eq","eq","eq","eq","eq","equivalent","equivalent","equivalent","equivalent","equivalent","equivalent","equivalent","equivalent","equivalent","equivalent","equivalent","equivalent","equivalent","equivalent","equivalent","fmt","fmt","fmt","fmt","fmt","fmt","from","from","from","from","from","from_u64","has_grammar","has_synonym_group_ids","into","into","into","into","into","new","parse","set_time","to_owned","to_owned","to_owned","to_owned","to_string","to_u64","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","version","write_to","Lexicon","LexiconEntry","MAX_DICTIONARIES","borrow","borrow","borrow_mut","borrow_mut","end","eq","equivalent","equivalent","equivalent","fmt","from","from","get_word_info","get_word_param","into","into","lookup","new","parse","set_dic_id","size","trie","try_from","try_from","try_into","try_into","type_id","type_id","update_cost","word_id","word_id_table","word_infos","word_params","Trie","TrieEntry","TrieEntryIter","borrow","borrow","borrow","borrow_mut","borrow_mut","borrow_mut","clone","clone_into","common_prefix_iterator","end","eq","equivalent","equivalent","equivalent","fmt","from","from","from","into","into","into","into_iter","new","new","new_owned","next","to_owned","total_size","try_from","try_from","try_from","try_into","try_into","try_into","type_id","type_id","type_id","value","WordIdIter","WordIdTable","borrow","borrow","borrow_mut","borrow_mut","entries","from","from","into","into","into_iter","new","next","storage_size","try_from","try_from","try_into","try_into","type_id","type_id","WordInfo","WordInfoData","WordInfos","a_unit_split","a_unit_split","b_unit_split","b_unit_split","borrow","borrow","borrow","borrow_data","borrow_mut","borrow_mut","borrow_mut","clone","clone","clone_into","clone_into","default","default","dictionary_form","dictionary_form","dictionary_form_word_id","dictionary_form_word_id","fmt","from","from","from","from","from","get_word_info","head_word_length","head_word_length","into","into","into","new","normalized_form","normalized_form","pos_id","pos_id","reading_form","reading_form","surface","surface","synonym_group_ids","synonym_group_ids","to_owned","to_owned","try_from","try_from","try_from","try_into","try_into","try_into","type_id","type_id","type_id","word_structure","word_structure","WordParams","borrow","borrow_mut","from","get_cost","get_params","into","new","set_cost","size","storage_size","try_from","try_into","type_id","LexiconSet","LexiconSetError","TooLargeDictionaryId","TooLargeWordId","TooManyDictionaries","append","borrow","borrow","borrow_mut","borrow_mut","eq","equivalent","equivalent","equivalent","fmt","fmt","from","from","get_word_info","get_word_info_subset","get_word_param","into","into","is_full","lookup","new","size","to_string","try_from","try_from","try_into","try_into","type_id","type_id","skip_u32_array","skip_wid_array","u32_array_parser","u32_parser","u32_wid_array_parser","Borrowed","File","Owned","Storage","SudachiDicData","add_user","as_ref","borrow","borrow","borrow_mut","borrow_mut","from","from","into","into","new","system","system_static_slice","try_from","try_from","try_into","try_into","type_id","type_id","DIC_FORM_WORD_ID","HEAD_WORD_LENGTH","InfoSubset","NORMALIZED_FORM","POS_ID","READING_FORM","SPLIT_A","SPLIT_B","SURFACE","SYNONYM_GROUP_ID","WORD_STRUCTURE","all","bitand","bitand_assign","bitor","bitor_assign","bits","bits","bitxor","bitxor_assign","borrow","borrow_mut","clone","clone_into","complement","contains","default","difference","empty","eq","equivalent","equivalent","equivalent","extend","fmt","fmt","fmt","fmt","fmt","from","from_bits","from_bits_retain","from_bits_retain","from_bits_truncate","from_iter","from_name","insert","intersection","intersects","into","into_iter","is_all","is_empty","iter","iter_names","normalize","not","remove","set","sub","sub_assign","symmetric_difference","to_owned","toggle","try_from","try_into","type_id","union","BOS","EOS","INVALID","MAX_WORD","WordId","as_raw","borrow","borrow_mut","checked","clone","clone_into","cmp","compare","dic","eq","equivalent","equivalent","equivalent","fmt","fmt","from","from_raw","hash","into","is_oov","is_special","is_system","is_user","new","oov","partial_cmp","to_owned","to_string","try_from","try_into","type_id","word","ConfigError","DictionaryCompilationError","EosBosDisconnect","Err","Err","ErrWithContext","FromUtf16","InputTooLong","InvalidCharacterCategory","InvalidCharacterCategoryType","InvalidDataFormat","InvalidDictionaryGrammar","InvalidHeader","InvalidPartOfSpeech","InvalidRange","InvalidUtf16FromNom","Io","LexiconSetError","MorphemeListBorrowed","NoOOVPluginProvided","Nom","NomParseError","Ok","Ok","OutOfBounds","ParseIntError","PluginError","RegexError","SerdeError","SudachiError","SudachiNomError","SudachiNomResult","SudachiResult","Utf16String","append","borrow","borrow","borrow_mut","borrow_mut","eq","fmt","fmt","fmt","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from_error_kind","into","into","source","to_string","try_from","try_from","try_into","try_into","type_id","type_id","with_context","cause","cause","context","context","InputBuffer","InputEditor","InputTextIndex","borrow","borrow","borrow_mut","borrow_mut","build","can_bow","cat_at_char","cat_at_char","cat_continuous_len","cat_continuous_len","cat_of_range","cat_of_range","ch_idx","char_distance","char_distance","clone","clone_into","curr_byte_offsets","curr_slice","curr_slice","curr_slice_c","current","current_chars","default","from","from","from","get_original_index","get_word_candidate_length","into","into","into_original","new","orig_slice","orig_slice","orig_slice_c","original","refresh_chars","replace_char","replace_char_iter","replace_own","replace_ref","reset","start_build","swap_original","to_curr_byte_idx","to_orig","to_orig","to_orig_byte_idx","to_orig_char_idx","to_owned","try_from","try_from","try_into","try_into","type_id","type_id","with_editor","BoxType","InitFnType","InvalidDataFormat","Io","Libloading","PluginCategory","PluginError","SerdeError","borrow","borrow_mut","bundled_impl","configurations","connect_cost","do_setup","dso","fmt","fmt","from","from","from","from","input_text","into","oov","path_rewrite","source","to_string","try_from","try_into","type_id","message","source","EditConnectionCostPlugin","bundled_impl","configurations","do_setup","edit","set_up","InputTextPlugin","bundled_impl","configurations","default_input_text","do_setup","rewrite","rewrite_impl","set_up","uses_chars","DefaultInputTextPlugin","borrow","borrow_mut","default","from","into","rewrite_impl","set_up","try_from","try_into","type_id","uses_chars","OovProviderPlugin","bundled_impl","configurations","do_setup","mecab_oov","provide_oov","regex_oov","set_up","simple_oov","MeCabOovPlugin","borrow","borrow_mut","default","from","into","provide_oov","set_up","try_from","try_into","type_id","BoundaryMode","Relaxed","Strict","borrow","borrow_mut","clone","clone_into","default","deserialize","eq","equivalent","equivalent","equivalent","fmt","from","into","to_owned","try_from","try_into","type_id","SimpleOovPlugin","borrow","borrow_mut","default","from","into","provide_oov","set_up","try_from","try_into","type_id","PathRewritePlugin","bundled_impl","configurations","do_setup","join_katakana_oov","join_numeric","rewrite","set_up","JoinKatakanaOovPlugin","borrow","borrow_mut","default","from","into","rewrite","set_up","try_from","try_into","type_id","JoinNumericPlugin","borrow","borrow_mut","default","from","into","rewrite","set_up","try_from","try_into","type_id","PosMatcher","borrow","borrow_mut","clone","clone_into","difference","entries","from","intersection","into","matches_id","new","num_entries","to_owned","try_from","try_into","type_id","union","Mode","Morpheme","MorphemeList","SudachiError","SudachiResult","NonBreakChecker","SentenceDetector","borrow","borrow","borrow_mut","borrow_mut","bos","from","from","get_eos","into","into","new","new","try_from","try_from","try_into","try_into","type_id","type_id","with_limit","SentenceIter","SentenceSplitter","SplitSentences","borrow","borrow","borrow_mut","borrow_mut","from","from","into","into","into_iter","multiunzip","new","next","split","split","try_from","try_from","try_into","try_into","type_id","type_id","with_checker","with_limit"],"q":[[0,"sudachi"],[11,"sudachi::analysis"],[63,"sudachi::analysis::created"],[107,"sudachi::analysis::lattice"],[124,"sudachi::analysis::mlist"],[161,"sudachi::analysis::morpheme"],[189,"sudachi::analysis::node"],[246,"sudachi::analysis::stateful_tokenizer"],[265,"sudachi::analysis::stateless_tokenizer"],[282,"sudachi::config"],[382,"sudachi::dic"],[426,"sudachi::dic::build"],[473,"sudachi::dic::build::error"],[521,"sudachi::dic::build::error::BuildFailure"],[528,"sudachi::dic::build::report"],[540,"sudachi::dic::category_type"],[618,"sudachi::dic::character_category"],[665,"sudachi::dic::connect"],[678,"sudachi::dic::dictionary"],[695,"sudachi::dic::grammar"],[718,"sudachi::dic::header"],[820,"sudachi::dic::lexicon"],[856,"sudachi::dic::lexicon::trie"],[897,"sudachi::dic::lexicon::word_id_table"],[918,"sudachi::dic::lexicon::word_infos"],[978,"sudachi::dic::lexicon::word_params"],[992,"sudachi::dic::lexicon_set"],[1026,"sudachi::dic::read"],[1031,"sudachi::dic::storage"],[1055,"sudachi::dic::subset"],[1123,"sudachi::dic::word_id"],[1160,"sudachi::error"],[1229,"sudachi::error::SudachiError"],[1233,"sudachi::input_text"],[1294,"sudachi::plugin"],[1324,"sudachi::plugin::PluginError"],[1326,"sudachi::plugin::connect_cost"],[1332,"sudachi::plugin::input_text"],[1341,"sudachi::plugin::input_text::default_input_text"],[1353,"sudachi::plugin::oov"],[1362,"sudachi::plugin::oov::mecab_oov"],[1373,"sudachi::plugin::oov::regex_oov"],[1393,"sudachi::plugin::oov::simple_oov"],[1404,"sudachi::plugin::path_rewrite"],[1412,"sudachi::plugin::path_rewrite::join_katakana_oov"],[1423,"sudachi::plugin::path_rewrite::join_numeric"],[1434,"sudachi::pos"],[1452,"sudachi::prelude"],[1457,"sudachi::sentence_detector"],[1478,"sudachi::sentence_splitter"],[1503,"core::fmt"],[1504,"core::fmt"],[1505,"alloc::string"],[1506,"core::any"],[1507,"core::convert"],[1508,"core::marker"],[1509,"std::io"],[1510,"alloc::vec"],[1511,"core::clone"],[1512,"core::option"],[1513,"core::cell"],[1514,"core::ops::range"],[1515,"core::ops::deref"],[1516,"alloc::boxed"],[1517,"std::path"],[1518,"std::path"],[1519,"serde_json::error"],[1520,"std::io::error"],[1521,"core::error"],[1522,"std::time"],[1523,"core::time"],[1524,"core::iter::traits::collect"],[1525,"core::hash"],[1526,"bitflags::iter"],[1527,"bitflags::iter"],[1528,"core::cmp"],[1529,"nom::error"],[1530,"core::cmp"],[1531,"core::num::error"],[1532,"nom::internal"],[1533,"alloc::string"],[1534,"serde_json::value"],[1535,"libloading::error"]],"d":["","","","","","","","","","","Create an entry point into sudachi DSO plugin","Short","Middle (similar to “word”)","Named Entity","","Unit to split text","","Able to tokenize Japanese text","","","","","","","","","","","","","","","","","","","","Returns the argument unchanged.","Returns the argument unchanged.","","Calls U::from(self).","Calls U::from(self).","","","","","","","","","","","","","","Break text into Morphemes","","","","","","","","Bitset which represents that a word of a specified length …","","Maximum supported length of the word","","","","","","","","","","","","","","","","","","","","","","","","","","Returns the argument unchanged.","Returns the argument unchanged.","","Calls U::from(self).","Calls U::from(self).","","","","","","","","","","","","Lattice which is constructed for performing the Viterbi …","","","Find EOS node – finish the lattice construction","Find the path with the minimal cost through the lattice to …","","","Fill the path with the minimum cost (indices only). …","Returns the argument unchanged.","Checks if there exist at least one at the word end boundary","Insert a single node in the lattice, founding the path to …","Calls U::from(self).","Lookup a node for the index","Prepare lattice for the next analysis of a sentence with …","","","","Iterates over morpheme list","","","","","","Clears morphemes from analysis result","","","","Returns an empty morpheme list","","Returns the argument unchanged.","Returns the argument unchanged.","Creates MorphemeList from components","","Gets the whole cost of the path","Calls U::from(self).","Calls U::from(self).","","","","","","","","","Returns a new morpheme list splitting the morpheme with a …","Splits morphemes and writes them into the resulting list …","","","","","","","","","A morpheme (basic semantic unit of language)","Returns the begin index in bytes of the morpheme in the …","Returns the codepoint offset of the morpheme begin in the …","","","Returns the dictionary form of morpheme","Returns the dictionary id where the morpheme belongs","Returns the end index in bytes of the morpheme in the …","Returns the codepoint offset of the morpheme begin in the …","","Returns the argument unchanged.","","Returns the index of this morpheme","Calls U::from(self).","Returns if this morpheme is out of vocabulary","Returns the normalized form of morpheme","Returns the part of speech","","Returns the reading form of morpheme.","Returns new morpheme list splitting the morpheme with …","Splits morpheme and writes sub-morphemes into the provided …","Returns a substring of the original text which corresponds …","","Returns total cost from the beginning of the path","","","","Returns the word id of morpheme","","","Accessor trait for the full path cost","Full lattice node, as the result of analysis. All indices …","Accessor trait for right connection id","","","Returns begin offset in bytes of node surface in a sentence","","","","","Returns range in bytes (for easy string slicing)","Utility method for extracting [begin, end) codepoint range.","","","Concatenate the nodes in the range and replace …","Concatenate the nodes in the range and set pos_id.","","","","","Returns end offset in bytes of node surface in a sentence","","Returns the argument unchanged.","Returns the argument unchanged.","Calls U::from(self).","Calls U::from(self).","","","Is true when the word does not come from the dictionary. …","If a node is a special system node like BOS or EOS. Java …","","","","","Returns number of codepoints in the current node","Returns number of splits in a specified mode","","","","","","Split the node with a specified mode using the dictionary …","","","","","","","","","","","","","","","","","Create a new debug stateful tokenizer with the following …","Borrow current dictionary","Get a clone of current dictionary","Perform the actual tokenization so the analysis result …","Returns the argument unchanged.","Calls U::from(self).","Consume the Tokenizer and produce MorphemeList","Create a new non-debug stateful tokenizer","Prepare StatefulTokenizer for the next data. Data must be …","Set debug flag and returns the current one","Set the analysis mode and returns the current one","Analyzer will read only following [WordInfo] field subset","Swap result data with the current analyzer","","","","Provides access to dictionary data","Implementation of a Tokenizer which does not have …","","","","Returns the argument unchanged.","","","Calls U::from(self).","","","","","","","","","Setting data loaded from config file","Struct corresponds with raw config json file. You must use …","Sudachi Error","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","Resolves a possibly relative path with regards to all …","","","","","","","","","","","","","","","","","","","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).","Creates a minimal config with the provided resource …","","","","","Return required InfoSubset for the current projection type","","","","","","","","","","","","","","","","","","","","","","","","","","","","Sets the system dictionary to the provided path","A single system or user dictionary","A dictionary consists of one system_dict and zero or more …","","","","","","","","","","Returns the argument unchanged.","Returns the argument unchanged.","Creates a system dictionary from bytes, and load a …","","","","","","","","Calls U::from(self).","Calls U::from(self).","","","","","","","","","Creates a binary dictionary from bytes","Creates a system binary dictionary from bytes","Creates a user binary dictionary from bytes","","","","","","","","","","","","","","Builds a binary dictionary from csv lexicon and connection …","","","","","","","","","Compile the binary dictionary and write it to the …","","","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","","","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","","","","Creates a new builder for system dictionary","Creates a new builder for user dictionary","","","Read the connection matrix from either a file or an …","Read the csv lexicon from either a file or an in-memory …","","Return dictionary build report","Resolve the dictionary references.","Set the dictionary compile time to the specified time …","Set the dictionary description","","","","","","","","","","Actual specific errors for dictionary compilation","","Dictionary building-process related parent error. Captures …","","","Contains the error value","","","","","","","","","","","","Contains the success value","","","","","","","","","","","","","","","","Returns the argument unchanged.","","Returns the argument unchanged.","Calls U::from(self).","Calls U::from(self).","","","","","","","","","","","","","","","","","","","","","Returns the argument unchanged.","Calls U::from(self).","","","","","","","","All categories at once except NOOOVBOW/2 ","Latin alphabets. ","Cyrillic alphabets. ","A set of categories for a character","The fall back category. ","Greek alphabets. ","Hiragana characters. ","CJKV ideographic characters. ","Kanji numeric characters. ","Katakana characters. ","This character cannot be the beginning of an OOV word ","This and next characters cannot be the beginning of an OOV …","Numerical characters. ","White spaces. ","Symbols. ","User defined category. ","User defined category. ","User defined category. ","User defined category. ","Get a flags value with all known bits set.","The bitwise and (&) of the bits in two flags values.","The bitwise and (&) of the bits in two flags values.","The bitwise or (|) of the bits in two flags values.","The bitwise or (|) of the bits in two flags values.","","Get the underlying bits value.","The bitwise exclusive-or (^) of the bits in two flags …","The bitwise exclusive-or (^) of the bits in two flags …","","","","","The bitwise negation (!) of the bits in a flags value, …","Whether all set bits in a source flags value are also set …","","","The intersection of a source flags value with the …","Get a flags value with all bits unset.","","","","","The bitwise or (|) of the bits in each flags value.","","","","","","Returns the argument unchanged.","Convert from a bits value.","","Convert from a bits value exactly.","Convert from a bits value, unsetting any unknown bits.","The bitwise or (|) of the bits in each flags value.","Get a flags value with the bits of a flag with the given …","","","The bitwise or (|) of the bits in two flags values.","The bitwise and (&) of the bits in two flags values.","Whether any set bits in a source flags value are also set …","Calls U::from(self).","","Whether all known bits in this flags value are set.","Whether all bits in this flags value are unset.","Yield a set of contained flags values.","Yield a set of contained named flags values.","The bitwise negation (!) of the bits in a flags value, …","The intersection of a source flags value with the …","Call insert when value is true or remove when value is …","The intersection of a source flags value with the …","The intersection of a source flags value with the …","The bitwise exclusive-or (^) of the bits in two flags …","","The bitwise exclusive-or (^) of the bits in two flags …","","","","The bitwise or (|) of the bits in two flags values.","","CharacterCategory holds mapping from character to …","Sudachi error","","","","","","","","","","","","","","","","","","","","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Creates a character category from file","","Returns a set of category types which given char has","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","","","","","","","","","","","","","","","","","","","Gets the value of the connection matrix","Returns the argument unchanged.","","Calls U::from(self).","Returns maximum number of left connection ID","Returns maximum number of right connection ID","","","","","","","","Returns the argument unchanged.","Creates a dictionary from the specified configuration …","Creats a dictionary from the specified configuration and …","Returns grammar with the correct lifetime","","","Calls U::from(self).","","Returns lexicon with the correct lifetime","","","","","","","","Dictionary grammar","","","","The mapping from character to character_category_type","","Returns connection cost of nodes","Returns the argument unchanged.","Returns a pos_id of given pos in the grammar","Calls U::from(self).","Merge a another grammar into this grammar","Creates a Grammar from dictionary bytes","Gets POS components for POS ID. Panics if out of bounds.","","","Sets character category","Sets connect cost for a specific pair of ids","","","","","","Dictionary header","Sudachi error","Header version","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","","Returns if this header version has grammar","Returns if this header version has synonym group ids","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Creates new system dictionary header Its version field …","Creates a new header from a dictionary bytes","Set creation time","","","","","","","","","","","","","","","","","","","","","","","","Dictionary lexicon","Result of the Lexicon lookup","The first 4 bits of word_id are used to indicate that from …","","","","","Byte index of the word end","","","","","","Returns the argument unchanged.","Returns the argument unchanged.","Returns WordInfo for given word_id","Returns word_param for given word_id. Params are (left_id, …","Calls U::from(self).","Calls U::from(self).","Returns an iterator of word_id and end of words that …","","","Assign lexicon id to the current Lexicon","","","","","","","","","update word_param cost based on current tokenizer","Id of the returned word","","","","","","","","","","","","","","","","Offset of word end","","","","","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","","","","","","","","","","","","","","","","","Value of Trie, this is not the pointer to WordId, but the …","","","","","","","","Returns the argument unchanged.","Returns the argument unchanged.","Calls U::from(self).","Calls U::from(self).","","","","","","","","","","","WordInfo API.","Internal storage of the WordInfo. It is not accessible by …","","","","","","","","","","","","","","","","","","","","","","","","Returns the argument unchanged.","Returns the argument unchanged.","","Returns the argument unchanged.","","","","","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","","","","","","","","","","","","","","","","","","","","","","","","","","","","Returns the argument unchanged.","","","Calls U::from(self).","","","","","","","","Set of Lexicons","Sudachi error","","","","Add a lexicon to the lexicon list","","","","","","","","","","","Returns the argument unchanged.","Returns the argument unchanged.","Returns WordInfo for given WordId","Returns WordInfo for given WordId. Only fills a requested …","Returns word_param for given word_id","Calls U::from(self).","Calls U::from(self).","Returns if dictionary capacity is full","Returns iterator which yields all words in the dictionary, …","Creates a LexiconSet given a lexicon","","","","","","","","","","","","","","","","","","","","","","","","","Returns the argument unchanged.","Returns the argument unchanged.","Calls U::from(self).","Calls U::from(self).","","","","","","","","","","","","","","","","","","","","","Get a flags value with all known bits set.","The bitwise and (&) of the bits in two flags values.","The bitwise and (&) of the bits in two flags values.","The bitwise or (|) of the bits in two flags values.","The bitwise or (|) of the bits in two flags values.","","Get the underlying bits value.","The bitwise exclusive-or (^) of the bits in two flags …","The bitwise exclusive-or (^) of the bits in two flags …","","","","","The bitwise negation (!) of the bits in a flags value, …","Whether all set bits in a source flags value are also set …","","The intersection of a source flags value with the …","Get a flags value with all bits unset.","","","","","The bitwise or (|) of the bits in each flags value.","","","","","","Returns the argument unchanged.","Convert from a bits value.","Convert from a bits value exactly.","","Convert from a bits value, unsetting any unknown bits.","The bitwise or (|) of the bits in each flags value.","Get a flags value with the bits of a flag with the given …","The bitwise or (|) of the bits in two flags values.","The bitwise and (&) of the bits in two flags values.","Whether any set bits in a source flags value are also set …","Calls U::from(self).","","Whether all known bits in this flags value are set.","Whether all bits in this flags value are unset.","Yield a set of contained flags values.","Yield a set of contained named flags values.","","The bitwise negation (!) of the bits in a flags value, …","The intersection of a source flags value with the …","Call insert when value is true or remove when value is …","The intersection of a source flags value with the …","The intersection of a source flags value with the …","The bitwise exclusive-or (^) of the bits in two flags …","","The bitwise exclusive-or (^) of the bits in two flags …","","","","The bitwise or (|) of the bits in two flags values.","","","","","Dictionary word ID","","","","Creates the WordId with correctness checking","","","","","Extract Dictionary ID","","","","","","","Returns the argument unchanged.","Create WordId from the compressed representation","","Calls U::from(self).","Check if the word is OOV An OOV node can come of OOV …","Checks if the WordId corresponds to a special node","Check if the word comes from the system dictionary","Check if the word comes from the user dictionary","Create WordId from parts","Creates an OOV node for pos_id","","","","","","","Extract Word ID","","","","Contains the error value","Contains the error value","","","","","","","","","","","","","","","","","","Contains the success value","Contains the success value","","","","","","Sudachi error","Custum nom error","","","Failed to parse utf16 string","","","","","","","","","","","","","","","","","","","Returns the argument unchanged.","","","","Returns the argument unchanged.","","Calls U::from(self).","Calls U::from(self).","","","","","","","","","","","","","","InputBuffer - prepares the input data for the analysis","","Provides fast indexed access into the input text","","","","","Finalizes InputBuffer state, making it RO","Whether the byte can start a new word. Supports bytes not …","Character category at char offset","","Number of chars to the right of the offset with the same …","","Common character category inside the range. Indexed by …","","","Distance in chars between the char indexed by index and …","","","","Returns byte offsets of current chars","Returns substring of the current (modified) text by …","","Input: Mod Char Idx","Borrow modified data","Borrow array of current characters","","Returns the argument unchanged.","Creates input from the passed string. Should be used …","Returns the argument unchanged.","Get index of the current byte in original sentence Bytes …","Returns char length to the next can_bow point","Calls U::from(self).","Calls U::from(self).","Return original data as owned, consuming itself ","Creates new InputBuffer","Returns substring of original text by indices from the …","","Input: Mod Char Idx","Borrow original data","Recompute chars from modified string (useful if the …","Replace range with char","Replace range with char, followed by chars from iterator","Replace range with owned String","Replace range with a &str","Resets the input buffer, so it could be used to process …","Moves InputBuffer into RW state, making it possible to …","Swaps original data with the passed location","Mod Char Idx -> Mod Byte Idx","Translate range from current state to original. …","","Mod Char Idx -> Orig Byte Idx","Mod Char Idx -> Orig Char Idx","","","","","","","","Execute a function which can modify the contents of the …","Boxed type of the plugin. Should be Box.","Type of the initialization function. It must take 0 …","","","","A category of Plugins","","","","","Create bundled plugin for plugin name Instead of full name …","Extract plugin configurations from the config","","Perform initial setup. We can’t call set_up of the …","","","","Returns the argument unchanged.","","","","","Calls U::from(self).","","","","","","","","","","Trait of plugin to edit connection cost in the grammar","","","","Edits the grammar","Loads necessary information for the plugin","Trait of plugin to modify the input text before …","","","","","Perform rewrites","Actual implementation of rewriting. Call apply_rewrite …","Loads necessary information for the plugin","Whether the rewrite process uses chars","Provides basic normalization of the input text","","","","Returns the argument unchanged.","Calls U::from(self).","","","","","","","Trait of plugin to provide oov node during tokenization","","","","","Generate a list of oov nodes offset - char idx","","Loads necessary information for the plugin","","provides MeCab oov nodes","","","","Returns the argument unchanged.","Calls U::from(self).","","","","","","","","","","","","","","","","","","","","Returns the argument unchanged.","Calls U::from(self).","","","","","Provides a OOV node with single character if no words …","","","","Returns the argument unchanged.","Calls U::from(self).","","","","","","Trait of plugin to rewrite the path from lattice","","","","","","Returns a rewritten path","Loads necessary information for the plugin","Concatenates katakana oov nodes into one","","","","Returns the argument unchanged.","Calls U::from(self).","","","","","","Concatenates numeric nodes as one","","","","Returns the argument unchanged.","Calls U::from(self).","","","","","","","","","","","","","Returns the argument unchanged.","","Calls U::from(self).","","","","","","","","","","","","","","A checker for words that cross boundaries","A sentence boundary detector","","","","","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the byte index of the detected end of the sentence.","Calls U::from(self).","Calls U::from(self).","","","","","","","","","","","","","","","","","Returns the argument unchanged.","Returns the argument unchanged.","Calls U::from(self).","Calls U::from(self).","","","","","","","","","","","","","",""],"i":[0,0,0,0,0,0,0,0,0,0,0,3,3,3,133,0,0,0,1,1,3,1,3,1,3,1,3,1,0,1,3,3,3,3,1,3,3,1,3,3,1,3,0,1,0,0,1,0,1,1,0,0,1,3,3,133,1,3,1,3,1,3,1,0,0,17,20,20,20,17,17,17,20,17,20,17,20,17,20,17,17,17,20,17,17,17,20,20,20,17,20,17,20,17,17,20,17,17,17,17,20,17,20,17,20,17,20,0,22,22,22,22,22,22,22,22,22,22,22,22,22,22,22,22,0,0,14,36,14,36,14,14,14,14,14,14,14,36,14,14,14,14,36,36,14,14,14,36,14,36,36,14,14,14,14,14,36,14,36,14,36,0,35,35,35,35,35,35,35,35,35,35,35,35,35,35,35,35,35,35,35,35,35,35,35,35,35,35,35,0,0,0,0,0,134,33,33,43,33,43,33,33,134,33,33,0,0,134,33,134,33,33,33,43,33,43,33,43,135,134,134,134,33,33,43,134,33,136,33,33,33,43,33,33,33,135,33,43,33,43,33,43,33,134,33,33,0,31,31,31,31,31,31,31,31,31,31,31,31,31,31,31,31,31,31,0,0,44,44,44,44,30,30,44,30,44,30,30,44,44,44,44,0,0,0,52,52,54,54,54,54,52,52,52,54,52,54,52,0,54,52,51,50,54,52,51,50,50,51,52,51,50,52,51,50,51,51,52,51,0,0,52,50,50,52,52,52,52,50,54,54,52,51,50,54,54,54,52,51,50,50,50,50,51,54,52,51,50,51,51,51,51,51,52,51,51,51,50,50,54,50,51,52,51,50,54,54,52,52,51,50,54,52,51,50,54,52,51,50,50,51,51,0,0,62,63,62,63,0,0,0,0,0,62,63,62,0,62,62,63,0,63,62,62,63,0,62,63,0,62,62,62,0,63,63,63,0,0,63,62,63,62,63,62,63,0,0,65,0,0,65,0,65,66,64,65,66,64,64,67,65,0,65,66,64,66,66,65,66,64,66,67,65,64,64,66,66,64,64,0,64,64,64,64,65,66,64,65,66,64,65,66,64,0,71,0,0,71,137,71,71,71,71,71,71,71,71,71,71,71,137,71,71,71,71,71,70,71,70,71,70,70,70,70,71,71,70,71,71,70,71,70,71,70,71,70,71,70,71,70,71,138,139,138,139,139,140,140,0,68,68,68,68,68,68,68,68,68,68,68,73,73,73,0,73,73,73,73,73,73,73,73,73,73,73,73,73,73,73,73,73,73,73,73,73,73,73,73,73,73,73,73,73,73,73,73,73,73,73,73,73,73,73,73,73,73,73,73,73,73,73,73,73,73,73,73,73,73,73,73,73,73,73,73,73,73,73,73,73,73,73,73,73,73,73,73,73,73,0,0,0,79,79,79,79,82,79,78,82,79,78,78,78,78,79,79,79,79,79,79,78,82,79,78,78,78,78,82,79,78,82,78,82,82,78,79,82,79,78,82,79,78,82,79,78,0,23,23,23,23,23,23,23,23,23,23,23,23,0,83,83,83,83,83,83,83,83,83,83,83,83,83,83,83,83,26,26,0,26,26,26,26,26,26,26,26,26,26,26,26,26,26,26,26,26,26,26,26,90,0,0,0,90,90,90,89,86,0,86,0,87,88,87,88,88,90,86,87,88,89,90,86,87,88,89,86,87,88,89,86,87,88,89,89,89,90,86,87,88,89,90,90,90,86,86,86,87,87,87,88,88,88,89,89,89,90,90,86,87,88,89,90,86,87,88,89,86,89,89,90,86,87,88,89,89,89,89,86,87,88,89,90,86,90,86,87,88,89,90,86,87,88,89,90,86,87,88,89,89,89,0,0,0,93,92,93,92,92,92,92,92,92,92,93,92,93,93,93,92,93,92,93,93,93,0,93,92,93,92,93,92,93,92,0,0,0,0,0,0,96,97,95,96,97,95,95,95,96,95,95,95,95,95,95,96,97,95,96,97,95,97,96,95,96,97,95,96,96,97,95,96,97,95,96,97,95,95,0,0,98,99,98,99,98,98,99,98,99,99,98,99,98,98,99,98,99,98,99,0,0,0,39,100,39,100,101,100,39,39,101,100,39,100,39,100,39,100,39,39,100,39,100,100,101,100,100,39,39,101,39,100,101,100,39,101,39,100,39,100,39,100,39,100,39,100,100,39,101,100,39,101,100,39,101,100,39,39,100,0,102,102,102,102,102,102,102,102,102,102,102,102,102,0,0,103,103,103,27,27,103,27,103,103,103,103,103,103,103,27,103,27,27,27,27,103,27,27,27,27,103,27,103,27,103,27,103,0,0,0,0,0,105,105,105,0,0,84,105,105,84,105,84,105,84,105,84,84,84,84,105,84,105,84,105,84,34,34,0,34,34,34,34,34,34,34,34,34,34,34,34,34,34,34,34,34,34,34,34,34,34,34,34,34,34,34,34,34,34,34,34,34,34,34,34,34,34,34,34,34,34,34,34,34,34,34,34,34,34,34,34,34,34,34,34,34,34,34,34,34,34,34,34,34,12,12,12,12,0,12,12,12,12,12,12,12,12,12,12,12,12,12,12,12,12,12,12,12,12,12,12,12,12,12,12,12,12,12,12,12,12,110,110,110,15,104,110,110,110,110,110,110,110,110,110,110,110,110,110,110,110,108,110,15,104,108,110,110,110,110,0,0,0,0,108,108,110,108,110,108,108,110,110,108,110,110,110,110,110,110,110,110,110,110,110,110,110,108,108,110,108,110,110,110,108,110,108,110,108,110,141,142,141,142,0,0,0,117,25,117,25,25,25,143,25,143,25,143,25,25,143,25,25,25,25,143,25,25,25,25,25,117,25,25,25,25,117,25,25,25,143,25,25,25,25,117,117,117,117,25,25,25,25,143,25,25,25,25,117,25,117,25,117,25,25,144,144,114,114,114,0,0,114,114,114,144,144,0,144,0,114,114,114,114,114,114,0,114,0,0,114,114,114,114,114,145,145,0,146,146,146,146,146,0,46,46,0,46,46,46,46,46,0,121,121,121,121,121,121,121,121,121,121,121,0,48,48,48,0,48,0,48,0,0,122,122,122,122,122,122,122,122,122,122,0,123,123,123,123,123,123,123,123,123,123,123,123,123,123,123,123,123,123,123,0,124,124,124,124,124,124,124,124,124,124,0,49,49,49,0,0,49,49,0,125,125,125,125,125,125,125,125,125,125,0,126,126,126,126,126,126,126,126,126,126,0,127,127,127,127,127,127,127,127,127,127,127,127,127,127,127,127,127,0,0,0,0,0,0,0,129,128,129,128,129,129,128,128,129,128,129,128,129,128,129,128,129,128,128,0,0,0,132,131,132,131,132,131,132,131,132,132,131,132,147,131,132,131,132,131,132,131,131,131],"f":[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,[1,2],[-1,-2,[],[]],[-1,-2,[],[]],[-1,-2,[],[]],[-1,-2,[],[]],[1,1],[3,3],[[-1,-2],4,[],[]],[[-1,-2],4,[],[]],[1,5],0,[1,2],[[3,3],6],[[-1,-2],6,[],[]],[[-1,-2],6,[],[]],[[-1,-2],6,[],[]],[[1,7],8],[[3,7],8],[[3,7],8],[-1,-1,[]],[-1,-1,[]],[9,[[10,[3]]]],[-1,-2,[],[]],[-1,-2,[],[]],0,[1,11],0,0,[[11,11,11,11,5,12],1],0,[1,11],[[1,11,11],4],0,0,[-1,-2,[],[]],[-1,-2,[],[]],[-1,13,[]],[[-1,9,3,6],[[15,[14]]],[]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,16,[]],[-1,16,[]],[1,12],0,0,0,0,0,0,[[17,17],17],[[17,-1],17,[[19,[18]]]],[-1,-2,[],[]],[-1,-2,[],[]],[-1,-2,[],[]],[-1,-2,[],[]],[17,17],[20,20],[[-1,-2],4,[],[]],[[-1,-2],4,[],[]],[[],17],[[],17],[[17,17],6],[[20,20],6],[[-1,-2],6,[],[]],[[-1,-2],6,[],[]],[[-1,-2],6,[],[]],[[-1,-2],6,[],[]],[[-1,-2],6,[],[]],[[-1,-2],6,[],[]],[[17,7],8],[[20,7],8],[-1,-1,[]],[-1,-1,[]],[[17,-1],20,[[19,[18]],21]],[-1,-2,[],[]],[-1,-2,[],[]],[17,6],[17,6],[-1,17,[[19,[18]]]],[-1,-2,[],[]],[-1,-2,[],[]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,16,[]],[-1,16,[]],0,[-1,-2,[],[]],[-1,-2,[],[]],[[22,23],[[15,[4]]]],[[22,1,23],[[4,[0,24]]]],[[],22],[[22,25,26,27,-1],[[15,[4]]],28],[[22,[29,[0]]],4],[-1,-1,[]],[[22,2],6],[[22,1,23],24],[-1,-2,[],[]],0,[[22,2],4],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,16,[]],0,0,[-1,-2,[],[]],[-1,-2,[],[]],[-1,-2,[],[]],[-1,-2,[],[]],[[[14,[-1]]],4,30],[[[14,[-1]],[31,[-2]]],[[15,[4]]],30,30],[[[14,[-1]],2,2,[14,[-1]]],4,30],[[[14,[-1]]],-1,30],[-1,[[14,[-1]]],30],[[[14,[-1]]],[[14,[-1]]],[30,32]],[-1,-1,[]],[-1,-1,[]],[[-1,25,[29,[33]],34],[[14,[-1]]],30],[[[14,[-1]],2],[[35,[-1]]],30],[[[14,[-1]]],24,30],[-1,-2,[],[]],[-1,-2,[],[]],[-1,-2,[],[]],[[[14,[-1]]],6,30],[[[14,[-1]]],[[36,[-1]]],30],[[[14,[-1]]],2,30],[[[36,[-1]]],2,30],[[[14,[-1]],9,34],[[15,[2]]],30],[[[36,[-1]]],37,30],[[[36,[-1]]],[[4,[2,[37,[2]]]]],30],[[[14,[-1]],3,2],[[15,[[14,[-1]]]]],[30,32]],[[[14,[-1]],3,2,[14,[-1]]],[[15,[6]]],30],[[[14,[-1]]],34,30],[[[14,[-1]]],[[38,[9]]],30],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,16,[]],[-1,16,[]],0,[[[35,[-1]]],2,30],[[[35,[-1]]],2,30],[-1,-2,[],[]],[-1,-2,[],[]],[[[35,[-1]]],9,30],[[[35,[-1]]],24,30],[[[35,[-1]]],2,30],[[[35,[-1]]],2,30],[[[35,[-1]],7],8,30],[-1,-1,[]],[[[35,[-1]]],39,30],[[[35,[-1]]],2,30],[-1,-2,[],[]],[[[35,[-1]]],6,30],[[[35,[-1]]],9,30],[[[35,[-1]]],[[40,[13]]],30],[[[35,[-1]]],11,30],[[[35,[-1]]],9,30],[[[35,[-1]],3],[[15,[[14,[-1]]]]],[30,32]],[[[35,[-1]],3,[14,[-1]]],[[15,[6]]],30],[[[35,[-1]]],[[38,[9]]],30],[[[35,[-1]]],[[40,[41]]],30],[[[35,[-1]]],24,30],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,16,[]],[[[35,[-1]]],12,30],0,0,0,0,0,[-1,2,[]],[33,2],[33,2],[-1,-2,[],[]],[-1,-2,[],[]],[-1,-2,[],[]],[-1,-2,[],[]],[33,[[42,[2]]]],[-1,[[42,[2]]],[]],[33,33],[[-1,-2],4,[],[]],[[[29,[33]],2,2,[37,[13]]],[[15,[[29,[33]]]]]],[[[29,[33]],2,2,11],[[15,[[29,[33]]]]]],[-1,5,[]],[33,5],[-1,2,[]],[33,2],[33,2],[[33,7],8],[-1,-1,[]],[-1,-1,[]],[-1,-2,[],[]],[-1,-2,[],[]],[-1,-2,[],[]],[-1,6,[]],[-1,6,[]],[-1,6,[]],[-1,11,[]],[33,11],[[1,24,11,11,39],33],[43,37],[-1,2,[]],[[33,3],2],[-1,11,[]],[33,11],[[33,11,11],4],[[33,11,11],4],[43,[[4,[2,[37,[2]]]]]],[[33,3,27,34,25],43],[-1,-2,[],[]],[-1,13,[]],[-1,24,[]],[33,24],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,16,[]],[-1,16,[]],[-1,12,[]],[33,12],[33,39],0,[-1,-2,[],[]],[-1,-2,[],[]],[[-1,6,3],[[31,[-1]]],30],[[[31,[-1]]],-1,30],[[[31,[-1]]],-1,[30,32]],[[[31,[-1]]],[[15,[4]]],30],[-1,-1,[]],[-1,-2,[],[]],[[[31,[-1]]],[[15,[[14,[-1]]]]],30],[[-1,3],[[31,[-1]]],30],[[[31,[-1]]],13,30],[[[31,[-1]],6],6,30],[[[31,[-1]],3],3,30],[[[31,[-1]],34],34,30],[[[31,[-1]],25,[29,[33]],34],4,30],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,16,[]],0,0,[[[44,[-1]]],[],45],[-1,-2,[],[]],[-1,-2,[],[]],[-1,-1,[]],[-1,26,[]],[-1,[[40,[[47,[46]]]]],[]],[-1,-2,[],[]],[-1,27,[]],[-1,[[44,[-1]]],30],[-1,[[40,[[47,[48]]]]],[]],[-1,[[40,[[47,[49]]]]],[]],[[[44,[-1]],9,3,6],[[15,[14]]],[30,32]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,16,[]],0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,[-1,-2,[],[]],[-1,-2,[],[]],[-1,-2,[],[]],[-1,-2,[],[]],[-1,-2,[],[]],[-1,-2,[],[]],[-1,-2,[],[]],[-1,-2,[],[]],[50,51],0,[52,52],[51,51],[50,50],[[-1,-2],4,[],[]],[[-1,-2],4,[],[]],[[-1,-2],4,[],[]],[[51,-1],[[10,[53,54]]],[[56,[55]],[19,[53]]]],0,[[],52],[[],51],[[],53],[[],53],[-1,[[10,[52]]],57],[-1,[[10,[50]]],57],[[],50],[[52,52],6],[[-1,-2],6,[],[]],[[-1,-2],6,[],[]],[[-1,-2],6,[],[]],[[50,50],50],[[54,7],8],[[54,7],8],[[52,7],8],[[51,7],8],[[50,7],8],[-1,-1,[]],[58,54],[59,54],[-1,-1,[]],[-1,-1,[]],[-1,-1,[]],[[[40,[60]]],[[10,[50,54]]]],[55,[[10,[50,54]]]],[[[37,[55]]],[[10,[50,54]]]],0,[-1,-2,[],[]],[-1,-2,[],[]],[-1,-2,[],[]],[-1,-2,[],[]],[-1,51,[[19,[53]]]],[[[37,[53]],[37,[53]],[37,[53]]],[[10,[51,54]]]],0,0,0,[52,34],[[51,13],[[29,[13]]]],[51,[[10,[53,54]]]],[51,[[10,[[29,[53]],54]]]],[[50,-1],50,[[19,[53]]]],[[50,-1],50,[[19,[53]]]],[54,[[37,[61]]]],[[50,-1],50,[[19,[53]]]],0,[-1,-2,[],[]],[-1,-2,[],[]],[-1,-2,[],[]],[-1,13,[]],[-1,[[10,[-2]]],[],[]],[9,[[10,[52]]]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,16,[]],[-1,16,[]],[-1,16,[]],[-1,16,[]],[[50,-1],50,[[19,[53]]]],0,[[51,-1],51,[[19,[53]]]],0,0,[-1,-2,[],[]],[-1,-2,[],[]],[-1,-2,[],[]],[-1,-2,[],[]],0,0,0,0,0,[-1,-1,[]],[-1,-1,[]],[[[40,[60]],55],[[15,[62]]]],0,[62,26],0,0,0,0,[62,[[40,[[47,[46]]]]]],[-1,-2,[],[]],[-1,-2,[],[]],0,[62,27],0,0,0,[62,[[40,[[47,[48]]]]]],[62,[[40,[[47,[49]]]]]],0,[[[40,[60]]],[[15,[63]]]],[[[40,[60]]],[[15,[63]]]],[[[40,[60]]],[[15,[63]]]],0,0,[63,[[37,[62]]]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,16,[]],[-1,16,[]],0,0,0,0,0,0,0,[-1,-2,[],[]],[-1,-2,[],[]],[-1,-2,[],[]],[-1,-2,[],[]],[-1,-2,[],[]],[-1,-2,[],[]],[[[64,[-1]],-2],[[15,[4]]],30,28],[-1,65,[]],[65,65],0,[-1,-1,[]],[-1,-1,[]],[-1,-1,[]],[66,26],[66,[[40,[[47,[46]]]]]],[-1,-2,[],[]],[-1,-2,[],[]],[-1,-2,[],[]],[66,27],[-1,13,[]],[65,13],[[],[[64,[66]]]],[-1,[[64,[-1]]],30],[66,[[40,[[47,[48]]]]]],[66,[[40,[[47,[49]]]]]],[[[64,[-1]],-2],[[15,[4]]],30,67],[[[64,[-1]],-2],[[15,[2]]],30,67],0,[[[64,[-1]]],[[40,[68]]],30],[[[64,[-1]]],[[15,[2]]],30],[[[64,[-1]],-2],69,30,[[19,[69]]]],[[[64,[-1]],-2],4,30,[[19,[13]]]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,16,[]],[-1,16,[]],[-1,16,[]],0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,[-1,-2,[],[]],[-1,-2,[],[]],[-1,-2,[],[]],[-1,-2,[],[]],0,0,[[70,7],8],[[70,7],8],[[71,7],8],[[71,7],8],[-1,-1,[]],[59,71],[-1,-1,[]],[-1,-2,[],[]],[-1,-2,[],[]],0,[71,[[37,[61]]]],[-1,13,[]],[-1,13,[]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,16,[]],[-1,16,[]],0,0,0,0,0,0,0,0,[-1,-2,[],[]],[-1,-2,[],[]],[-1,-1,[]],[-1,-2,[],[]],[68,6],[68,9],[68,2],[68,72],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,16,[]],0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,[[],73],[[73,73],73],[[73,73],4],[[73,73],73],[[73,73],4],[73,41],[73,41],[[73,73],73],[[73,73],4],[-1,-2,[],[]],[-1,-2,[],[]],[73,73],[[-1,-2],4,[],[]],[73,73],[[73,73],6],[73,41],[[],73],[[73,73],73],[[],73],[[73,73],6],[[-1,-2],6,[],[]],[[-1,-2],6,[],[]],[[-1,-2],6,[],[]],[[73,-1],4,74],[[73,7],8],[[73,7],8],[[73,7],8],[[73,7],8],[[73,7],8],[-1,-1,[]],[41,[[37,[73]]]],[41,73],[41,73],[41,73],[-1,73,74],[9,[[37,[73]]]],[9,[[10,[73]]]],[[73,-1],4,75],[[73,73],4],[[73,73],73],[[73,73],6],[-1,-2,[],[]],[73],[73,6],[73,6],[73,[[76,[73]]]],[73,[[77,[73]]]],[73,73],[[73,73],4],[[73,73,6],4],[[73,73],73],[[73,73],4],[[73,73],73],[-1,-2,[],[]],[[73,73],4],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,16,[]],[[73,73],73],0,0,0,0,0,0,0,[-1,-2,[],[]],[-1,-2,[],[]],[-1,-2,[],[]],[-1,-2,[],[]],[-1,-2,[],[]],[-1,-2,[],[]],[78,78],[[-1,-2],4,[],[]],[[],78],[[79,79],6],[[-1,-2],6,[],[]],[[-1,-2],6,[],[]],[[-1,-2],6,[],[]],[[79,7],8],[[79,7],8],[[78,7],8],[-1,-1,[]],[-1,-1,[]],[-1,-1,[]],[55,[[15,[78]]]],[-1,[[15,[78]]],80],[[78,81],73],[-1,-2,[],[]],[-1,-2,[],[]],[-1,-2,[],[]],[-1,-2,[],[]],[78,82],[-1,[[4,[-2,-3]]],[],[],[]],[82,37],[-1,-2,[],[]],[-1,13,[]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,16,[]],[-1,16,[]],[-1,16,[]],0,[-1,-2,[],[]],[-1,-2,[],[]],[[23,11,11],5],[-1,-1,[]],[[[40,[60]],2,2,2],[[15,[23]]]],[-1,-2,[],[]],[23,2],[23,2],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,16,[]],[[23,11,11,5],4],0,[-1,-2,[],[]],[-1,-2,[],[]],[-1,-1,[]],[51,[[15,[83]]]],[[51,84],[[15,[83]]]],[83,26],[83,26],[83,[[40,[[47,[46]]]]]],[-1,-2,[],[]],[83,27],[83,27],[83,[[40,[[47,[48]]]]]],[83,[[40,[[47,[49]]]]]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,16,[]],0,0,0,0,[-1,-2,[],[]],[-1,-2,[],[]],0,[26,23],[[26,5,5],5],[-1,-1,[]],[[26,[40,[-1]]],[[37,[11]]],[[56,[9]]]],[-1,-2,[],[]],[[26,26],4],[[[40,[60]],2],[[15,[26]]]],[[26,11],[[40,[13]]]],0,[[26,[40,[-1]]],[[15,[11]]],[[56,[9]],85]],[[26,78],4],[[26,5,5,5],4],0,[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,16,[]],0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,[-1,-2,[],[]],[-1,-2,[],[]],[-1,-2,[],[]],[-1,-2,[],[]],[-1,-2,[],[]],[-1,-2,[],[]],[-1,-2,[],[]],[-1,-2,[],[]],[-1,-2,[],[]],[-1,-2,[],[]],[86,86],[87,87],[88,88],[89,89],[[-1,-2],4,[],[]],[[-1,-2],4,[],[]],[[-1,-2],4,[],[]],[[-1,-2],4,[],[]],0,0,[[90,90],6],[[86,86],6],[[87,87],6],[[88,88],6],[[89,89],6],[[-1,-2],6,[],[]],[[-1,-2],6,[],[]],[[-1,-2],6,[],[]],[[-1,-2],6,[],[]],[[-1,-2],6,[],[]],[[-1,-2],6,[],[]],[[-1,-2],6,[],[]],[[-1,-2],6,[],[]],[[-1,-2],6,[],[]],[[-1,-2],6,[],[]],[[-1,-2],6,[],[]],[[-1,-2],6,[],[]],[[-1,-2],6,[],[]],[[-1,-2],6,[],[]],[[-1,-2],6,[],[]],[[90,7],8],[[90,7],8],[[86,7],8],[[87,7],8],[[88,7],8],[[89,7],8],[-1,-1,[]],[-1,-1,[]],[-1,-1,[]],[-1,-1,[]],[-1,-1,[]],[91,[[37,[86]]]],[89,6],[89,6],[-1,-2,[],[]],[-1,-2,[],[]],[-1,-2,[],[]],[-1,-2,[],[]],[-1,-2,[],[]],[[],89],[[[40,[60]]],[[10,[89,90]]]],[[89,69],69],[-1,-2,[],[]],[-1,-2,[],[]],[-1,-2,[],[]],[-1,-2,[],[]],[-1,13,[]],[86,91],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,16,[]],[-1,16,[]],[-1,16,[]],[-1,16,[]],[-1,16,[]],0,[[89,-1],[[15,[2]]],28],0,0,0,[-1,-2,[],[]],[-1,-2,[],[]],[-1,-2,[],[]],[-1,-2,[],[]],0,[[92,92],6],[[-1,-2],6,[],[]],[[-1,-2],6,[],[]],[[-1,-2],6,[],[]],[[92,7],8],[-1,-1,[]],[-1,-1,[]],[[93,41,34],[[15,[39]]]],[[93,41],[[4,[5,5,5]]]],[-1,-2,[],[]],[-1,-2,[],[]],[[93,[40,[60]],2],[[0,[94]]]],[[12,2],92],[[[40,[60]],2,6],[[15,[93]]]],[[93,60],4],[93,41],0,[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,16,[]],[-1,16,[]],[[93,-1],[[15,[4]]],30],0,0,0,0,0,0,0,[-1,-2,[],[]],[-1,-2,[],[]],[-1,-2,[],[]],[-1,-2,[],[]],[-1,-2,[],[]],[-1,-2,[],[]],[95,95],[[-1,-2],4,[],[]],[[96,[40,[60]],2],97],0,[[95,95],6],[[-1,-2],6,[],[]],[[-1,-2],6,[],[]],[[-1,-2],6,[],[]],[[95,7],8],[-1,-1,[]],[-1,-1,[]],[-1,-1,[]],[-1,-2,[],[]],[-1,-2,[],[]],[-1,-2,[],[]],[-1,-2,[],[]],[[[40,[60]],2],96],[[41,2],95],[[[29,[41]]],96],[97,37],[-1,-2,[],[]],[96,2],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,16,[]],[-1,16,[]],[-1,16,[]],0,0,0,[-1,-2,[],[]],[-1,-2,[],[]],[-1,-2,[],[]],[-1,-2,[],[]],[[98,2],99],[-1,-1,[]],[-1,-1,[]],[-1,-2,[],[]],[-1,-2,[],[]],[-1,-2,[],[]],[[[40,[60]],41,2],98],[99,37],[98,2],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,16,[]],[-1,16,[]],0,0,0,[39,[[40,[12]]]],0,[39,[[40,[12]]]],0,[-1,-2,[],[]],[-1,-2,[],[]],[-1,-2,[],[]],[39,100],[-1,-2,[],[]],[-1,-2,[],[]],[-1,-2,[],[]],[100,100],[39,39],[[-1,-2],4,[],[]],[[-1,-2],4,[],[]],[[],100],[[],39],[39,9],0,[39,24],0,[[100,7],8],[-1,-1,[]],[-1,-1,[]],[39,100],[-1,-1,[]],[100,39],[[101,41,34],[[15,[39]]]],[39,2],0,[-1,-2,[],[]],[-1,-2,[],[]],[-1,-2,[],[]],[[[40,[60]],2,41,6],101],[39,9],0,[39,11],0,[39,9],0,[39,9],0,[39,[[40,[41]]]],0,[-1,-2,[],[]],[-1,-2,[],[]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,16,[]],[-1,16,[]],[-1,16,[]],[39,[[40,[12]]]],0,0,[-1,-2,[],[]],[-1,-2,[],[]],[-1,-1,[]],[[102,41],5],[[102,41],[[4,[5,5,5]]]],[-1,-2,[],[]],[[[40,[60]],41,2],102],[[102,41,5],4],[102,41],[102,2],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,16,[]],0,0,0,0,0,[[27,93,2],[[10,[4,103]]]],[-1,-2,[],[]],[-1,-2,[],[]],[-1,-2,[],[]],[-1,-2,[],[]],[[103,103],6],[[-1,-2],6,[],[]],[[-1,-2],6,[],[]],[[-1,-2],6,[],[]],[[103,7],8],[[103,7],8],[-1,-1,[]],[-1,-1,[]],[[27,12],[[15,[39]]]],[[27,12,34],[[15,[39]]]],[[27,12],[[4,[5,5,5]]]],[-1,-2,[],[]],[-1,-2,[],[]],[27,6],[[27,[40,[60]],2],[[0,[94]]]],[[93,2],27],[27,41],[-1,13,[]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,16,[]],[-1,16,[]],[[[40,[60]]],[[104,[[40,[60]],[29,[41]]]]]],[[[40,[60]]],[[104,[[40,[60]],[29,[12]]]]]],[[[40,[60]]],[[104,[[40,[60]],[29,[41]]]]]],[[[40,[60]]],[[104,[[40,[60]],41]]]],[[[40,[60]]],[[104,[[40,[60]],[29,[12]]]]]],0,0,0,0,0,[[84,105],4],[105,[[40,[60]]]],[-1,-2,[],[]],[-1,-2,[],[]],[-1,-2,[],[]],[-1,-2,[],[]],[-1,-1,[]],[-1,-1,[]],[-1,-2,[],[]],[-1,-2,[],[]],[105,84],[84,[[40,[60]]]],[84,[[40,[60]]]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,16,[]],[-1,16,[]],0,0,0,0,0,0,0,0,0,0,0,[[],34],[[34,34],34],[[34,34],4],[[34,34],34],[[34,34],4],[34,41],[34,41],[[34,34],34],[[34,34],4],[-1,-2,[],[]],[-1,-2,[],[]],[34,34],[[-1,-2],4,[],[]],[34,34],[[34,34],6],[[],34],[[34,34],34],[[],34],[[34,34],6],[[-1,-2],6,[],[]],[[-1,-2],6,[],[]],[[-1,-2],6,[],[]],[[34,-1],4,74],[[34,7],8],[[34,7],8],[[34,7],8],[[34,7],8],[[34,7],8],[-1,-1,[]],[41,[[37,[34]]]],[41,34],[41,34],[41,34],[-1,34,74],[9,[[37,[34]]]],[[34,34],4],[[34,34],34],[[34,34],6],[-1,-2,[],[]],[34],[34,6],[34,6],[34,[[76,[34]]]],[34,[[77,[34]]]],[34,34],[34,34],[[34,34],4],[[34,34,6],4],[[34,34],34],[[34,34],4],[[34,34],34],[-1,-2,[],[]],[[34,34],4],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,16,[]],[[34,34],34],0,0,0,0,0,[12,41],[-1,-2,[],[]],[-1,-2,[],[]],[[60,41],[[15,[12]]]],[12,12],[[-1,-2],4,[],[]],[[12,12],106],[[-1,-2],106,[],[]],[12,60],[[12,12],6],[[-1,-2],6,[],[]],[[-1,-2],6,[],[]],[[-1,-2],6,[],[]],[[12,7],8],[[12,7],8],[-1,-1,[]],[41,12],[[12,-1],4,75],[-1,-2,[],[]],[12,6],[12,6],[12,6],[12,6],[[60,41],12],[41,12],[[12,12],[[37,[106]]]],[-1,-2,[],[]],[-1,13,[]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,16,[]],[12,41],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,107,[108,[-1]]],[[108,[-1]]],[]],[-1,-2,[],[]],[-1,-2,[],[]],[-1,-2,[],[]],[-1,-2,[],[]],[[[108,[-1]],[108,[-1]]],6,109],[[110,7],8],[[110,7],8],[[[108,[-1]],7],8,111],[70,110],[112,110],[79,110],[59,110],[113,110],[90,110],[58,110],[54,110],[114,110],[-1,-1,[]],[[[115,[[108,[-1]]]]],110,111],[116,110],[103,110],[-1,-1,[]],[[-1,107],[[108,[-1]]],[]],[-1,-2,[],[]],[-1,-2,[],[]],[110,[[37,[61]]]],[-1,13,[]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,16,[]],[-1,16,[]],[[110,-1],110,[[19,[13]]]],0,0,0,0,0,0,0,[-1,-2,[],[]],[-1,-2,[],[]],[-1,-2,[],[]],[-1,-2,[],[]],[[25,26],[[15,[4]]]],[[25,2],6],[[-1,2],73,[]],[[25,2],73],[[-1,2],2,[]],[[25,2],2],[[-1,[42,[2]]],73,[]],[[25,[42,[2]]],73],[[25,2],2],[[-1,2,2],2,[]],[[25,2,2],2],[25,25],[[-1,-2],4,[],[]],[25,[[40,[2]]]],[[-1,[42,[2]]],9,[]],[[25,[42,[2]]],9],[[25,[42,[2]]],9],[25,9],[25,[[40,[81]]]],[[],25],[-1,-1,[]],[-1,25,[[56,[9]]]],[-1,-1,[]],[[25,2],2],[[25,2],2],[-1,-2,[],[]],[-1,-2,[],[]],[25,13],[[],25],[[-1,[42,[2]]],9,[]],[[25,[42,[2]]],9],[[25,[42,[2]]],9],[25,9],[25,4],[[117,[42,[2]],81],4],[[117,[42,[2]],81,-1],4,94],[[117,[42,[2]],13],4],[[117,[42,[2]],9],4],[25,13],[25,[[15,[4]]]],[[25,13],4],[[25,2],2],[[-1,[42,[2]]],[[42,[2]]],[]],[[25,[42,[2]]],[[42,[2]]]],[[25,2],2],[[25,2],2],[-1,-2,[],[]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,16,[]],[-1,16,[]],[[25,-1],[[15,[4]]],118],0,0,0,0,0,0,0,0,[-1,-2,[],[]],[-1,-2,[],[]],[9,37],[51,[[40,[119]]]],0,[[119,51,26],[[15,[4]]]],0,[[114,7],8],[[114,7],8],[-1,-1,[]],[120,114],[58,114],[59,114],0,[-1,-2,[],[]],0,0,[114,[[37,[61]]]],[-1,13,[]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,16,[]],0,0,0,[9,37],[51,[[40,[119]]]],[[119,51,26],[[15,[4]]]],[[-1,26],4,[]],[[-1,119,51,26],[[15,[4]]],[]],0,[9,37],[51,[[40,[119]]]],0,[[119,51,26],[[15,[4]]]],[[-1,25],[[15,[4]]],[]],[[-1,25,117],[[15,[117]]],[]],[[-1,119,51,26],[[15,[4]]],[]],[-1,6,[]],0,[-1,-2,[],[]],[-1,-2,[],[]],[[],121],[-1,-1,[]],[-1,-2,[],[]],[[121,25,117],[[15,[117]]]],[[121,119,51,26],[[15,[4]]]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,16,[]],[121,6],0,[9,37],[51,[[40,[119]]]],[[119,51,26],[[15,[4]]]],0,[[-1,25,2,17,[29,[1]]],[[15,[2]]],[]],0,[[-1,119,51,26],[[15,[4]]],[]],0,0,[-1,-2,[],[]],[-1,-2,[],[]],[[],122],[-1,-1,[]],[-1,-2,[],[]],[[122,25,2,17,[29,[1]]],[[15,[2]]]],[[122,119,51,26],[[15,[4]]]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,16,[]],0,0,0,[-1,-2,[],[]],[-1,-2,[],[]],[123,123],[[-1,-2],4,[],[]],[[],123],[-1,[[10,[123]]],57],[[123,123],6],[[-1,-2],6,[],[]],[[-1,-2],6,[],[]],[[-1,-2],6,[],[]],[[123,7],8],[-1,-1,[]],[-1,-2,[],[]],[-1,-2,[],[]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,16,[]],0,[-1,-2,[],[]],[-1,-2,[],[]],[[],124],[-1,-1,[]],[-1,-2,[],[]],[[124,25,2,17,[29,[1]]],[[15,[2]]]],[[124,119,51,26],[[15,[4]]]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,16,[]],0,[9,37],[51,[[40,[119]]]],[[119,51,26],[[15,[4]]]],0,0,[[-1,25,[29,[33]],22],[[15,[[29,[33]]]]],[]],[[-1,119,51,26],[[15,[4]]],[]],0,[-1,-2,[],[]],[-1,-2,[],[]],[[],125],[-1,-1,[]],[-1,-2,[],[]],[[125,25,[29,[33]],22],[[15,[[29,[33]]]]]],[[125,119,51,26],[[15,[4]]]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,16,[]],0,[-1,-2,[],[]],[-1,-2,[],[]],[[],126],[-1,-1,[]],[-1,-2,[],[]],[[126,25,[29,[33]],22],[[15,[[29,[33]]]]]],[[126,119,51,26],[[15,[4]]]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,16,[]],0,[-1,-2,[],[]],[-1,-2,[],[]],[127,127],[[-1,-2],4,[],[]],[[127,127],127],[127,[[0,[94]]]],[-1,-1,[]],[[127,127],127],[-1,-2,[],[]],[[127,11],6],[-1,127,74],[127,2],[-1,-2,[],[]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,16,[]],[[127,127],127],0,0,0,0,0,0,0,[-1,-2,[],[]],[-1,-2,[],[]],[-1,-2,[],[]],[-1,-2,[],[]],0,[-1,-1,[]],[-1,-1,[]],[[128,9,[37,[129]]],[[15,[130]]]],[-1,-2,[],[]],[-1,-2,[],[]],[27,129],[[],128],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,16,[]],[-1,16,[]],[2,128],0,0,0,[-1,-2,[],[]],[-1,-2,[],[]],[-1,-2,[],[]],[-1,-2,[],[]],[-1,-1,[]],[-1,-1,[]],[-1,-2,[],[]],[-1,-2,[],[]],[-1,-2,[],[]],[-1,[[4,[-2,-3]]],[],[],[]],[[],131],[132,37],[[-1,9],132,[]],[[131,9],132],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,[[10,[-2]]],[],[]],[-1,16,[]],[-1,16,[]],[[131,27],131],[2,131]],"c":[151,180,1338],"p":[[3,"Node",11],[15,"usize"],[4,"Mode",11],[15,"tuple"],[15,"i16"],[15,"bool"],[3,"Formatter",1503],[6,"Result",1503],[15,"str"],[4,"Result",1504],[15,"u16"],[3,"WordId",1123],[3,"String",1505],[3,"MorphemeList",124],[6,"SudachiResult",1160],[3,"TypeId",1506],[3,"CreatedWords",63],[15,"i64"],[8,"Into",1507],[4,"HasWord",63],[8,"Copy",1508],[3,"Lattice",107],[3,"ConnectionMatrix",665],[15,"i32"],[3,"InputBuffer",1233],[3,"Grammar",695],[3,"LexiconSet",992],[8,"Write",1509],[3,"Vec",1510],[8,"DictionaryAccess",265],[3,"StatefulTokenizer",246],[8,"Clone",1511],[3,"ResultNode",189],[3,"InfoSubset",1055],[3,"Morpheme",161],[3,"MorphemeIter",124],[4,"Option",1512],[3,"Ref",1513],[3,"WordInfo",918],[15,"slice"],[15,"u32"],[3,"Range",1514],[3,"NodeSplitIterator",189],[3,"StatelessTokenizer",265],[8,"Deref",1515],[8,"InputTextPlugin",1332],[3,"Box",1516],[8,"OovProviderPlugin",1353],[8,"PathRewritePlugin",1404],[3,"ConfigBuilder",282],[3,"Config",282],[4,"SurfaceProjection",282],[3,"PathBuf",1517],[4,"ConfigError",282],[3,"Path",1517],[8,"AsRef",1507],[8,"Deserializer",1518],[3,"Error",1519],[3,"Error",1520],[15,"u8"],[8,"Error",1521],[3,"LoadedDictionary",382],[3,"DictionaryLoader",382],[3,"DictBuilder",426],[4,"DataSource",426],[4,"NoDic",426],[8,"AsDataSource",426],[3,"DictPartReport",528],[3,"SystemTime",1522],[3,"DicBuildError",473],[4,"BuildFailure",473],[3,"Duration",1523],[3,"CategoryType",540],[8,"IntoIterator",1524],[8,"Hasher",1525],[3,"Iter",1526],[3,"IterNames",1526],[3,"CharacterCategory",618],[4,"Error",618],[8,"BufRead",1509],[15,"char"],[3,"CharCategoryIter",618],[3,"JapaneseDictionary",678],[3,"SudachiDicData",1031],[8,"ToString",1505],[4,"HeaderVersion",718],[4,"SystemDictVersion",718],[4,"UserDictVersion",718],[3,"Header",718],[4,"HeaderError",718],[15,"u64"],[3,"LexiconEntry",820],[3,"Lexicon",820],[8,"Iterator",1527],[3,"TrieEntry",856],[3,"Trie",856],[3,"TrieEntryIter",856],[3,"WordIdTable",897],[3,"WordIdIter",897],[3,"WordInfoData",918],[3,"WordInfos",918],[3,"WordParams",978],[4,"LexiconSetError",992],[6,"SudachiNomResult",1160],[4,"Storage",1031],[4,"Ordering",1528],[4,"ErrorKind",1529],[4,"SudachiNomError",1160],[8,"PartialEq",1528],[4,"SudachiError",1160],[8,"Debug",1503],[4,"Error",1530],[3,"ParseIntError",1531],[4,"PluginError",1294],[4,"Err",1532],[3,"FromUtf16Error",1505],[3,"InputEditor",1233],[8,"FnOnce",1533],[4,"Value",1534],[4,"Error",1535],[3,"DefaultInputTextPlugin",1341],[3,"MeCabOovPlugin",1362],[4,"BoundaryMode",1373],[3,"SimpleOovPlugin",1393],[3,"JoinKatakanaOovPlugin",1412],[3,"JoinNumericPlugin",1423],[3,"PosMatcher",1434],[3,"SentenceDetector",1457],[3,"NonBreakChecker",1457],[15,"isize"],[3,"SentenceSplitter",1478],[3,"SentenceIter",1478],[8,"Tokenize",11],[8,"LatticeNode",189],[8,"PathCost",189],[8,"RightId",189],[6,"DicWriteResult",473],[13,"InvalidSize",521],[13,"InvalidFieldSize",521],[13,"SplitFormatError",521],[13,"ErrWithContext",1229],[13,"Io",1229],[8,"InputTextIndex",1233],[8,"PluginCategory",1294],[13,"Libloading",1324],[8,"EditConnectionCostPlugin",1326],[8,"SplitSentences",1478]],"b":[[35,"impl-Debug-for-Mode"],[36,"impl-Display-for-Mode"],[329,"impl-Debug-for-ConfigError"],[330,"impl-Display-for-ConfigError"],[335,"impl-From%3CError%3E-for-ConfigError"],[336,"impl-From%3CError%3E-for-ConfigError"],[502,"impl-Display-for-DicBuildError"],[503,"impl-Debug-for-DicBuildError"],[504,"impl-Debug-for-BuildFailure"],[505,"impl-Display-for-BuildFailure"],[564,"impl-Flags-for-CategoryType"],[565,"impl-CategoryType"],[583,"impl-LowerHex-for-CategoryType"],[584,"impl-UpperHex-for-CategoryType"],[585,"impl-Octal-for-CategoryType"],[586,"impl-Debug-for-CategoryType"],[587,"impl-Binary-for-CategoryType"],[590,"impl-Flags-for-CategoryType"],[591,"impl-CategoryType"],[638,"impl-Display-for-Error"],[639,"impl-Debug-for-Error"],[684,"impl-JapaneseDictionary"],[685,"impl-DictionaryAccess-for-JapaneseDictionary"],[688,"impl-DictionaryAccess-for-JapaneseDictionary"],[689,"impl-JapaneseDictionary"],[775,"impl-Debug-for-HeaderError"],[776,"impl-Display-for-HeaderError"],[1006,"impl-Display-for-LexiconSetError"],[1007,"impl-Debug-for-LexiconSetError"],[1071,"impl-Flags-for-InfoSubset"],[1072,"impl-InfoSubset"],[1089,"impl-Binary-for-InfoSubset"],[1090,"impl-LowerHex-for-InfoSubset"],[1091,"impl-Octal-for-InfoSubset"],[1092,"impl-UpperHex-for-InfoSubset"],[1093,"impl-Debug-for-InfoSubset"],[1096,"impl-InfoSubset"],[1097,"impl-Flags-for-InfoSubset"],[1141,"impl-Debug-for-WordId"],[1142,"impl-Display-for-WordId"],[1200,"impl-Debug-for-SudachiError"],[1201,"impl-Display-for-SudachiError"],[1203,"impl-From%3CDicBuildError%3E-for-SudachiError"],[1204,"impl-From%3CError%3E-for-SudachiError"],[1205,"impl-From%3CError%3E-for-SudachiError"],[1206,"impl-From%3CError%3E-for-SudachiError"],[1207,"impl-From%3CParseIntError%3E-for-SudachiError"],[1208,"impl-From%3CHeaderError%3E-for-SudachiError"],[1209,"impl-From%3CError%3E-for-SudachiError"],[1210,"impl-From%3CConfigError%3E-for-SudachiError"],[1211,"impl-From%3CPluginError%3E-for-SudachiError"],[1213,"impl-From%3CErr%3CSudachiNomError%3CI%3E%3E%3E-for-SudachiError"],[1214,"impl-From%3CFromUtf16Error%3E-for-SudachiError"],[1215,"impl-From%3CLexiconSetError%3E-for-SudachiError"],[1309,"impl-Debug-for-PluginError"],[1310,"impl-Display-for-PluginError"],[1312,"impl-From%3CError%3E-for-PluginError"],[1313,"impl-From%3CError%3E-for-PluginError"],[1314,"impl-From%3CError%3E-for-PluginError"]]}\ }'); if (typeof window !== 'undefined' && window.initSearch) {window.initSearch(searchIndex)}; if (typeof exports !== 'undefined') {exports.searchIndex = searchIndex}; diff --git a/rust/settings.html b/rust/settings.html index d295bd59..18cbaedb 100644 --- a/rust/settings.html +++ b/rust/settings.html @@ -1 +1 @@ -Rustdoc settings

Rustdoc settings

Back
\ No newline at end of file +Settings

Rustdoc settings

Back
\ No newline at end of file diff --git a/rust/src/sudachi/analysis/created.rs.html b/rust/src/sudachi/analysis/created.rs.html index 4013ad62..670ee237 100644 --- a/rust/src/sudachi/analysis/created.rs.html +++ b/rust/src/sudachi/analysis/created.rs.html @@ -1,4 +1,4 @@ -created.rs - source
1
+created.rs - source
1
 2
 3
 4
diff --git a/rust/src/sudachi/analysis/inner.rs.html b/rust/src/sudachi/analysis/inner.rs.html
index 0d74404d..47c1e203 100644
--- a/rust/src/sudachi/analysis/inner.rs.html
+++ b/rust/src/sudachi/analysis/inner.rs.html
@@ -1,4 +1,4 @@
-inner.rs - source
1
+inner.rs - source
1
 2
 3
 4
diff --git a/rust/src/sudachi/analysis/lattice.rs.html b/rust/src/sudachi/analysis/lattice.rs.html
index a1ecd39d..06f3fdb2 100644
--- a/rust/src/sudachi/analysis/lattice.rs.html
+++ b/rust/src/sudachi/analysis/lattice.rs.html
@@ -1,4 +1,4 @@
-lattice.rs - source
1
+lattice.rs - source
1
 2
 3
 4
diff --git a/rust/src/sudachi/analysis/mlist.rs.html b/rust/src/sudachi/analysis/mlist.rs.html
index d18b4fe9..74006204 100644
--- a/rust/src/sudachi/analysis/mlist.rs.html
+++ b/rust/src/sudachi/analysis/mlist.rs.html
@@ -1,4 +1,4 @@
-mlist.rs - source
1
+mlist.rs - source
1
 2
 3
 4
diff --git a/rust/src/sudachi/analysis/mod.rs.html b/rust/src/sudachi/analysis/mod.rs.html
index 047b2d1d..9b2173f1 100644
--- a/rust/src/sudachi/analysis/mod.rs.html
+++ b/rust/src/sudachi/analysis/mod.rs.html
@@ -1,4 +1,4 @@
-mod.rs - source
1
+mod.rs - source
1
 2
 3
 4
diff --git a/rust/src/sudachi/analysis/morpheme.rs.html b/rust/src/sudachi/analysis/morpheme.rs.html
index 269bdef6..a2db277e 100644
--- a/rust/src/sudachi/analysis/morpheme.rs.html
+++ b/rust/src/sudachi/analysis/morpheme.rs.html
@@ -1,4 +1,4 @@
-morpheme.rs - source
1
+morpheme.rs - source
1
 2
 3
 4
diff --git a/rust/src/sudachi/analysis/node.rs.html b/rust/src/sudachi/analysis/node.rs.html
index 9eb43872..8618117c 100644
--- a/rust/src/sudachi/analysis/node.rs.html
+++ b/rust/src/sudachi/analysis/node.rs.html
@@ -1,4 +1,4 @@
-node.rs - source
1
+node.rs - source
1
 2
 3
 4
diff --git a/rust/src/sudachi/analysis/stateful_tokenizer.rs.html b/rust/src/sudachi/analysis/stateful_tokenizer.rs.html
index ba0d41df..28bfb511 100644
--- a/rust/src/sudachi/analysis/stateful_tokenizer.rs.html
+++ b/rust/src/sudachi/analysis/stateful_tokenizer.rs.html
@@ -1,4 +1,4 @@
-stateful_tokenizer.rs - source
1
+stateful_tokenizer.rs - source
1
 2
 3
 4
diff --git a/rust/src/sudachi/analysis/stateless_tokenizer.rs.html b/rust/src/sudachi/analysis/stateless_tokenizer.rs.html
index f693f2e3..8709623c 100644
--- a/rust/src/sudachi/analysis/stateless_tokenizer.rs.html
+++ b/rust/src/sudachi/analysis/stateless_tokenizer.rs.html
@@ -1,4 +1,4 @@
-stateless_tokenizer.rs - source
1
+stateless_tokenizer.rs - source
1
 2
 3
 4
diff --git a/rust/src/sudachi/config.rs.html b/rust/src/sudachi/config.rs.html
index 74349bca..b23a661c 100644
--- a/rust/src/sudachi/config.rs.html
+++ b/rust/src/sudachi/config.rs.html
@@ -1,4 +1,4 @@
-config.rs - source
1
+config.rs - source
1
 2
 3
 4
diff --git a/rust/src/sudachi/dic/build/conn.rs.html b/rust/src/sudachi/dic/build/conn.rs.html
index 14c5d96b..1c36d983 100644
--- a/rust/src/sudachi/dic/build/conn.rs.html
+++ b/rust/src/sudachi/dic/build/conn.rs.html
@@ -1,4 +1,4 @@
-conn.rs - source
1
+conn.rs - source
1
 2
 3
 4
diff --git a/rust/src/sudachi/dic/build/error.rs.html b/rust/src/sudachi/dic/build/error.rs.html
index 559e8416..301d083a 100644
--- a/rust/src/sudachi/dic/build/error.rs.html
+++ b/rust/src/sudachi/dic/build/error.rs.html
@@ -1,4 +1,4 @@
-error.rs - source
1
+error.rs - source
1
 2
 3
 4
diff --git a/rust/src/sudachi/dic/build/index.rs.html b/rust/src/sudachi/dic/build/index.rs.html
index 0b52ed0e..581b2f06 100644
--- a/rust/src/sudachi/dic/build/index.rs.html
+++ b/rust/src/sudachi/dic/build/index.rs.html
@@ -1,4 +1,4 @@
-index.rs - source
1
+index.rs - source
1
 2
 3
 4
diff --git a/rust/src/sudachi/dic/build/lexicon.rs.html b/rust/src/sudachi/dic/build/lexicon.rs.html
index 66076955..833f272d 100644
--- a/rust/src/sudachi/dic/build/lexicon.rs.html
+++ b/rust/src/sudachi/dic/build/lexicon.rs.html
@@ -1,4 +1,4 @@
-lexicon.rs - source
1
+lexicon.rs - source
1
 2
 3
 4
diff --git a/rust/src/sudachi/dic/build/mod.rs.html b/rust/src/sudachi/dic/build/mod.rs.html
index 620fda4f..f374e3ae 100644
--- a/rust/src/sudachi/dic/build/mod.rs.html
+++ b/rust/src/sudachi/dic/build/mod.rs.html
@@ -1,4 +1,4 @@
-mod.rs - source
1
+mod.rs - source
1
 2
 3
 4
diff --git a/rust/src/sudachi/dic/build/parse.rs.html b/rust/src/sudachi/dic/build/parse.rs.html
index a25bc1f5..a171fd78 100644
--- a/rust/src/sudachi/dic/build/parse.rs.html
+++ b/rust/src/sudachi/dic/build/parse.rs.html
@@ -1,4 +1,4 @@
-parse.rs - source
1
+parse.rs - source
1
 2
 3
 4
diff --git a/rust/src/sudachi/dic/build/primitives.rs.html b/rust/src/sudachi/dic/build/primitives.rs.html
index 58e1c390..0dfb30d6 100644
--- a/rust/src/sudachi/dic/build/primitives.rs.html
+++ b/rust/src/sudachi/dic/build/primitives.rs.html
@@ -1,4 +1,4 @@
-primitives.rs - source
1
+primitives.rs - source
1
 2
 3
 4
diff --git a/rust/src/sudachi/dic/build/report.rs.html b/rust/src/sudachi/dic/build/report.rs.html
index fc87b650..1ed7451b 100644
--- a/rust/src/sudachi/dic/build/report.rs.html
+++ b/rust/src/sudachi/dic/build/report.rs.html
@@ -1,4 +1,4 @@
-report.rs - source
1
+report.rs - source
1
 2
 3
 4
diff --git a/rust/src/sudachi/dic/build/resolve.rs.html b/rust/src/sudachi/dic/build/resolve.rs.html
index 1a3f2113..d7554533 100644
--- a/rust/src/sudachi/dic/build/resolve.rs.html
+++ b/rust/src/sudachi/dic/build/resolve.rs.html
@@ -1,4 +1,4 @@
-resolve.rs - source
1
+resolve.rs - source
1
 2
 3
 4
diff --git a/rust/src/sudachi/dic/category_type.rs.html b/rust/src/sudachi/dic/category_type.rs.html
index 3b900ba5..c3bb39f9 100644
--- a/rust/src/sudachi/dic/category_type.rs.html
+++ b/rust/src/sudachi/dic/category_type.rs.html
@@ -1,4 +1,4 @@
-category_type.rs - source
1
+category_type.rs - source
1
 2
 3
 4
diff --git a/rust/src/sudachi/dic/character_category.rs.html b/rust/src/sudachi/dic/character_category.rs.html
index 841f6af3..5d557667 100644
--- a/rust/src/sudachi/dic/character_category.rs.html
+++ b/rust/src/sudachi/dic/character_category.rs.html
@@ -1,4 +1,4 @@
-character_category.rs - source
1
+character_category.rs - source
1
 2
 3
 4
diff --git a/rust/src/sudachi/dic/connect.rs.html b/rust/src/sudachi/dic/connect.rs.html
index bc950e03..2a4c1081 100644
--- a/rust/src/sudachi/dic/connect.rs.html
+++ b/rust/src/sudachi/dic/connect.rs.html
@@ -1,4 +1,4 @@
-connect.rs - source
1
+connect.rs - source
1
 2
 3
 4
diff --git a/rust/src/sudachi/dic/dictionary.rs.html b/rust/src/sudachi/dic/dictionary.rs.html
index 72da5a9a..e405e434 100644
--- a/rust/src/sudachi/dic/dictionary.rs.html
+++ b/rust/src/sudachi/dic/dictionary.rs.html
@@ -1,4 +1,4 @@
-dictionary.rs - source
1
+dictionary.rs - source
1
 2
 3
 4
diff --git a/rust/src/sudachi/dic/grammar.rs.html b/rust/src/sudachi/dic/grammar.rs.html
index 44fb3a44..86ac4d67 100644
--- a/rust/src/sudachi/dic/grammar.rs.html
+++ b/rust/src/sudachi/dic/grammar.rs.html
@@ -1,4 +1,4 @@
-grammar.rs - source
1
+grammar.rs - source
1
 2
 3
 4
diff --git a/rust/src/sudachi/dic/header.rs.html b/rust/src/sudachi/dic/header.rs.html
index 0698f8ad..74a970c6 100644
--- a/rust/src/sudachi/dic/header.rs.html
+++ b/rust/src/sudachi/dic/header.rs.html
@@ -1,4 +1,4 @@
-header.rs - source
1
+header.rs - source
1
 2
 3
 4
diff --git a/rust/src/sudachi/dic/lexicon/mod.rs.html b/rust/src/sudachi/dic/lexicon/mod.rs.html
index e1eb11ed..c6df30b7 100644
--- a/rust/src/sudachi/dic/lexicon/mod.rs.html
+++ b/rust/src/sudachi/dic/lexicon/mod.rs.html
@@ -1,4 +1,4 @@
-mod.rs - source
1
+mod.rs - source
1
 2
 3
 4
diff --git a/rust/src/sudachi/dic/lexicon/trie.rs.html b/rust/src/sudachi/dic/lexicon/trie.rs.html
index a59b1197..cd647b70 100644
--- a/rust/src/sudachi/dic/lexicon/trie.rs.html
+++ b/rust/src/sudachi/dic/lexicon/trie.rs.html
@@ -1,4 +1,4 @@
-trie.rs - source
1
+trie.rs - source
1
 2
 3
 4
diff --git a/rust/src/sudachi/dic/lexicon/word_id_table.rs.html b/rust/src/sudachi/dic/lexicon/word_id_table.rs.html
index a253213e..42a2d36d 100644
--- a/rust/src/sudachi/dic/lexicon/word_id_table.rs.html
+++ b/rust/src/sudachi/dic/lexicon/word_id_table.rs.html
@@ -1,4 +1,4 @@
-word_id_table.rs - source
1
+word_id_table.rs - source
1
 2
 3
 4
diff --git a/rust/src/sudachi/dic/lexicon/word_infos.rs.html b/rust/src/sudachi/dic/lexicon/word_infos.rs.html
index ad48e142..f8c80eda 100644
--- a/rust/src/sudachi/dic/lexicon/word_infos.rs.html
+++ b/rust/src/sudachi/dic/lexicon/word_infos.rs.html
@@ -1,4 +1,4 @@
-word_infos.rs - source
1
+word_infos.rs - source
1
 2
 3
 4
diff --git a/rust/src/sudachi/dic/lexicon/word_params.rs.html b/rust/src/sudachi/dic/lexicon/word_params.rs.html
index f84ed75f..8fd69766 100644
--- a/rust/src/sudachi/dic/lexicon/word_params.rs.html
+++ b/rust/src/sudachi/dic/lexicon/word_params.rs.html
@@ -1,4 +1,4 @@
-word_params.rs - source
1
+word_params.rs - source
1
 2
 3
 4
diff --git a/rust/src/sudachi/dic/lexicon_set.rs.html b/rust/src/sudachi/dic/lexicon_set.rs.html
index 386eae08..da24de31 100644
--- a/rust/src/sudachi/dic/lexicon_set.rs.html
+++ b/rust/src/sudachi/dic/lexicon_set.rs.html
@@ -1,4 +1,4 @@
-lexicon_set.rs - source
1
+lexicon_set.rs - source
1
 2
 3
 4
diff --git a/rust/src/sudachi/dic/mod.rs.html b/rust/src/sudachi/dic/mod.rs.html
index 3e68fbfb..d71d3777 100644
--- a/rust/src/sudachi/dic/mod.rs.html
+++ b/rust/src/sudachi/dic/mod.rs.html
@@ -1,4 +1,4 @@
-mod.rs - source
1
+mod.rs - source
1
 2
 3
 4
diff --git a/rust/src/sudachi/dic/read/mod.rs.html b/rust/src/sudachi/dic/read/mod.rs.html
index b775027f..7198ad47 100644
--- a/rust/src/sudachi/dic/read/mod.rs.html
+++ b/rust/src/sudachi/dic/read/mod.rs.html
@@ -1,4 +1,4 @@
-mod.rs - source
1
+mod.rs - source
1
 2
 3
 4
diff --git a/rust/src/sudachi/dic/read/u16str.rs.html b/rust/src/sudachi/dic/read/u16str.rs.html
index b9758d10..a0a4c151 100644
--- a/rust/src/sudachi/dic/read/u16str.rs.html
+++ b/rust/src/sudachi/dic/read/u16str.rs.html
@@ -1,4 +1,4 @@
-u16str.rs - source
1
+u16str.rs - source
1
 2
 3
 4
diff --git a/rust/src/sudachi/dic/read/word_info.rs.html b/rust/src/sudachi/dic/read/word_info.rs.html
index 8e9148e8..8d3219ca 100644
--- a/rust/src/sudachi/dic/read/word_info.rs.html
+++ b/rust/src/sudachi/dic/read/word_info.rs.html
@@ -1,4 +1,4 @@
-word_info.rs - source
1
+word_info.rs - source
1
 2
 3
 4
diff --git a/rust/src/sudachi/dic/storage.rs.html b/rust/src/sudachi/dic/storage.rs.html
index f6999e4a..d711b1de 100644
--- a/rust/src/sudachi/dic/storage.rs.html
+++ b/rust/src/sudachi/dic/storage.rs.html
@@ -1,4 +1,4 @@
-storage.rs - source
1
+storage.rs - source
1
 2
 3
 4
diff --git a/rust/src/sudachi/dic/subset.rs.html b/rust/src/sudachi/dic/subset.rs.html
index a6200767..36f4f249 100644
--- a/rust/src/sudachi/dic/subset.rs.html
+++ b/rust/src/sudachi/dic/subset.rs.html
@@ -1,4 +1,4 @@
-subset.rs - source
1
+subset.rs - source
1
 2
 3
 4
diff --git a/rust/src/sudachi/dic/word_id.rs.html b/rust/src/sudachi/dic/word_id.rs.html
index c9268822..3ca447b4 100644
--- a/rust/src/sudachi/dic/word_id.rs.html
+++ b/rust/src/sudachi/dic/word_id.rs.html
@@ -1,4 +1,4 @@
-word_id.rs - source
1
+word_id.rs - source
1
 2
 3
 4
diff --git a/rust/src/sudachi/error.rs.html b/rust/src/sudachi/error.rs.html
index 54a48cf4..2a1e1ff4 100644
--- a/rust/src/sudachi/error.rs.html
+++ b/rust/src/sudachi/error.rs.html
@@ -1,4 +1,4 @@
-error.rs - source
1
+error.rs - source
1
 2
 3
 4
diff --git a/rust/src/sudachi/hash.rs.html b/rust/src/sudachi/hash.rs.html
index a8ad4bdf..07e5915c 100644
--- a/rust/src/sudachi/hash.rs.html
+++ b/rust/src/sudachi/hash.rs.html
@@ -1,4 +1,4 @@
-hash.rs - source
1
+hash.rs - source
1
 2
 3
 4
diff --git a/rust/src/sudachi/input_text/buffer/edit.rs.html b/rust/src/sudachi/input_text/buffer/edit.rs.html
index 17849a8e..f2f8d896 100644
--- a/rust/src/sudachi/input_text/buffer/edit.rs.html
+++ b/rust/src/sudachi/input_text/buffer/edit.rs.html
@@ -1,4 +1,4 @@
-edit.rs - source
1
+edit.rs - source
1
 2
 3
 4
diff --git a/rust/src/sudachi/input_text/buffer/mod.rs.html b/rust/src/sudachi/input_text/buffer/mod.rs.html
index 65f7b26e..0ff9c3b8 100644
--- a/rust/src/sudachi/input_text/buffer/mod.rs.html
+++ b/rust/src/sudachi/input_text/buffer/mod.rs.html
@@ -1,4 +1,4 @@
-mod.rs - source
1
+mod.rs - source
1
 2
 3
 4
diff --git a/rust/src/sudachi/input_text/mod.rs.html b/rust/src/sudachi/input_text/mod.rs.html
index 1f751e90..523865fe 100644
--- a/rust/src/sudachi/input_text/mod.rs.html
+++ b/rust/src/sudachi/input_text/mod.rs.html
@@ -1,4 +1,4 @@
-mod.rs - source
1
+mod.rs - source
1
 2
 3
 4
diff --git a/rust/src/sudachi/lib.rs.html b/rust/src/sudachi/lib.rs.html
index 2270031f..9df6da9a 100644
--- a/rust/src/sudachi/lib.rs.html
+++ b/rust/src/sudachi/lib.rs.html
@@ -1,4 +1,4 @@
-lib.rs - source
1
+lib.rs - source
1
 2
 3
 4
diff --git a/rust/src/sudachi/plugin/connect_cost/inhibit_connection.rs.html b/rust/src/sudachi/plugin/connect_cost/inhibit_connection.rs.html
index a8b7e9f2..43f759e1 100644
--- a/rust/src/sudachi/plugin/connect_cost/inhibit_connection.rs.html
+++ b/rust/src/sudachi/plugin/connect_cost/inhibit_connection.rs.html
@@ -1,4 +1,4 @@
-inhibit_connection.rs - source
1
+inhibit_connection.rs - source
1
 2
 3
 4
diff --git a/rust/src/sudachi/plugin/connect_cost/mod.rs.html b/rust/src/sudachi/plugin/connect_cost/mod.rs.html
index dac8fce1..7957c476 100644
--- a/rust/src/sudachi/plugin/connect_cost/mod.rs.html
+++ b/rust/src/sudachi/plugin/connect_cost/mod.rs.html
@@ -1,4 +1,4 @@
-mod.rs - source
1
+mod.rs - source
1
 2
 3
 4
diff --git a/rust/src/sudachi/plugin/dso.rs.html b/rust/src/sudachi/plugin/dso.rs.html
index f1c3fd9a..5aec8da9 100644
--- a/rust/src/sudachi/plugin/dso.rs.html
+++ b/rust/src/sudachi/plugin/dso.rs.html
@@ -1,4 +1,4 @@
-dso.rs - source
1
+dso.rs - source
1
 2
 3
 4
diff --git a/rust/src/sudachi/plugin/input_text/default_input_text/mod.rs.html b/rust/src/sudachi/plugin/input_text/default_input_text/mod.rs.html
index 800dda54..f6bcca4b 100644
--- a/rust/src/sudachi/plugin/input_text/default_input_text/mod.rs.html
+++ b/rust/src/sudachi/plugin/input_text/default_input_text/mod.rs.html
@@ -1,4 +1,4 @@
-mod.rs - source
1
+mod.rs - source
1
 2
 3
 4
diff --git a/rust/src/sudachi/plugin/input_text/ignore_yomigana/mod.rs.html b/rust/src/sudachi/plugin/input_text/ignore_yomigana/mod.rs.html
index 46c2dfbd..da122e38 100644
--- a/rust/src/sudachi/plugin/input_text/ignore_yomigana/mod.rs.html
+++ b/rust/src/sudachi/plugin/input_text/ignore_yomigana/mod.rs.html
@@ -1,4 +1,4 @@
-mod.rs - source
1
+mod.rs - source
1
 2
 3
 4
diff --git a/rust/src/sudachi/plugin/input_text/mod.rs.html b/rust/src/sudachi/plugin/input_text/mod.rs.html
index a779e58d..deb9235d 100644
--- a/rust/src/sudachi/plugin/input_text/mod.rs.html
+++ b/rust/src/sudachi/plugin/input_text/mod.rs.html
@@ -1,4 +1,4 @@
-mod.rs - source
1
+mod.rs - source
1
 2
 3
 4
diff --git a/rust/src/sudachi/plugin/input_text/prolonged_sound_mark/mod.rs.html b/rust/src/sudachi/plugin/input_text/prolonged_sound_mark/mod.rs.html
index 36081578..c1afe1bd 100644
--- a/rust/src/sudachi/plugin/input_text/prolonged_sound_mark/mod.rs.html
+++ b/rust/src/sudachi/plugin/input_text/prolonged_sound_mark/mod.rs.html
@@ -1,4 +1,4 @@
-mod.rs - source
1
+mod.rs - source
1
 2
 3
 4
diff --git a/rust/src/sudachi/plugin/loader.rs.html b/rust/src/sudachi/plugin/loader.rs.html
index e14834bf..129f86ef 100644
--- a/rust/src/sudachi/plugin/loader.rs.html
+++ b/rust/src/sudachi/plugin/loader.rs.html
@@ -1,4 +1,4 @@
-loader.rs - source
1
+loader.rs - source
1
 2
 3
 4
diff --git a/rust/src/sudachi/plugin/mod.rs.html b/rust/src/sudachi/plugin/mod.rs.html
index 5ba856be..61970383 100644
--- a/rust/src/sudachi/plugin/mod.rs.html
+++ b/rust/src/sudachi/plugin/mod.rs.html
@@ -1,4 +1,4 @@
-mod.rs - source
1
+mod.rs - source
1
 2
 3
 4
diff --git a/rust/src/sudachi/plugin/oov/mecab_oov/mod.rs.html b/rust/src/sudachi/plugin/oov/mecab_oov/mod.rs.html
index 51a3546e..9caaa3da 100644
--- a/rust/src/sudachi/plugin/oov/mecab_oov/mod.rs.html
+++ b/rust/src/sudachi/plugin/oov/mecab_oov/mod.rs.html
@@ -1,4 +1,4 @@
-mod.rs - source
1
+mod.rs - source
1
 2
 3
 4
diff --git a/rust/src/sudachi/plugin/oov/mod.rs.html b/rust/src/sudachi/plugin/oov/mod.rs.html
index bb885b98..6359bf0e 100644
--- a/rust/src/sudachi/plugin/oov/mod.rs.html
+++ b/rust/src/sudachi/plugin/oov/mod.rs.html
@@ -1,4 +1,4 @@
-mod.rs - source
1
+mod.rs - source
1
 2
 3
 4
diff --git a/rust/src/sudachi/plugin/oov/regex_oov/mod.rs.html b/rust/src/sudachi/plugin/oov/regex_oov/mod.rs.html
index c0645422..0ed938c0 100644
--- a/rust/src/sudachi/plugin/oov/regex_oov/mod.rs.html
+++ b/rust/src/sudachi/plugin/oov/regex_oov/mod.rs.html
@@ -1,4 +1,4 @@
-mod.rs - source
1
+mod.rs - source
1
 2
 3
 4
diff --git a/rust/src/sudachi/plugin/oov/simple_oov/mod.rs.html b/rust/src/sudachi/plugin/oov/simple_oov/mod.rs.html
index cd01d4d3..00c25cf4 100644
--- a/rust/src/sudachi/plugin/oov/simple_oov/mod.rs.html
+++ b/rust/src/sudachi/plugin/oov/simple_oov/mod.rs.html
@@ -1,4 +1,4 @@
-mod.rs - source
1
+mod.rs - source
1
 2
 3
 4
diff --git a/rust/src/sudachi/plugin/path_rewrite/join_katakana_oov/mod.rs.html b/rust/src/sudachi/plugin/path_rewrite/join_katakana_oov/mod.rs.html
index 5547ea64..131a9055 100644
--- a/rust/src/sudachi/plugin/path_rewrite/join_katakana_oov/mod.rs.html
+++ b/rust/src/sudachi/plugin/path_rewrite/join_katakana_oov/mod.rs.html
@@ -1,4 +1,4 @@
-mod.rs - source
1
+mod.rs - source
1
 2
 3
 4
diff --git a/rust/src/sudachi/plugin/path_rewrite/join_numeric/mod.rs.html b/rust/src/sudachi/plugin/path_rewrite/join_numeric/mod.rs.html
index 6f0a4459..a0bc6f12 100644
--- a/rust/src/sudachi/plugin/path_rewrite/join_numeric/mod.rs.html
+++ b/rust/src/sudachi/plugin/path_rewrite/join_numeric/mod.rs.html
@@ -1,4 +1,4 @@
-mod.rs - source
1
+mod.rs - source
1
 2
 3
 4
diff --git a/rust/src/sudachi/plugin/path_rewrite/join_numeric/numeric_parser/mod.rs.html b/rust/src/sudachi/plugin/path_rewrite/join_numeric/numeric_parser/mod.rs.html
index 3beb85dc..d324f4e2 100644
--- a/rust/src/sudachi/plugin/path_rewrite/join_numeric/numeric_parser/mod.rs.html
+++ b/rust/src/sudachi/plugin/path_rewrite/join_numeric/numeric_parser/mod.rs.html
@@ -1,4 +1,4 @@
-mod.rs - source
1
+mod.rs - source
1
 2
 3
 4
diff --git a/rust/src/sudachi/plugin/path_rewrite/join_numeric/numeric_parser/string_number.rs.html b/rust/src/sudachi/plugin/path_rewrite/join_numeric/numeric_parser/string_number.rs.html
index 23153f31..7c61e1d3 100644
--- a/rust/src/sudachi/plugin/path_rewrite/join_numeric/numeric_parser/string_number.rs.html
+++ b/rust/src/sudachi/plugin/path_rewrite/join_numeric/numeric_parser/string_number.rs.html
@@ -1,4 +1,4 @@
-string_number.rs - source
1
+string_number.rs - source
1
 2
 3
 4
diff --git a/rust/src/sudachi/plugin/path_rewrite/mod.rs.html b/rust/src/sudachi/plugin/path_rewrite/mod.rs.html
index 316a6841..3a118f1c 100644
--- a/rust/src/sudachi/plugin/path_rewrite/mod.rs.html
+++ b/rust/src/sudachi/plugin/path_rewrite/mod.rs.html
@@ -1,4 +1,4 @@
-mod.rs - source
1
+mod.rs - source
1
 2
 3
 4
diff --git a/rust/src/sudachi/pos.rs.html b/rust/src/sudachi/pos.rs.html
index 3d5cf685..a174c277 100644
--- a/rust/src/sudachi/pos.rs.html
+++ b/rust/src/sudachi/pos.rs.html
@@ -1,4 +1,4 @@
-pos.rs - source
1
+pos.rs - source
1
 2
 3
 4
diff --git a/rust/src/sudachi/sentence_detector.rs.html b/rust/src/sudachi/sentence_detector.rs.html
index fa45b048..d2338199 100644
--- a/rust/src/sudachi/sentence_detector.rs.html
+++ b/rust/src/sudachi/sentence_detector.rs.html
@@ -1,4 +1,4 @@
-sentence_detector.rs - source
1
+sentence_detector.rs - source
1
 2
 3
 4
diff --git a/rust/src/sudachi/sentence_splitter.rs.html b/rust/src/sudachi/sentence_splitter.rs.html
index ebda3b71..df563878 100644
--- a/rust/src/sudachi/sentence_splitter.rs.html
+++ b/rust/src/sudachi/sentence_splitter.rs.html
@@ -1,4 +1,4 @@
-sentence_splitter.rs - source
1
+sentence_splitter.rs - source
1
 2
 3
 4
diff --git a/rust/src/sudachi/util/check_params.rs.html b/rust/src/sudachi/util/check_params.rs.html
index e3328c13..86104f9e 100644
--- a/rust/src/sudachi/util/check_params.rs.html
+++ b/rust/src/sudachi/util/check_params.rs.html
@@ -1,4 +1,4 @@
-check_params.rs - source
1
+check_params.rs - source
1
 2
 3
 4
diff --git a/rust/src/sudachi/util/cow_array.rs.html b/rust/src/sudachi/util/cow_array.rs.html
index d8ce916a..42dd04cf 100644
--- a/rust/src/sudachi/util/cow_array.rs.html
+++ b/rust/src/sudachi/util/cow_array.rs.html
@@ -1,4 +1,4 @@
-cow_array.rs - source
1
+cow_array.rs - source
1
 2
 3
 4
diff --git a/rust/src/sudachi/util/fxhash.rs.html b/rust/src/sudachi/util/fxhash.rs.html
index 5728cca6..edfb5a5e 100644
--- a/rust/src/sudachi/util/fxhash.rs.html
+++ b/rust/src/sudachi/util/fxhash.rs.html
@@ -1,4 +1,4 @@
-fxhash.rs - source
1
+fxhash.rs - source
1
 2
 3
 4
diff --git a/rust/src/sudachi/util/mod.rs.html b/rust/src/sudachi/util/mod.rs.html
index 883b98de..df38f460 100644
--- a/rust/src/sudachi/util/mod.rs.html
+++ b/rust/src/sudachi/util/mod.rs.html
@@ -1,4 +1,4 @@
-mod.rs - source
1
+mod.rs - source
1
 2
 3
 4
diff --git a/rust/src/sudachi/util/user_pos.rs.html b/rust/src/sudachi/util/user_pos.rs.html
index 7a7c09e4..49f73ef1 100644
--- a/rust/src/sudachi/util/user_pos.rs.html
+++ b/rust/src/sudachi/util/user_pos.rs.html
@@ -1,4 +1,4 @@
-user_pos.rs - source
1
+user_pos.rs - source
1
 2
 3
 4
diff --git a/rust/static.files/main-9dd44ab47b99a0fb.js b/rust/static.files/main-9dd44ab47b99a0fb.js
new file mode 100644
index 00000000..cfb9a38f
--- /dev/null
+++ b/rust/static.files/main-9dd44ab47b99a0fb.js
@@ -0,0 +1,12 @@
+"use strict";window.RUSTDOC_TOOLTIP_HOVER_MS=300;window.RUSTDOC_TOOLTIP_HOVER_EXIT_MS=450;function resourcePath(basename,extension){return getVar("root-path")+basename+getVar("resource-suffix")+extension}function hideMain(){addClass(document.getElementById(MAIN_ID),"hidden")}function showMain(){removeClass(document.getElementById(MAIN_ID),"hidden")}function elemIsInParent(elem,parent){while(elem&&elem!==document.body){if(elem===parent){return true}elem=elem.parentElement}return false}function blurHandler(event,parentElem,hideCallback){if(!elemIsInParent(document.activeElement,parentElem)&&!elemIsInParent(event.relatedTarget,parentElem)){hideCallback()}}window.rootPath=getVar("root-path");window.currentCrate=getVar("current-crate");function setMobileTopbar(){const mobileTopbar=document.querySelector(".mobile-topbar");const locationTitle=document.querySelector(".sidebar h2.location");if(mobileTopbar){const mobileTitle=document.createElement("h2");mobileTitle.className="location";if(hasClass(document.body,"crate")){mobileTitle.innerText=`Crate ${window.currentCrate}`}else if(locationTitle){mobileTitle.innerHTML=locationTitle.innerHTML}mobileTopbar.appendChild(mobileTitle)}}function getVirtualKey(ev){if("key"in ev&&typeof ev.key!=="undefined"){return ev.key}const c=ev.charCode||ev.keyCode;if(c===27){return"Escape"}return String.fromCharCode(c)}const MAIN_ID="main-content";const SETTINGS_BUTTON_ID="settings-menu";const ALTERNATIVE_DISPLAY_ID="alternative-display";const NOT_DISPLAYED_ID="not-displayed";const HELP_BUTTON_ID="help-button";function getSettingsButton(){return document.getElementById(SETTINGS_BUTTON_ID)}function getHelpButton(){return document.getElementById(HELP_BUTTON_ID)}function getNakedUrl(){return window.location.href.split("?")[0].split("#")[0]}function insertAfter(newNode,referenceNode){referenceNode.parentNode.insertBefore(newNode,referenceNode.nextSibling)}function getOrCreateSection(id,classes){let el=document.getElementById(id);if(!el){el=document.createElement("section");el.id=id;el.className=classes;insertAfter(el,document.getElementById(MAIN_ID))}return el}function getAlternativeDisplayElem(){return getOrCreateSection(ALTERNATIVE_DISPLAY_ID,"content hidden")}function getNotDisplayedElem(){return getOrCreateSection(NOT_DISPLAYED_ID,"hidden")}function switchDisplayedElement(elemToDisplay){const el=getAlternativeDisplayElem();if(el.children.length>0){getNotDisplayedElem().appendChild(el.firstElementChild)}if(elemToDisplay===null){addClass(el,"hidden");showMain();return}el.appendChild(elemToDisplay);hideMain();removeClass(el,"hidden")}function browserSupportsHistoryApi(){return window.history&&typeof window.history.pushState==="function"}function preLoadCss(cssUrl){const link=document.createElement("link");link.href=cssUrl;link.rel="preload";link.as="style";document.getElementsByTagName("head")[0].appendChild(link)}(function(){const isHelpPage=window.location.pathname.endsWith("/help.html");function loadScript(url){const script=document.createElement("script");script.src=url;document.head.append(script)}getSettingsButton().onclick=event=>{if(event.ctrlKey||event.altKey||event.metaKey){return}window.hideAllModals(false);addClass(getSettingsButton(),"rotate");event.preventDefault();loadScript(getVar("static-root-path")+getVar("settings-js"));setTimeout(()=>{const themes=getVar("themes").split(",");for(const theme of themes){if(theme!==""){preLoadCss(getVar("root-path")+theme+".css")}}},0)};window.searchState={loadingText:"Loading search results...",input:document.getElementsByClassName("search-input")[0],outputElement:()=>{let el=document.getElementById("search");if(!el){el=document.createElement("section");el.id="search";getNotDisplayedElem().appendChild(el)}return el},title:document.title,titleBeforeSearch:document.title,timeout:null,currentTab:0,focusedByTab:[null,null,null],clearInputTimeout:()=>{if(searchState.timeout!==null){clearTimeout(searchState.timeout);searchState.timeout=null}},isDisplayed:()=>searchState.outputElement().parentElement.id===ALTERNATIVE_DISPLAY_ID,focus:()=>{searchState.input.focus()},defocus:()=>{searchState.input.blur()},showResults:search=>{if(search===null||typeof search==="undefined"){search=searchState.outputElement()}switchDisplayedElement(search);searchState.mouseMovedAfterSearch=false;document.title=searchState.title},removeQueryParameters:()=>{document.title=searchState.titleBeforeSearch;if(browserSupportsHistoryApi()){history.replaceState(null,"",getNakedUrl()+window.location.hash)}},hideResults:()=>{switchDisplayedElement(null);searchState.removeQueryParameters()},getQueryStringParams:()=>{const params={};window.location.search.substring(1).split("&").map(s=>{const pair=s.split("=");params[decodeURIComponent(pair[0])]=typeof pair[1]==="undefined"?null:decodeURIComponent(pair[1])});return params},setup:()=>{const search_input=searchState.input;if(!searchState.input){return}let searchLoaded=false;function loadSearch(){if(!searchLoaded){searchLoaded=true;loadScript(getVar("static-root-path")+getVar("search-js"));loadScript(resourcePath("search-index",".js"))}}search_input.addEventListener("focus",()=>{search_input.origPlaceholder=search_input.placeholder;search_input.placeholder="Type your search here.";loadSearch()});if(search_input.value!==""){loadSearch()}const params=searchState.getQueryStringParams();if(params.search!==undefined){searchState.setLoadingSearch();loadSearch()}},setLoadingSearch:()=>{const search=searchState.outputElement();search.innerHTML="

"+searchState.loadingText+"

";searchState.showResults(search)},};const toggleAllDocsId="toggle-all-docs";let savedHash="";function handleHashes(ev){if(ev!==null&&searchState.isDisplayed()&&ev.newURL){switchDisplayedElement(null);const hash=ev.newURL.slice(ev.newURL.indexOf("#")+1);if(browserSupportsHistoryApi()){history.replaceState(null,"",getNakedUrl()+window.location.search+"#"+hash)}const elem=document.getElementById(hash);if(elem){elem.scrollIntoView()}}const pageId=window.location.hash.replace(/^#/,"");if(savedHash!==pageId){savedHash=pageId;if(pageId!==""){expandSection(pageId)}}if(savedHash.startsWith("impl-")){const splitAt=savedHash.indexOf("/");if(splitAt!==-1){const implId=savedHash.slice(0,splitAt);const assocId=savedHash.slice(splitAt+1);const implElem=document.getElementById(implId);if(implElem&&implElem.parentElement.tagName==="SUMMARY"&&implElem.parentElement.parentElement.tagName==="DETAILS"){onEachLazy(implElem.parentElement.parentElement.querySelectorAll(`[id^="${assocId}"]`),item=>{const numbered=/([^-]+)-([0-9]+)/.exec(item.id);if(item.id===assocId||(numbered&&numbered[1]===assocId)){openParentDetails(item);item.scrollIntoView();setTimeout(()=>{window.location.replace("#"+item.id)},0)}})}}}}function onHashChange(ev){hideSidebar();handleHashes(ev)}function openParentDetails(elem){while(elem){if(elem.tagName==="DETAILS"){elem.open=true}elem=elem.parentNode}}function expandSection(id){openParentDetails(document.getElementById(id))}function handleEscape(ev){searchState.clearInputTimeout();searchState.hideResults();ev.preventDefault();searchState.defocus();window.hideAllModals(true)}function handleShortcut(ev){const disableShortcuts=getSettingValue("disable-shortcuts")==="true";if(ev.ctrlKey||ev.altKey||ev.metaKey||disableShortcuts){return}if(document.activeElement.tagName==="INPUT"&&document.activeElement.type!=="checkbox"&&document.activeElement.type!=="radio"){switch(getVirtualKey(ev)){case"Escape":handleEscape(ev);break}}else{switch(getVirtualKey(ev)){case"Escape":handleEscape(ev);break;case"s":case"S":ev.preventDefault();searchState.focus();break;case"+":ev.preventDefault();expandAllDocs();break;case"-":ev.preventDefault();collapseAllDocs();break;case"?":showHelp();break;default:break}}}document.addEventListener("keypress",handleShortcut);document.addEventListener("keydown",handleShortcut);function addSidebarItems(){if(!window.SIDEBAR_ITEMS){return}const sidebar=document.getElementsByClassName("sidebar-elems")[0];function block(shortty,id,longty){const filtered=window.SIDEBAR_ITEMS[shortty];if(!filtered){return}const modpath=hasClass(document.body,"mod")?"../":"";const h3=document.createElement("h3");h3.innerHTML=`${longty}`;const ul=document.createElement("ul");ul.className="block "+shortty;for(const name of filtered){let path;if(shortty==="mod"){path=`${modpath}${name}/index.html`}else{path=`${modpath}${shortty}.${name}.html`}let current_page=document.location.href.toString();if(current_page.endsWith("/")){current_page+="index.html"}const link=document.createElement("a");link.href=path;if(link.href===current_page){link.className="current"}link.textContent=name;const li=document.createElement("li");li.appendChild(link);ul.appendChild(li)}sidebar.appendChild(h3);sidebar.appendChild(ul)}if(sidebar){block("primitive","primitives","Primitive Types");block("mod","modules","Modules");block("macro","macros","Macros");block("struct","structs","Structs");block("enum","enums","Enums");block("constant","constants","Constants");block("static","static","Statics");block("trait","traits","Traits");block("fn","functions","Functions");block("type","types","Type Aliases");block("union","unions","Unions");block("foreigntype","foreign-types","Foreign Types");block("keyword","keywords","Keywords");block("opaque","opaque-types","Opaque Types");block("attr","attributes","Attribute Macros");block("derive","derives","Derive Macros");block("traitalias","trait-aliases","Trait Aliases")}}window.register_implementors=imp=>{const implementors=document.getElementById("implementors-list");const synthetic_implementors=document.getElementById("synthetic-implementors-list");const inlined_types=new Set();const TEXT_IDX=0;const SYNTHETIC_IDX=1;const TYPES_IDX=2;if(synthetic_implementors){onEachLazy(synthetic_implementors.getElementsByClassName("impl"),el=>{const aliases=el.getAttribute("data-aliases");if(!aliases){return}aliases.split(",").forEach(alias=>{inlined_types.add(alias)})})}let currentNbImpls=implementors.getElementsByClassName("impl").length;const traitName=document.querySelector(".main-heading h1 > .trait").textContent;const baseIdName="impl-"+traitName+"-";const libs=Object.getOwnPropertyNames(imp);const script=document.querySelector("script[data-ignore-extern-crates]");const ignoreExternCrates=new Set((script?script.getAttribute("data-ignore-extern-crates"):"").split(","));for(const lib of libs){if(lib===window.currentCrate||ignoreExternCrates.has(lib)){continue}const structs=imp[lib];struct_loop:for(const struct of structs){const list=struct[SYNTHETIC_IDX]?synthetic_implementors:implementors;if(struct[SYNTHETIC_IDX]){for(const struct_type of struct[TYPES_IDX]){if(inlined_types.has(struct_type)){continue struct_loop}inlined_types.add(struct_type)}}const code=document.createElement("h3");code.innerHTML=struct[TEXT_IDX];addClass(code,"code-header");onEachLazy(code.getElementsByTagName("a"),elem=>{const href=elem.getAttribute("href");if(href&&!href.startsWith("#")&&!/^(?:[a-z+]+:)?\/\//.test(href)){elem.setAttribute("href",window.rootPath+href)}});const currentId=baseIdName+currentNbImpls;const anchor=document.createElement("a");anchor.href="#"+currentId;addClass(anchor,"anchor");const display=document.createElement("div");display.id=currentId;addClass(display,"impl");display.appendChild(anchor);display.appendChild(code);list.appendChild(display);currentNbImpls+=1}}};if(window.pending_implementors){window.register_implementors(window.pending_implementors)}window.register_type_impls=imp=>{if(!imp||!imp[window.currentCrate]){return}window.pending_type_impls=null;const idMap=new Map();let implementations=document.getElementById("implementations-list");let trait_implementations=document.getElementById("trait-implementations-list");let trait_implementations_header=document.getElementById("trait-implementations");const script=document.querySelector("script[data-self-path]");const selfPath=script?script.getAttribute("data-self-path"):null;const mainContent=document.querySelector("#main-content");const sidebarSection=document.querySelector(".sidebar section");let methods=document.querySelector(".sidebar .block.method");let associatedTypes=document.querySelector(".sidebar .block.associatedtype");let associatedConstants=document.querySelector(".sidebar .block.associatedconstant");let sidebarTraitList=document.querySelector(".sidebar .block.trait-implementation");for(const impList of imp[window.currentCrate]){const types=impList.slice(2);const text=impList[0];const isTrait=impList[1]!==0;const traitName=impList[1];if(types.indexOf(selfPath)===-1){continue}let outputList=isTrait?trait_implementations:implementations;if(outputList===null){const outputListName=isTrait?"Trait Implementations":"Implementations";const outputListId=isTrait?"trait-implementations-list":"implementations-list";const outputListHeaderId=isTrait?"trait-implementations":"implementations";const outputListHeader=document.createElement("h2");outputListHeader.id=outputListHeaderId;outputListHeader.innerText=outputListName;outputList=document.createElement("div");outputList.id=outputListId;if(isTrait){const link=document.createElement("a");link.href=`#${outputListHeaderId}`;link.innerText="Trait Implementations";const h=document.createElement("h3");h.appendChild(link);trait_implementations=outputList;trait_implementations_header=outputListHeader;sidebarSection.appendChild(h);sidebarTraitList=document.createElement("ul");sidebarTraitList.className="block trait-implementation";sidebarSection.appendChild(sidebarTraitList);mainContent.appendChild(outputListHeader);mainContent.appendChild(outputList)}else{implementations=outputList;if(trait_implementations){mainContent.insertBefore(outputListHeader,trait_implementations_header);mainContent.insertBefore(outputList,trait_implementations_header)}else{const mainContent=document.querySelector("#main-content");mainContent.appendChild(outputListHeader);mainContent.appendChild(outputList)}}}const template=document.createElement("template");template.innerHTML=text;onEachLazy(template.content.querySelectorAll("a"),elem=>{const href=elem.getAttribute("href");if(href&&!href.startsWith("#")&&!/^(?:[a-z+]+:)?\/\//.test(href)){elem.setAttribute("href",window.rootPath+href)}});onEachLazy(template.content.querySelectorAll("[id]"),el=>{let i=0;if(idMap.has(el.id)){i=idMap.get(el.id)}else if(document.getElementById(el.id)){i=1;while(document.getElementById(`${el.id}-${2 * i}`)){i=2*i}while(document.getElementById(`${el.id}-${i}`)){i+=1}}if(i!==0){const oldHref=`#${el.id}`;const newHref=`#${el.id}-${i}`;el.id=`${el.id}-${i}`;onEachLazy(template.content.querySelectorAll("a[href]"),link=>{if(link.getAttribute("href")===oldHref){link.href=newHref}})}idMap.set(el.id,i+1)});const templateAssocItems=template.content.querySelectorAll("section.tymethod, "+"section.method, section.associatedtype, section.associatedconstant");if(isTrait){const li=document.createElement("li");const a=document.createElement("a");a.href=`#${template.content.querySelector(".impl").id}`;a.textContent=traitName;li.appendChild(a);sidebarTraitList.append(li)}else{onEachLazy(templateAssocItems,item=>{let block=hasClass(item,"associatedtype")?associatedTypes:(hasClass(item,"associatedconstant")?associatedConstants:(methods));if(!block){const blockTitle=hasClass(item,"associatedtype")?"Associated Types":(hasClass(item,"associatedconstant")?"Associated Constants":("Methods"));const blockClass=hasClass(item,"associatedtype")?"associatedtype":(hasClass(item,"associatedconstant")?"associatedconstant":("method"));const blockHeader=document.createElement("h3");const blockLink=document.createElement("a");blockLink.href="#implementations";blockLink.innerText=blockTitle;blockHeader.appendChild(blockLink);block=document.createElement("ul");block.className=`block ${blockClass}`;const insertionReference=methods||sidebarTraitList;if(insertionReference){const insertionReferenceH=insertionReference.previousElementSibling;sidebarSection.insertBefore(blockHeader,insertionReferenceH);sidebarSection.insertBefore(block,insertionReferenceH)}else{sidebarSection.appendChild(blockHeader);sidebarSection.appendChild(block)}if(hasClass(item,"associatedtype")){associatedTypes=block}else if(hasClass(item,"associatedconstant")){associatedConstants=block}else{methods=block}}const li=document.createElement("li");const a=document.createElement("a");a.innerText=item.id.split("-")[0].split(".")[1];a.href=`#${item.id}`;li.appendChild(a);block.appendChild(li)})}outputList.appendChild(template.content)}for(const list of[methods,associatedTypes,associatedConstants,sidebarTraitList]){if(!list){continue}const newChildren=Array.prototype.slice.call(list.children);newChildren.sort((a,b)=>{const aI=a.innerText;const bI=b.innerText;return aIbI?1:0});list.replaceChildren(...newChildren)}};if(window.pending_type_impls){window.register_type_impls(window.pending_type_impls)}function addSidebarCrates(){if(!window.ALL_CRATES){return}const sidebarElems=document.getElementsByClassName("sidebar-elems")[0];if(!sidebarElems){return}const h3=document.createElement("h3");h3.innerHTML="Crates";const ul=document.createElement("ul");ul.className="block crate";for(const crate of window.ALL_CRATES){const link=document.createElement("a");link.href=window.rootPath+crate+"/index.html";if(window.rootPath!=="./"&&crate===window.currentCrate){link.className="current"}link.textContent=crate;const li=document.createElement("li");li.appendChild(link);ul.appendChild(li)}sidebarElems.appendChild(h3);sidebarElems.appendChild(ul)}function expandAllDocs(){const innerToggle=document.getElementById(toggleAllDocsId);removeClass(innerToggle,"will-expand");onEachLazy(document.getElementsByClassName("toggle"),e=>{if(!hasClass(e,"type-contents-toggle")&&!hasClass(e,"more-examples-toggle")){e.open=true}});innerToggle.title="collapse all docs";innerToggle.children[0].innerText="\u2212"}function collapseAllDocs(){const innerToggle=document.getElementById(toggleAllDocsId);addClass(innerToggle,"will-expand");onEachLazy(document.getElementsByClassName("toggle"),e=>{if(e.parentNode.id!=="implementations-list"||(!hasClass(e,"implementors-toggle")&&!hasClass(e,"type-contents-toggle"))){e.open=false}});innerToggle.title="expand all docs";innerToggle.children[0].innerText="+"}function toggleAllDocs(){const innerToggle=document.getElementById(toggleAllDocsId);if(!innerToggle){return}if(hasClass(innerToggle,"will-expand")){expandAllDocs()}else{collapseAllDocs()}}(function(){const toggles=document.getElementById(toggleAllDocsId);if(toggles){toggles.onclick=toggleAllDocs}const hideMethodDocs=getSettingValue("auto-hide-method-docs")==="true";const hideImplementations=getSettingValue("auto-hide-trait-implementations")==="true";const hideLargeItemContents=getSettingValue("auto-hide-large-items")!=="false";function setImplementorsTogglesOpen(id,open){const list=document.getElementById(id);if(list!==null){onEachLazy(list.getElementsByClassName("implementors-toggle"),e=>{e.open=open})}}if(hideImplementations){setImplementorsTogglesOpen("trait-implementations-list",false);setImplementorsTogglesOpen("blanket-implementations-list",false)}onEachLazy(document.getElementsByClassName("toggle"),e=>{if(!hideLargeItemContents&&hasClass(e,"type-contents-toggle")){e.open=true}if(hideMethodDocs&&hasClass(e,"method-toggle")){e.open=false}})}());window.rustdoc_add_line_numbers_to_examples=()=>{onEachLazy(document.getElementsByClassName("rust-example-rendered"),x=>{const parent=x.parentNode;const line_numbers=parent.querySelectorAll(".example-line-numbers");if(line_numbers.length>0){return}const count=x.textContent.split("\n").length;const elems=[];for(let i=0;i{onEachLazy(document.getElementsByClassName("rust-example-rendered"),x=>{const parent=x.parentNode;const line_numbers=parent.querySelectorAll(".example-line-numbers");for(const node of line_numbers){parent.removeChild(node)}})};if(getSettingValue("line-numbers")==="true"){window.rustdoc_add_line_numbers_to_examples()}function showSidebar(){window.hideAllModals(false);const sidebar=document.getElementsByClassName("sidebar")[0];addClass(sidebar,"shown")}function hideSidebar(){const sidebar=document.getElementsByClassName("sidebar")[0];removeClass(sidebar,"shown")}window.addEventListener("resize",()=>{if(window.CURRENT_TOOLTIP_ELEMENT){const base=window.CURRENT_TOOLTIP_ELEMENT.TOOLTIP_BASE;const force_visible=base.TOOLTIP_FORCE_VISIBLE;hideTooltip(false);if(force_visible){showTooltip(base);base.TOOLTIP_FORCE_VISIBLE=true}}});const mainElem=document.getElementById(MAIN_ID);if(mainElem){mainElem.addEventListener("click",hideSidebar)}onEachLazy(document.querySelectorAll("a[href^='#']"),el=>{el.addEventListener("click",()=>{expandSection(el.hash.slice(1));hideSidebar()})});onEachLazy(document.querySelectorAll(".toggle > summary:not(.hideme)"),el=>{el.addEventListener("click",e=>{if(e.target.tagName!=="SUMMARY"&&e.target.tagName!=="A"){e.preventDefault()}})});function showTooltip(e){const notable_ty=e.getAttribute("data-notable-ty");if(!window.NOTABLE_TRAITS&¬able_ty){const data=document.getElementById("notable-traits-data");if(data){window.NOTABLE_TRAITS=JSON.parse(data.innerText)}else{throw new Error("showTooltip() called with notable without any notable traits!")}}if(window.CURRENT_TOOLTIP_ELEMENT&&window.CURRENT_TOOLTIP_ELEMENT.TOOLTIP_BASE===e){clearTooltipHoverTimeout(window.CURRENT_TOOLTIP_ELEMENT);return}window.hideAllModals(false);const wrapper=document.createElement("div");if(notable_ty){wrapper.innerHTML="
"+window.NOTABLE_TRAITS[notable_ty]+"
"}else{if(e.getAttribute("title")!==null){e.setAttribute("data-title",e.getAttribute("title"));e.removeAttribute("title")}if(e.getAttribute("data-title")!==null){const titleContent=document.createElement("div");titleContent.className="content";titleContent.appendChild(document.createTextNode(e.getAttribute("data-title")));wrapper.appendChild(titleContent)}}wrapper.className="tooltip popover";const focusCatcher=document.createElement("div");focusCatcher.setAttribute("tabindex","0");focusCatcher.onfocus=hideTooltip;wrapper.appendChild(focusCatcher);const pos=e.getBoundingClientRect();wrapper.style.top=(pos.top+window.scrollY+pos.height)+"px";wrapper.style.left=0;wrapper.style.right="auto";wrapper.style.visibility="hidden";const body=document.getElementsByTagName("body")[0];body.appendChild(wrapper);const wrapperPos=wrapper.getBoundingClientRect();const finalPos=pos.left+window.scrollX-wrapperPos.width+24;if(finalPos>0){wrapper.style.left=finalPos+"px"}else{wrapper.style.setProperty("--popover-arrow-offset",(wrapperPos.right-pos.right+4)+"px")}wrapper.style.visibility="";window.CURRENT_TOOLTIP_ELEMENT=wrapper;window.CURRENT_TOOLTIP_ELEMENT.TOOLTIP_BASE=e;clearTooltipHoverTimeout(window.CURRENT_TOOLTIP_ELEMENT);wrapper.onpointerenter=ev=>{if(ev.pointerType!=="mouse"){return}clearTooltipHoverTimeout(e)};wrapper.onpointerleave=ev=>{if(ev.pointerType!=="mouse"){return}if(!e.TOOLTIP_FORCE_VISIBLE&&!elemIsInParent(ev.relatedTarget,e)){setTooltipHoverTimeout(e,false);addClass(wrapper,"fade-out")}}}function setTooltipHoverTimeout(element,show){clearTooltipHoverTimeout(element);if(!show&&!window.CURRENT_TOOLTIP_ELEMENT){return}if(show&&window.CURRENT_TOOLTIP_ELEMENT){return}if(window.CURRENT_TOOLTIP_ELEMENT&&window.CURRENT_TOOLTIP_ELEMENT.TOOLTIP_BASE!==element){return}element.TOOLTIP_HOVER_TIMEOUT=setTimeout(()=>{if(show){showTooltip(element)}else if(!element.TOOLTIP_FORCE_VISIBLE){hideTooltip(false)}},show?window.RUSTDOC_TOOLTIP_HOVER_MS:window.RUSTDOC_TOOLTIP_HOVER_EXIT_MS)}function clearTooltipHoverTimeout(element){if(element.TOOLTIP_HOVER_TIMEOUT!==undefined){removeClass(window.CURRENT_TOOLTIP_ELEMENT,"fade-out");clearTimeout(element.TOOLTIP_HOVER_TIMEOUT);delete element.TOOLTIP_HOVER_TIMEOUT}}function tooltipBlurHandler(event){if(window.CURRENT_TOOLTIP_ELEMENT&&!elemIsInParent(document.activeElement,window.CURRENT_TOOLTIP_ELEMENT)&&!elemIsInParent(event.relatedTarget,window.CURRENT_TOOLTIP_ELEMENT)&&!elemIsInParent(document.activeElement,window.CURRENT_TOOLTIP_ELEMENT.TOOLTIP_BASE)&&!elemIsInParent(event.relatedTarget,window.CURRENT_TOOLTIP_ELEMENT.TOOLTIP_BASE)){setTimeout(()=>hideTooltip(false),0)}}function hideTooltip(focus){if(window.CURRENT_TOOLTIP_ELEMENT){if(window.CURRENT_TOOLTIP_ELEMENT.TOOLTIP_BASE.TOOLTIP_FORCE_VISIBLE){if(focus){window.CURRENT_TOOLTIP_ELEMENT.TOOLTIP_BASE.focus()}window.CURRENT_TOOLTIP_ELEMENT.TOOLTIP_BASE.TOOLTIP_FORCE_VISIBLE=false}const body=document.getElementsByTagName("body")[0];body.removeChild(window.CURRENT_TOOLTIP_ELEMENT);clearTooltipHoverTimeout(window.CURRENT_TOOLTIP_ELEMENT);window.CURRENT_TOOLTIP_ELEMENT=null}}onEachLazy(document.getElementsByClassName("tooltip"),e=>{e.onclick=()=>{e.TOOLTIP_FORCE_VISIBLE=e.TOOLTIP_FORCE_VISIBLE?false:true;if(window.CURRENT_TOOLTIP_ELEMENT&&!e.TOOLTIP_FORCE_VISIBLE){hideTooltip(true)}else{showTooltip(e);window.CURRENT_TOOLTIP_ELEMENT.setAttribute("tabindex","0");window.CURRENT_TOOLTIP_ELEMENT.focus();window.CURRENT_TOOLTIP_ELEMENT.onblur=tooltipBlurHandler}return false};e.onpointerenter=ev=>{if(ev.pointerType!=="mouse"){return}setTooltipHoverTimeout(e,true)};e.onpointermove=ev=>{if(ev.pointerType!=="mouse"){return}setTooltipHoverTimeout(e,true)};e.onpointerleave=ev=>{if(ev.pointerType!=="mouse"){return}if(!e.TOOLTIP_FORCE_VISIBLE&&!elemIsInParent(ev.relatedTarget,window.CURRENT_TOOLTIP_ELEMENT)){setTooltipHoverTimeout(e,false);addClass(window.CURRENT_TOOLTIP_ELEMENT,"fade-out")}}});const sidebar_menu_toggle=document.getElementsByClassName("sidebar-menu-toggle")[0];if(sidebar_menu_toggle){sidebar_menu_toggle.addEventListener("click",()=>{const sidebar=document.getElementsByClassName("sidebar")[0];if(!hasClass(sidebar,"shown")){showSidebar()}else{hideSidebar()}})}function helpBlurHandler(event){blurHandler(event,getHelpButton(),window.hidePopoverMenus)}function buildHelpMenu(){const book_info=document.createElement("span");const channel=getVar("channel");book_info.className="top";book_info.innerHTML=`You can find more information in \ +the rustdoc book.`;const shortcuts=[["?","Show this help dialog"],["S","Focus the search field"],["↑","Move up in search results"],["↓","Move down in search results"],["← / →","Switch result tab (when results focused)"],["⏎","Go to active search result"],["+","Expand all sections"],["-","Collapse all sections"],].map(x=>"
"+x[0].split(" ").map((y,index)=>((index&1)===0?""+y+"":" "+y+" ")).join("")+"
"+x[1]+"
").join("");const div_shortcuts=document.createElement("div");addClass(div_shortcuts,"shortcuts");div_shortcuts.innerHTML="

Keyboard Shortcuts

"+shortcuts+"
";const infos=[`For a full list of all search features, take a look here.`,"Prefix searches with a type followed by a colon (e.g., fn:) to \ + restrict the search to a given item kind.","Accepted kinds are: fn, mod, struct, \ + enum, trait, type, macro, \ + and const.","Search functions by type signature (e.g., vec -> usize or \ + -> vec or String, enum:Cow -> bool)","You can look for items with an exact name by putting double quotes around \ + your request: \"string\"","Look for functions that accept or return \ + slices and \ + arrays by writing \ + square brackets (e.g., -> [u8] or [] -> Option)","Look for items inside another one by searching for a path: vec::Vec",].map(x=>"

"+x+"

").join("");const div_infos=document.createElement("div");addClass(div_infos,"infos");div_infos.innerHTML="

Search Tricks

"+infos;const rustdoc_version=document.createElement("span");rustdoc_version.className="bottom";const rustdoc_version_code=document.createElement("code");rustdoc_version_code.innerText="rustdoc "+getVar("rustdoc-version");rustdoc_version.appendChild(rustdoc_version_code);const container=document.createElement("div");if(!isHelpPage){container.className="popover"}container.id="help";container.style.display="none";const side_by_side=document.createElement("div");side_by_side.className="side-by-side";side_by_side.appendChild(div_shortcuts);side_by_side.appendChild(div_infos);container.appendChild(book_info);container.appendChild(side_by_side);container.appendChild(rustdoc_version);if(isHelpPage){const help_section=document.createElement("section");help_section.appendChild(container);document.getElementById("main-content").appendChild(help_section);container.style.display="block"}else{const help_button=getHelpButton();help_button.appendChild(container);container.onblur=helpBlurHandler;help_button.onblur=helpBlurHandler;help_button.children[0].onblur=helpBlurHandler}return container}window.hideAllModals=switchFocus=>{hideSidebar();window.hidePopoverMenus();hideTooltip(switchFocus)};window.hidePopoverMenus=()=>{onEachLazy(document.querySelectorAll(".search-form .popover"),elem=>{elem.style.display="none"})};function getHelpMenu(buildNeeded){let menu=getHelpButton().querySelector(".popover");if(!menu&&buildNeeded){menu=buildHelpMenu()}return menu}function showHelp(){getHelpButton().querySelector("a").focus();const menu=getHelpMenu(true);if(menu.style.display==="none"){window.hideAllModals();menu.style.display=""}}if(isHelpPage){showHelp();document.querySelector(`#${HELP_BUTTON_ID} > a`).addEventListener("click",event=>{const target=event.target;if(target.tagName!=="A"||target.parentElement.id!==HELP_BUTTON_ID||event.ctrlKey||event.altKey||event.metaKey){return}event.preventDefault()})}else{document.querySelector(`#${HELP_BUTTON_ID} > a`).addEventListener("click",event=>{const target=event.target;if(target.tagName!=="A"||target.parentElement.id!==HELP_BUTTON_ID||event.ctrlKey||event.altKey||event.metaKey){return}event.preventDefault();const menu=getHelpMenu(true);const shouldShowHelp=menu.style.display==="none";if(shouldShowHelp){showHelp()}else{window.hidePopoverMenus()}})}setMobileTopbar();addSidebarItems();addSidebarCrates();onHashChange(null);window.addEventListener("hashchange",onHashChange);searchState.setup()}());(function(){let reset_button_timeout=null;const but=document.getElementById("copy-path");if(!but){return}but.onclick=()=>{const parent=but.parentElement;const path=[];onEach(parent.childNodes,child=>{if(child.tagName==="A"){path.push(child.textContent)}});const el=document.createElement("textarea");el.value=path.join("::");el.setAttribute("readonly","");el.style.position="absolute";el.style.left="-9999px";document.body.appendChild(el);el.select();document.execCommand("copy");document.body.removeChild(el);but.children[0].style.display="none";let tmp;if(but.childNodes.length<2){tmp=document.createTextNode("✓");but.appendChild(tmp)}else{onEachLazy(but.childNodes,e=>{if(e.nodeType===Node.TEXT_NODE){tmp=e;return true}});tmp.textContent="✓"}if(reset_button_timeout!==null){window.clearTimeout(reset_button_timeout)}function reset_button(){tmp.textContent="";reset_button_timeout=null;but.children[0].style.display=""}reset_button_timeout=window.setTimeout(reset_button,1000)}}()) \ No newline at end of file diff --git a/rust/static.files/main-c5bd66d33317d69f.js b/rust/static.files/main-c5bd66d33317d69f.js deleted file mode 100644 index 43133d66..00000000 --- a/rust/static.files/main-c5bd66d33317d69f.js +++ /dev/null @@ -1,12 +0,0 @@ -"use strict";window.RUSTDOC_TOOLTIP_HOVER_MS=300;window.RUSTDOC_TOOLTIP_HOVER_EXIT_MS=450;function resourcePath(basename,extension){return getVar("root-path")+basename+getVar("resource-suffix")+extension}function hideMain(){addClass(document.getElementById(MAIN_ID),"hidden")}function showMain(){removeClass(document.getElementById(MAIN_ID),"hidden")}function elemIsInParent(elem,parent){while(elem&&elem!==document.body){if(elem===parent){return true}elem=elem.parentElement}return false}function blurHandler(event,parentElem,hideCallback){if(!elemIsInParent(document.activeElement,parentElem)&&!elemIsInParent(event.relatedTarget,parentElem)){hideCallback()}}window.rootPath=getVar("root-path");window.currentCrate=getVar("current-crate");function setMobileTopbar(){const mobileTopbar=document.querySelector(".mobile-topbar");const locationTitle=document.querySelector(".sidebar h2.location");if(mobileTopbar&&locationTitle){const mobileTitle=document.createElement("h2");mobileTitle.innerHTML=locationTitle.innerHTML;mobileTopbar.appendChild(mobileTitle)}}function getVirtualKey(ev){if("key"in ev&&typeof ev.key!=="undefined"){return ev.key}const c=ev.charCode||ev.keyCode;if(c===27){return"Escape"}return String.fromCharCode(c)}const MAIN_ID="main-content";const SETTINGS_BUTTON_ID="settings-menu";const ALTERNATIVE_DISPLAY_ID="alternative-display";const NOT_DISPLAYED_ID="not-displayed";const HELP_BUTTON_ID="help-button";function getSettingsButton(){return document.getElementById(SETTINGS_BUTTON_ID)}function getHelpButton(){return document.getElementById(HELP_BUTTON_ID)}function getNakedUrl(){return window.location.href.split("?")[0].split("#")[0]}function insertAfter(newNode,referenceNode){referenceNode.parentNode.insertBefore(newNode,referenceNode.nextSibling)}function getOrCreateSection(id,classes){let el=document.getElementById(id);if(!el){el=document.createElement("section");el.id=id;el.className=classes;insertAfter(el,document.getElementById(MAIN_ID))}return el}function getAlternativeDisplayElem(){return getOrCreateSection(ALTERNATIVE_DISPLAY_ID,"content hidden")}function getNotDisplayedElem(){return getOrCreateSection(NOT_DISPLAYED_ID,"hidden")}function switchDisplayedElement(elemToDisplay){const el=getAlternativeDisplayElem();if(el.children.length>0){getNotDisplayedElem().appendChild(el.firstElementChild)}if(elemToDisplay===null){addClass(el,"hidden");showMain();return}el.appendChild(elemToDisplay);hideMain();removeClass(el,"hidden")}function browserSupportsHistoryApi(){return window.history&&typeof window.history.pushState==="function"}function preLoadCss(cssUrl){const link=document.createElement("link");link.href=cssUrl;link.rel="preload";link.as="style";document.getElementsByTagName("head")[0].appendChild(link)}(function(){const isHelpPage=window.location.pathname.endsWith("/help.html");function loadScript(url){const script=document.createElement("script");script.src=url;document.head.append(script)}getSettingsButton().onclick=event=>{if(event.ctrlKey||event.altKey||event.metaKey){return}window.hideAllModals(false);addClass(getSettingsButton(),"rotate");event.preventDefault();loadScript(getVar("static-root-path")+getVar("settings-js"));setTimeout(()=>{const themes=getVar("themes").split(",");for(const theme of themes){if(theme!==""){preLoadCss(getVar("root-path")+theme+".css")}}},0)};window.searchState={loadingText:"Loading search results...",input:document.getElementsByClassName("search-input")[0],outputElement:()=>{let el=document.getElementById("search");if(!el){el=document.createElement("section");el.id="search";getNotDisplayedElem().appendChild(el)}return el},title:document.title,titleBeforeSearch:document.title,timeout:null,currentTab:0,focusedByTab:[null,null,null],clearInputTimeout:()=>{if(searchState.timeout!==null){clearTimeout(searchState.timeout);searchState.timeout=null}},isDisplayed:()=>searchState.outputElement().parentElement.id===ALTERNATIVE_DISPLAY_ID,focus:()=>{searchState.input.focus()},defocus:()=>{searchState.input.blur()},showResults:search=>{if(search===null||typeof search==="undefined"){search=searchState.outputElement()}switchDisplayedElement(search);searchState.mouseMovedAfterSearch=false;document.title=searchState.title},removeQueryParameters:()=>{document.title=searchState.titleBeforeSearch;if(browserSupportsHistoryApi()){history.replaceState(null,"",getNakedUrl()+window.location.hash)}},hideResults:()=>{switchDisplayedElement(null);searchState.removeQueryParameters()},getQueryStringParams:()=>{const params={};window.location.search.substring(1).split("&").map(s=>{const pair=s.split("=");params[decodeURIComponent(pair[0])]=typeof pair[1]==="undefined"?null:decodeURIComponent(pair[1])});return params},setup:()=>{const search_input=searchState.input;if(!searchState.input){return}let searchLoaded=false;function loadSearch(){if(!searchLoaded){searchLoaded=true;loadScript(getVar("static-root-path")+getVar("search-js"));loadScript(resourcePath("search-index",".js"))}}search_input.addEventListener("focus",()=>{search_input.origPlaceholder=search_input.placeholder;search_input.placeholder="Type your search here.";loadSearch()});if(search_input.value!==""){loadSearch()}const params=searchState.getQueryStringParams();if(params.search!==undefined){searchState.setLoadingSearch();loadSearch()}},setLoadingSearch:()=>{const search=searchState.outputElement();search.innerHTML="

"+searchState.loadingText+"

";searchState.showResults(search)},};const toggleAllDocsId="toggle-all-docs";let savedHash="";function handleHashes(ev){if(ev!==null&&searchState.isDisplayed()&&ev.newURL){switchDisplayedElement(null);const hash=ev.newURL.slice(ev.newURL.indexOf("#")+1);if(browserSupportsHistoryApi()){history.replaceState(null,"",getNakedUrl()+window.location.search+"#"+hash)}const elem=document.getElementById(hash);if(elem){elem.scrollIntoView()}}const pageId=window.location.hash.replace(/^#/,"");if(savedHash!==pageId){savedHash=pageId;if(pageId!==""){expandSection(pageId)}}}function onHashChange(ev){hideSidebar();handleHashes(ev)}function openParentDetails(elem){while(elem){if(elem.tagName==="DETAILS"){elem.open=true}elem=elem.parentNode}}function expandSection(id){openParentDetails(document.getElementById(id))}function handleEscape(ev){searchState.clearInputTimeout();searchState.hideResults();ev.preventDefault();searchState.defocus();window.hideAllModals(true)}function handleShortcut(ev){const disableShortcuts=getSettingValue("disable-shortcuts")==="true";if(ev.ctrlKey||ev.altKey||ev.metaKey||disableShortcuts){return}if(document.activeElement.tagName==="INPUT"&&document.activeElement.type!=="checkbox"&&document.activeElement.type!=="radio"){switch(getVirtualKey(ev)){case"Escape":handleEscape(ev);break}}else{switch(getVirtualKey(ev)){case"Escape":handleEscape(ev);break;case"s":case"S":ev.preventDefault();searchState.focus();break;case"+":ev.preventDefault();expandAllDocs();break;case"-":ev.preventDefault();collapseAllDocs();break;case"?":showHelp();break;default:break}}}document.addEventListener("keypress",handleShortcut);document.addEventListener("keydown",handleShortcut);function addSidebarItems(){if(!window.SIDEBAR_ITEMS){return}const sidebar=document.getElementsByClassName("sidebar-elems")[0];function block(shortty,id,longty){const filtered=window.SIDEBAR_ITEMS[shortty];if(!filtered){return}const h3=document.createElement("h3");h3.innerHTML=`${longty}`;const ul=document.createElement("ul");ul.className="block "+shortty;for(const name of filtered){let path;if(shortty==="mod"){path=name+"/index.html"}else{path=shortty+"."+name+".html"}const current_page=document.location.href.split("/").pop();const link=document.createElement("a");link.href=path;if(path===current_page){link.className="current"}link.textContent=name;const li=document.createElement("li");li.appendChild(link);ul.appendChild(li)}sidebar.appendChild(h3);sidebar.appendChild(ul)}if(sidebar){block("primitive","primitives","Primitive Types");block("mod","modules","Modules");block("macro","macros","Macros");block("struct","structs","Structs");block("enum","enums","Enums");block("union","unions","Unions");block("constant","constants","Constants");block("static","static","Statics");block("trait","traits","Traits");block("fn","functions","Functions");block("type","types","Type Aliases");block("foreigntype","foreign-types","Foreign Types");block("keyword","keywords","Keywords");block("traitalias","trait-aliases","Trait Aliases")}}window.register_implementors=imp=>{const implementors=document.getElementById("implementors-list");const synthetic_implementors=document.getElementById("synthetic-implementors-list");const inlined_types=new Set();const TEXT_IDX=0;const SYNTHETIC_IDX=1;const TYPES_IDX=2;if(synthetic_implementors){onEachLazy(synthetic_implementors.getElementsByClassName("impl"),el=>{const aliases=el.getAttribute("data-aliases");if(!aliases){return}aliases.split(",").forEach(alias=>{inlined_types.add(alias)})})}let currentNbImpls=implementors.getElementsByClassName("impl").length;const traitName=document.querySelector(".main-heading h1 > .trait").textContent;const baseIdName="impl-"+traitName+"-";const libs=Object.getOwnPropertyNames(imp);const script=document.querySelector("script[data-ignore-extern-crates]");const ignoreExternCrates=new Set((script?script.getAttribute("data-ignore-extern-crates"):"").split(","));for(const lib of libs){if(lib===window.currentCrate||ignoreExternCrates.has(lib)){continue}const structs=imp[lib];struct_loop:for(const struct of structs){const list=struct[SYNTHETIC_IDX]?synthetic_implementors:implementors;if(struct[SYNTHETIC_IDX]){for(const struct_type of struct[TYPES_IDX]){if(inlined_types.has(struct_type)){continue struct_loop}inlined_types.add(struct_type)}}const code=document.createElement("h3");code.innerHTML=struct[TEXT_IDX];addClass(code,"code-header");onEachLazy(code.getElementsByTagName("a"),elem=>{const href=elem.getAttribute("href");if(href&&!/^(?:[a-z+]+:)?\/\//.test(href)){elem.setAttribute("href",window.rootPath+href)}});const currentId=baseIdName+currentNbImpls;const anchor=document.createElement("a");anchor.href="#"+currentId;addClass(anchor,"anchor");const display=document.createElement("div");display.id=currentId;addClass(display,"impl");display.appendChild(anchor);display.appendChild(code);list.appendChild(display);currentNbImpls+=1}}};if(window.pending_implementors){window.register_implementors(window.pending_implementors)}function addSidebarCrates(){if(!window.ALL_CRATES){return}const sidebarElems=document.getElementsByClassName("sidebar-elems")[0];if(!sidebarElems){return}const h3=document.createElement("h3");h3.innerHTML="Crates";const ul=document.createElement("ul");ul.className="block crate";for(const crate of window.ALL_CRATES){const link=document.createElement("a");link.href=window.rootPath+crate+"/index.html";if(window.rootPath!=="./"&&crate===window.currentCrate){link.className="current"}link.textContent=crate;const li=document.createElement("li");li.appendChild(link);ul.appendChild(li)}sidebarElems.appendChild(h3);sidebarElems.appendChild(ul)}function expandAllDocs(){const innerToggle=document.getElementById(toggleAllDocsId);removeClass(innerToggle,"will-expand");onEachLazy(document.getElementsByClassName("toggle"),e=>{if(!hasClass(e,"type-contents-toggle")&&!hasClass(e,"more-examples-toggle")){e.open=true}});innerToggle.title="collapse all docs";innerToggle.children[0].innerText="\u2212"}function collapseAllDocs(){const innerToggle=document.getElementById(toggleAllDocsId);addClass(innerToggle,"will-expand");onEachLazy(document.getElementsByClassName("toggle"),e=>{if(e.parentNode.id!=="implementations-list"||(!hasClass(e,"implementors-toggle")&&!hasClass(e,"type-contents-toggle"))){e.open=false}});innerToggle.title="expand all docs";innerToggle.children[0].innerText="+"}function toggleAllDocs(){const innerToggle=document.getElementById(toggleAllDocsId);if(!innerToggle){return}if(hasClass(innerToggle,"will-expand")){expandAllDocs()}else{collapseAllDocs()}}(function(){const toggles=document.getElementById(toggleAllDocsId);if(toggles){toggles.onclick=toggleAllDocs}const hideMethodDocs=getSettingValue("auto-hide-method-docs")==="true";const hideImplementations=getSettingValue("auto-hide-trait-implementations")==="true";const hideLargeItemContents=getSettingValue("auto-hide-large-items")!=="false";function setImplementorsTogglesOpen(id,open){const list=document.getElementById(id);if(list!==null){onEachLazy(list.getElementsByClassName("implementors-toggle"),e=>{e.open=open})}}if(hideImplementations){setImplementorsTogglesOpen("trait-implementations-list",false);setImplementorsTogglesOpen("blanket-implementations-list",false)}onEachLazy(document.getElementsByClassName("toggle"),e=>{if(!hideLargeItemContents&&hasClass(e,"type-contents-toggle")){e.open=true}if(hideMethodDocs&&hasClass(e,"method-toggle")){e.open=false}})}());window.rustdoc_add_line_numbers_to_examples=()=>{onEachLazy(document.getElementsByClassName("rust-example-rendered"),x=>{const parent=x.parentNode;const line_numbers=parent.querySelectorAll(".example-line-numbers");if(line_numbers.length>0){return}const count=x.textContent.split("\n").length;const elems=[];for(let i=0;i{onEachLazy(document.getElementsByClassName("rust-example-rendered"),x=>{const parent=x.parentNode;const line_numbers=parent.querySelectorAll(".example-line-numbers");for(const node of line_numbers){parent.removeChild(node)}})};if(getSettingValue("line-numbers")==="true"){window.rustdoc_add_line_numbers_to_examples()}function showSidebar(){window.hideAllModals(false);const sidebar=document.getElementsByClassName("sidebar")[0];addClass(sidebar,"shown")}function hideSidebar(){const sidebar=document.getElementsByClassName("sidebar")[0];removeClass(sidebar,"shown")}window.addEventListener("resize",()=>{if(window.CURRENT_TOOLTIP_ELEMENT){const base=window.CURRENT_TOOLTIP_ELEMENT.TOOLTIP_BASE;const force_visible=base.TOOLTIP_FORCE_VISIBLE;hideTooltip(false);if(force_visible){showTooltip(base);base.TOOLTIP_FORCE_VISIBLE=true}}});const mainElem=document.getElementById(MAIN_ID);if(mainElem){mainElem.addEventListener("click",hideSidebar)}onEachLazy(document.querySelectorAll("a[href^='#']"),el=>{el.addEventListener("click",()=>{expandSection(el.hash.slice(1));hideSidebar()})});onEachLazy(document.querySelectorAll(".toggle > summary:not(.hideme)"),el=>{el.addEventListener("click",e=>{if(e.target.tagName!=="SUMMARY"&&e.target.tagName!=="A"){e.preventDefault()}})});function showTooltip(e){const notable_ty=e.getAttribute("data-notable-ty");if(!window.NOTABLE_TRAITS&¬able_ty){const data=document.getElementById("notable-traits-data");if(data){window.NOTABLE_TRAITS=JSON.parse(data.innerText)}else{throw new Error("showTooltip() called with notable without any notable traits!")}}if(window.CURRENT_TOOLTIP_ELEMENT&&window.CURRENT_TOOLTIP_ELEMENT.TOOLTIP_BASE===e){clearTooltipHoverTimeout(window.CURRENT_TOOLTIP_ELEMENT);return}window.hideAllModals(false);const wrapper=document.createElement("div");if(notable_ty){wrapper.innerHTML="
"+window.NOTABLE_TRAITS[notable_ty]+"
"}else{if(e.getAttribute("title")!==null){e.setAttribute("data-title",e.getAttribute("title"));e.removeAttribute("title")}if(e.getAttribute("data-title")!==null){const titleContent=document.createElement("div");titleContent.className="content";titleContent.appendChild(document.createTextNode(e.getAttribute("data-title")));wrapper.appendChild(titleContent)}}wrapper.className="tooltip popover";const focusCatcher=document.createElement("div");focusCatcher.setAttribute("tabindex","0");focusCatcher.onfocus=hideTooltip;wrapper.appendChild(focusCatcher);const pos=e.getBoundingClientRect();wrapper.style.top=(pos.top+window.scrollY+pos.height)+"px";wrapper.style.left=0;wrapper.style.right="auto";wrapper.style.visibility="hidden";const body=document.getElementsByTagName("body")[0];body.appendChild(wrapper);const wrapperPos=wrapper.getBoundingClientRect();const finalPos=pos.left+window.scrollX-wrapperPos.width+24;if(finalPos>0){wrapper.style.left=finalPos+"px"}else{wrapper.style.setProperty("--popover-arrow-offset",(wrapperPos.right-pos.right+4)+"px")}wrapper.style.visibility="";window.CURRENT_TOOLTIP_ELEMENT=wrapper;window.CURRENT_TOOLTIP_ELEMENT.TOOLTIP_BASE=e;clearTooltipHoverTimeout(window.CURRENT_TOOLTIP_ELEMENT);wrapper.onpointerenter=ev=>{if(ev.pointerType!=="mouse"){return}clearTooltipHoverTimeout(e)};wrapper.onpointerleave=ev=>{if(ev.pointerType!=="mouse"){return}if(!e.TOOLTIP_FORCE_VISIBLE&&!elemIsInParent(ev.relatedTarget,e)){setTooltipHoverTimeout(e,false);addClass(wrapper,"fade-out")}}}function setTooltipHoverTimeout(element,show){clearTooltipHoverTimeout(element);if(!show&&!window.CURRENT_TOOLTIP_ELEMENT){return}if(show&&window.CURRENT_TOOLTIP_ELEMENT){return}if(window.CURRENT_TOOLTIP_ELEMENT&&window.CURRENT_TOOLTIP_ELEMENT.TOOLTIP_BASE!==element){return}element.TOOLTIP_HOVER_TIMEOUT=setTimeout(()=>{if(show){showTooltip(element)}else if(!element.TOOLTIP_FORCE_VISIBLE){hideTooltip(false)}},show?window.RUSTDOC_TOOLTIP_HOVER_MS:window.RUSTDOC_TOOLTIP_HOVER_EXIT_MS)}function clearTooltipHoverTimeout(element){if(element.TOOLTIP_HOVER_TIMEOUT!==undefined){removeClass(window.CURRENT_TOOLTIP_ELEMENT,"fade-out");clearTimeout(element.TOOLTIP_HOVER_TIMEOUT);delete element.TOOLTIP_HOVER_TIMEOUT}}function tooltipBlurHandler(event){if(window.CURRENT_TOOLTIP_ELEMENT&&!elemIsInParent(document.activeElement,window.CURRENT_TOOLTIP_ELEMENT)&&!elemIsInParent(event.relatedTarget,window.CURRENT_TOOLTIP_ELEMENT)&&!elemIsInParent(document.activeElement,window.CURRENT_TOOLTIP_ELEMENT.TOOLTIP_BASE)&&!elemIsInParent(event.relatedTarget,window.CURRENT_TOOLTIP_ELEMENT.TOOLTIP_BASE)){setTimeout(()=>hideTooltip(false),0)}}function hideTooltip(focus){if(window.CURRENT_TOOLTIP_ELEMENT){if(window.CURRENT_TOOLTIP_ELEMENT.TOOLTIP_BASE.TOOLTIP_FORCE_VISIBLE){if(focus){window.CURRENT_TOOLTIP_ELEMENT.TOOLTIP_BASE.focus()}window.CURRENT_TOOLTIP_ELEMENT.TOOLTIP_BASE.TOOLTIP_FORCE_VISIBLE=false}const body=document.getElementsByTagName("body")[0];body.removeChild(window.CURRENT_TOOLTIP_ELEMENT);clearTooltipHoverTimeout(window.CURRENT_TOOLTIP_ELEMENT);window.CURRENT_TOOLTIP_ELEMENT=null}}onEachLazy(document.getElementsByClassName("tooltip"),e=>{e.onclick=()=>{e.TOOLTIP_FORCE_VISIBLE=e.TOOLTIP_FORCE_VISIBLE?false:true;if(window.CURRENT_TOOLTIP_ELEMENT&&!e.TOOLTIP_FORCE_VISIBLE){hideTooltip(true)}else{showTooltip(e);window.CURRENT_TOOLTIP_ELEMENT.setAttribute("tabindex","0");window.CURRENT_TOOLTIP_ELEMENT.focus();window.CURRENT_TOOLTIP_ELEMENT.onblur=tooltipBlurHandler}return false};e.onpointerenter=ev=>{if(ev.pointerType!=="mouse"){return}setTooltipHoverTimeout(e,true)};e.onpointermove=ev=>{if(ev.pointerType!=="mouse"){return}setTooltipHoverTimeout(e,true)};e.onpointerleave=ev=>{if(ev.pointerType!=="mouse"){return}if(!e.TOOLTIP_FORCE_VISIBLE&&!elemIsInParent(ev.relatedTarget,window.CURRENT_TOOLTIP_ELEMENT)){setTooltipHoverTimeout(e,false);addClass(window.CURRENT_TOOLTIP_ELEMENT,"fade-out")}}});const sidebar_menu_toggle=document.getElementsByClassName("sidebar-menu-toggle")[0];if(sidebar_menu_toggle){sidebar_menu_toggle.addEventListener("click",()=>{const sidebar=document.getElementsByClassName("sidebar")[0];if(!hasClass(sidebar,"shown")){showSidebar()}else{hideSidebar()}})}function helpBlurHandler(event){blurHandler(event,getHelpButton(),window.hidePopoverMenus)}function buildHelpMenu(){const book_info=document.createElement("span");const channel=getVar("channel");book_info.className="top";book_info.innerHTML=`You can find more information in \ -the rustdoc book.`;const shortcuts=[["?","Show this help dialog"],["S","Focus the search field"],["↑","Move up in search results"],["↓","Move down in search results"],["← / →","Switch result tab (when results focused)"],["⏎","Go to active search result"],["+","Expand all sections"],["-","Collapse all sections"],].map(x=>"
"+x[0].split(" ").map((y,index)=>((index&1)===0?""+y+"":" "+y+" ")).join("")+"
"+x[1]+"
").join("");const div_shortcuts=document.createElement("div");addClass(div_shortcuts,"shortcuts");div_shortcuts.innerHTML="

Keyboard Shortcuts

"+shortcuts+"
";const infos=[`For a full list of all search features, take a look here.`,"Prefix searches with a type followed by a colon (e.g., fn:) to \ - restrict the search to a given item kind.","Accepted kinds are: fn, mod, struct, \ - enum, trait, type, macro, \ - and const.","Search functions by type signature (e.g., vec -> usize or \ - -> vec or String, enum:Cow -> bool)","You can look for items with an exact name by putting double quotes around \ - your request: \"string\"","Look for functions that accept or return \ - slices and \ - arrays by writing \ - square brackets (e.g., -> [u8] or [] -> Option)","Look for items inside another one by searching for a path: vec::Vec",].map(x=>"

"+x+"

").join("");const div_infos=document.createElement("div");addClass(div_infos,"infos");div_infos.innerHTML="

Search Tricks

"+infos;const rustdoc_version=document.createElement("span");rustdoc_version.className="bottom";const rustdoc_version_code=document.createElement("code");rustdoc_version_code.innerText="rustdoc "+getVar("rustdoc-version");rustdoc_version.appendChild(rustdoc_version_code);const container=document.createElement("div");if(!isHelpPage){container.className="popover"}container.id="help";container.style.display="none";const side_by_side=document.createElement("div");side_by_side.className="side-by-side";side_by_side.appendChild(div_shortcuts);side_by_side.appendChild(div_infos);container.appendChild(book_info);container.appendChild(side_by_side);container.appendChild(rustdoc_version);if(isHelpPage){const help_section=document.createElement("section");help_section.appendChild(container);document.getElementById("main-content").appendChild(help_section);container.style.display="block"}else{const help_button=getHelpButton();help_button.appendChild(container);container.onblur=helpBlurHandler;help_button.onblur=helpBlurHandler;help_button.children[0].onblur=helpBlurHandler}return container}window.hideAllModals=switchFocus=>{hideSidebar();window.hidePopoverMenus();hideTooltip(switchFocus)};window.hidePopoverMenus=()=>{onEachLazy(document.querySelectorAll(".search-form .popover"),elem=>{elem.style.display="none"})};function getHelpMenu(buildNeeded){let menu=getHelpButton().querySelector(".popover");if(!menu&&buildNeeded){menu=buildHelpMenu()}return menu}function showHelp(){getHelpButton().querySelector("a").focus();const menu=getHelpMenu(true);if(menu.style.display==="none"){window.hideAllModals();menu.style.display=""}}if(isHelpPage){showHelp();document.querySelector(`#${HELP_BUTTON_ID} > a`).addEventListener("click",event=>{const target=event.target;if(target.tagName!=="A"||target.parentElement.id!==HELP_BUTTON_ID||event.ctrlKey||event.altKey||event.metaKey){return}event.preventDefault()})}else{document.querySelector(`#${HELP_BUTTON_ID} > a`).addEventListener("click",event=>{const target=event.target;if(target.tagName!=="A"||target.parentElement.id!==HELP_BUTTON_ID||event.ctrlKey||event.altKey||event.metaKey){return}event.preventDefault();const menu=getHelpMenu(true);const shouldShowHelp=menu.style.display==="none";if(shouldShowHelp){showHelp()}else{window.hidePopoverMenus()}})}setMobileTopbar();addSidebarItems();addSidebarCrates();onHashChange(null);window.addEventListener("hashchange",onHashChange);searchState.setup()}());(function(){let reset_button_timeout=null;const but=document.getElementById("copy-path");if(!but){return}but.onclick=()=>{const parent=but.parentElement;const path=[];onEach(parent.childNodes,child=>{if(child.tagName==="A"){path.push(child.textContent)}});const el=document.createElement("textarea");el.value=path.join("::");el.setAttribute("readonly","");el.style.position="absolute";el.style.left="-9999px";document.body.appendChild(el);el.select();document.execCommand("copy");document.body.removeChild(el);but.children[0].style.display="none";let tmp;if(but.childNodes.length<2){tmp=document.createTextNode("✓");but.appendChild(tmp)}else{onEachLazy(but.childNodes,e=>{if(e.nodeType===Node.TEXT_NODE){tmp=e;return true}});tmp.textContent="✓"}if(reset_button_timeout!==null){window.clearTimeout(reset_button_timeout)}function reset_button(){tmp.textContent="";reset_button_timeout=null;but.children[0].style.display=""}reset_button_timeout=window.setTimeout(reset_button,1000)}}()) \ No newline at end of file diff --git a/rust/static.files/rustdoc-fa3bb1812debf86c.css b/rust/static.files/rustdoc-9ee3a5e31a2afa3e.css similarity index 71% rename from rust/static.files/rustdoc-fa3bb1812debf86c.css rename to rust/static.files/rustdoc-9ee3a5e31a2afa3e.css index 2dd5cebc..8749d0eb 100644 --- a/rust/static.files/rustdoc-fa3bb1812debf86c.css +++ b/rust/static.files/rustdoc-9ee3a5e31a2afa3e.css @@ -1,9 +1,9 @@ - :root{--nav-sub-mobile-padding:8px;--search-typename-width:6.75rem;}@font-face {font-family:'Fira Sans';font-style:normal;font-weight:400;src:local('Fira Sans'),url("FiraSans-Regular-018c141bf0843ffd.woff2") format("woff2");font-display:swap;}@font-face {font-family:'Fira Sans';font-style:normal;font-weight:500;src:local('Fira Sans Medium'),url("FiraSans-Medium-8f9a781e4970d388.woff2") format("woff2");font-display:swap;}@font-face {font-family:'Source Serif 4';font-style:normal;font-weight:400;src:local('Source Serif 4'),url("SourceSerif4-Regular-46f98efaafac5295.ttf.woff2") format("woff2");font-display:swap;}@font-face {font-family:'Source Serif 4';font-style:italic;font-weight:400;src:local('Source Serif 4 Italic'),url("SourceSerif4-It-acdfaf1a8af734b1.ttf.woff2") format("woff2");font-display:swap;}@font-face {font-family:'Source Serif 4';font-style:normal;font-weight:700;src:local('Source Serif 4 Bold'),url("SourceSerif4-Bold-a2c9cd1067f8b328.ttf.woff2") format("woff2");font-display:swap;}@font-face {font-family:'Source Code Pro';font-style:normal;font-weight:400;src:url("SourceCodePro-Regular-562dcc5011b6de7d.ttf.woff2") format("woff2");font-display:swap;}@font-face {font-family:'Source Code Pro';font-style:italic;font-weight:400;src:url("SourceCodePro-It-1cc31594bf4f1f79.ttf.woff2") format("woff2");font-display:swap;}@font-face {font-family:'Source Code Pro';font-style:normal;font-weight:600;src:url("SourceCodePro-Semibold-d899c5a5c4aeb14a.ttf.woff2") format("woff2");font-display:swap;}@font-face {font-family:'NanumBarunGothic';src:url("NanumBarunGothic-0f09457c7a19b7c6.ttf.woff2") format("woff2");font-display:swap;unicode-range:U+AC00-D7AF,U+1100-11FF,U+3130-318F,U+A960-A97F,U+D7B0-D7FF;}*{box-sizing:border-box;}body{font:1rem/1.5 "Source Serif 4",NanumBarunGothic,serif;margin:0;position:relative;overflow-wrap:break-word;overflow-wrap:anywhere;font-feature-settings:"kern","liga";background-color:var(--main-background-color);color:var(--main-color);}h1{font-size:1.5rem;}h2{font-size:1.375rem;}h3{font-size:1.25rem;}h1,h2,h3,h4,h5,h6{font-weight:500;}h1,h2,h3,h4{margin:25px 0 15px 0;padding-bottom:6px;}.docblock h3,.docblock h4,h5,h6{margin:15px 0 5px 0;}.docblock>h2:first-child,.docblock>h3:first-child,.docblock>h4:first-child,.docblock>h5:first-child,.docblock>h6:first-child{margin-top:0;}.main-heading h1{margin:0;padding:0;flex-grow:1;overflow-wrap:break-word;overflow-wrap:anywhere;}.main-heading{display:flex;flex-wrap:wrap;padding-bottom:6px;margin-bottom:15px;}.content h2,.top-doc .docblock>h3,.top-doc .docblock>h4{border-bottom:1px solid var(--headings-border-bottom-color);}h1,h2{line-height:1.25;padding-top:3px;padding-bottom:9px;}h3.code-header{font-size:1.125rem;}h4.code-header{font-size:1rem;}.code-header{font-weight:600;margin:0;padding:0;white-space:pre-wrap;}#crate-search,h1,h2,h3,h4,h5,h6,.sidebar,.mobile-topbar,.search-input,.search-results .result-name,.item-name>a,.out-of-band,span.since,a.src,#help-button>a,summary.hideme,.scraped-example-list,ul.all-items{font-family:"Fira Sans",Arial,NanumBarunGothic,sans-serif;}#toggle-all-docs,a.anchor,.small-section-header a,#src-sidebar a,.rust a,.sidebar h2 a,.sidebar h3 a,.mobile-topbar h2 a,h1 a,.search-results a,.stab,.result-name i{color:var(--main-color);}span.enum,a.enum,span.struct,a.struct,span.union,a.union,span.primitive,a.primitive,span.type,a.type,span.foreigntype,a.foreigntype{color:var(--type-link-color);}span.trait,a.trait,span.traitalias,a.traitalias{color:var(--trait-link-color);}span.associatedtype,a.associatedtype,span.constant,a.constant,span.static,a.static{color:var(--assoc-item-link-color);}span.fn,a.fn,span.method,a.method,span.tymethod,a.tymethod{color:var(--function-link-color);}span.attr,a.attr,span.derive,a.derive,span.macro,a.macro{color:var(--macro-link-color);}span.mod,a.mod{color:var(--mod-link-color);}span.keyword,a.keyword{color:var(--keyword-link-color);}a{color:var(--link-color);text-decoration:none;}ol,ul{padding-left:24px;}ul ul,ol ul,ul ol,ol ol{margin-bottom:.625em;}p,.docblock>.warning{margin:0 0 .75em 0;}p:last-child,.docblock>.warning:last-child{margin:0;}button{padding:1px 6px;cursor:pointer;}button#toggle-all-docs{padding:0;background:none;border:none;-webkit-appearance:none;opacity:1;}.rustdoc{display:flex;flex-direction:row;flex-wrap:nowrap;}main{position:relative;flex-grow:1;padding:10px 15px 40px 45px;min-width:0;}.src main{padding:15px;}.width-limiter{max-width:960px;margin-right:auto;}details:not(.toggle) summary{margin-bottom:.6em;}code,pre,a.test-arrow,.code-header{font-family:"Source Code Pro",monospace;}.docblock code,.docblock-short code{border-radius:3px;padding:0 0.125em;}.docblock pre code,.docblock-short pre code{padding:0;}pre{padding:14px;line-height:1.5;}pre.item-decl{overflow-x:auto;}.item-decl .type-contents-toggle{contain:initial;}.src .content pre{padding:20px;}.rustdoc.src .example-wrap pre.src-line-numbers{padding:20px 0 20px 4px;}img{max-width:100%;}.sub-logo-container,.logo-container{line-height:0;display:block;}.sub-logo-container{margin-right:32px;}.sub-logo-container>img{height:60px;width:60px;object-fit:contain;}.rust-logo{filter:var(--rust-logo-filter);}.sidebar{font-size:0.875rem;flex:0 0 200px;overflow-y:scroll;overscroll-behavior:contain;position:sticky;height:100vh;top:0;left:0;}.rustdoc.src .sidebar{flex-basis:50px;border-right:1px solid;overflow-x:hidden;overflow-y:hidden;z-index:1;}.sidebar,.mobile-topbar,.sidebar-menu-toggle,#src-sidebar-toggle,#src-sidebar{background-color:var(--sidebar-background-color);}#src-sidebar-toggle>button:hover,#src-sidebar-toggle>button:focus{background-color:var(--sidebar-background-color-hover);}.src .sidebar>*:not(#src-sidebar-toggle){visibility:hidden;}.src-sidebar-expanded .src .sidebar{overflow-y:auto;flex-basis:300px;}.src-sidebar-expanded .src .sidebar>*:not(#src-sidebar-toggle){visibility:visible;}#all-types{margin-top:1em;}*{scrollbar-width:initial;scrollbar-color:var(--scrollbar-color);}.sidebar{scrollbar-width:thin;scrollbar-color:var(--scrollbar-color);}::-webkit-scrollbar{width:12px;}.sidebar::-webkit-scrollbar{width:8px;}::-webkit-scrollbar-track{-webkit-box-shadow:inset 0;background-color:var(--scrollbar-track-background-color);}.sidebar::-webkit-scrollbar-track{background-color:var(--scrollbar-track-background-color);}::-webkit-scrollbar-thumb,.sidebar::-webkit-scrollbar-thumb{background-color:var(--scrollbar-thumb-background-color);}.hidden{display:none !important;}.sidebar .logo-container{margin-top:10px;margin-bottom:10px;text-align:center;}.version{overflow-wrap:break-word;}.logo-container>img{height:100px;width:100px;}ul.block,.block li{padding:0;margin:0;list-style:none;}.sidebar-elems a,.sidebar>h2 a{display:block;padding:0.25rem;margin-left:-0.25rem;}.sidebar h2{overflow-wrap:anywhere;padding:0;margin:0.7rem 0;}.sidebar h3{font-size:1.125rem;padding:0;margin:0;}.sidebar-elems,.sidebar>h2{padding-left:24px;}.sidebar a{color:var(--sidebar-link-color);}.sidebar .current,.sidebar a:hover:not(.logo-container){background-color:var(--sidebar-current-link-background-color);}.sidebar-elems .block{margin-bottom:2em;}.sidebar-elems .block li a{white-space:nowrap;text-overflow:ellipsis;overflow:hidden;}.mobile-topbar{display:none;}.rustdoc .example-wrap{display:flex;position:relative;margin-bottom:10px;}.rustdoc .example-wrap:last-child{margin-bottom:0px;}.rustdoc .example-wrap pre{margin:0;flex-grow:1;}.rustdoc:not(.src) .example-wrap pre{overflow:auto hidden;}.rustdoc .example-wrap pre.example-line-numbers,.rustdoc .example-wrap pre.src-line-numbers{flex-grow:0;min-width:fit-content;overflow:initial;text-align:right;-webkit-user-select:none;user-select:none;padding:14px 8px;color:var(--src-line-numbers-span-color);}.rustdoc .example-wrap pre.src-line-numbers{padding:14px 0;}.src-line-numbers a,.src-line-numbers span{color:var(--src-line-numbers-span-color);padding:0 8px;}.src-line-numbers :target{background-color:transparent;border-right:none;padding:0 8px;}.src-line-numbers .line-highlighted{background-color:var(--src-line-number-highlighted-background-color);}.search-loading{text-align:center;}.docblock-short{overflow-wrap:break-word;overflow-wrap:anywhere;}.docblock :not(pre)>code,.docblock-short code{white-space:pre-wrap;}.top-doc .docblock h2{font-size:1.375rem;}.top-doc .docblock h3{font-size:1.25rem;}.top-doc .docblock h4,.top-doc .docblock h5{font-size:1.125rem;}.top-doc .docblock h6{font-size:1rem;}.docblock h5{font-size:1rem;}.docblock h6{font-size:0.875rem;}.docblock{margin-left:24px;position:relative;}.docblock>:not(.more-examples-toggle):not(.example-wrap){max-width:100%;overflow-x:auto;}.out-of-band{flex-grow:0;font-size:1.125rem;}.docblock code,.docblock-short code,pre,.rustdoc.src .example-wrap{background-color:var(--code-block-background-color);}#main-content{position:relative;}.docblock table{margin:.5em 0;border-collapse:collapse;}.docblock table td,.docblock table th{padding:.5em;border:1px solid var(--border-color);}.docblock table tbody tr:nth-child(2n){background:var(--table-alt-row-background-color);}.method .where,.fn .where,.where.fmt-newline{display:block;white-space:pre-wrap;font-size:0.875rem;}.item-info{display:block;margin-left:24px;}.item-info code{font-size:0.875rem;}#main-content>.item-info{margin-left:0;}nav.sub{flex-grow:1;flex-flow:row nowrap;margin:4px 0 25px 0;display:flex;align-items:center;}.search-form{position:relative;display:flex;height:34px;flex-grow:1;}.src nav.sub{margin:0 0 15px 0;}.small-section-header{display:block;position:relative;}.small-section-header:hover>.anchor,.impl:hover>.anchor,.trait-impl:hover>.anchor,.variant:hover>.anchor{display:initial;}.anchor{display:none;position:absolute;left:-0.5em;background:none !important;}.anchor.field{left:-5px;}.small-section-header>.anchor{left:-15px;padding-right:8px;}h2.small-section-header>.anchor{padding-right:6px;}.main-heading a:hover,.example-wrap .rust a:hover,.all-items a:hover,.docblock a:not(.test-arrow):not(.scrape-help):not(.tooltip):hover,.docblock-short a:not(.test-arrow):not(.scrape-help):not(.tooltip):hover,.item-info a{text-decoration:underline;}.crate.block a.current{font-weight:500;}table,.item-table{overflow-wrap:break-word;}.item-table{display:table;padding:0;margin:0;}.item-table>li{display:table-row;}.item-table>li>div{display:table-cell;}.item-table>li>.item-name{padding-right:1.25rem;}.search-results-title{margin-top:0;white-space:nowrap;display:flex;align-items:baseline;}#crate-search-div{position:relative;min-width:5em;}#crate-search{min-width:115px;padding:0 23px 0 4px;max-width:100%;text-overflow:ellipsis;border:1px solid var(--border-color);border-radius:4px;outline:none;cursor:pointer;-moz-appearance:none;-webkit-appearance:none;text-indent:0.01px;background-color:var(--main-background-color);color:inherit;line-height:1.5;font-weight:500;}#crate-search:hover,#crate-search:focus{border-color:var(--crate-search-hover-border);}#crate-search-div::after{pointer-events:none;width:100%;height:100%;position:absolute;top:0;left:0;content:"";background-repeat:no-repeat;background-size:20px;background-position:calc(100% - 2px) 56%;background-image:url('data:image/svg+xml,h2:first-child,.docblock>h3:first-child,.docblock>h4:first-child,.docblock>h5:first-child,.docblock>h6:first-child{margin-top:0;}.main-heading h1{margin:0;padding:0;flex-grow:1;overflow-wrap:break-word;overflow-wrap:anywhere;}.main-heading{display:flex;flex-wrap:wrap;padding-bottom:6px;margin-bottom:15px;}.content h2,.top-doc .docblock>h3,.top-doc .docblock>h4{border-bottom:1px solid var(--headings-border-bottom-color);}h1,h2{line-height:1.25;padding-top:3px;padding-bottom:9px;}h3.code-header{font-size:1.125rem;}h4.code-header{font-size:1rem;}.code-header{font-weight:600;margin:0;padding:0;white-space:pre-wrap;}#crate-search,h1,h2,h3,h4,h5,h6,.sidebar,.mobile-topbar,.search-input,.search-results .result-name,.item-name>a,.out-of-band,span.since,a.src,#help-button>a,summary.hideme,.scraped-example-list,ul.all-items{font-family:"Fira Sans",Arial,NanumBarunGothic,sans-serif;}#toggle-all-docs,a.anchor,.small-section-header a,#src-sidebar a,.rust a,.sidebar h2 a,.sidebar h3 a,.mobile-topbar h2 a,h1 a,.search-results a,.stab,.result-name i{color:var(--main-color);}span.enum,a.enum,span.struct,a.struct,span.union,a.union,span.primitive,a.primitive,span.type,a.type,span.foreigntype,a.foreigntype{color:var(--type-link-color);}span.trait,a.trait,span.traitalias,a.traitalias{color:var(--trait-link-color);}span.associatedtype,a.associatedtype,span.constant,a.constant,span.static,a.static{color:var(--assoc-item-link-color);}span.fn,a.fn,span.method,a.method,span.tymethod,a.tymethod{color:var(--function-link-color);}span.attr,a.attr,span.derive,a.derive,span.macro,a.macro{color:var(--macro-link-color);}span.mod,a.mod{color:var(--mod-link-color);}span.keyword,a.keyword{color:var(--keyword-link-color);}a{color:var(--link-color);text-decoration:none;}ol,ul{padding-left:24px;}ul ul,ol ul,ul ol,ol ol{margin-bottom:.625em;}p,.docblock>.warning{margin:0 0 .75em 0;}p:last-child,.docblock>.warning:last-child{margin:0;}button{padding:1px 6px;cursor:pointer;}button#toggle-all-docs{padding:0;background:none;border:none;-webkit-appearance:none;opacity:1;}.rustdoc{display:flex;flex-direction:row;flex-wrap:nowrap;}main{position:relative;flex-grow:1;padding:10px 15px 40px 45px;min-width:0;}.src main{padding:15px;}.width-limiter{max-width:960px;margin-right:auto;}details:not(.toggle) summary{margin-bottom:.6em;}code,pre,a.test-arrow,.code-header{font-family:"Source Code Pro",monospace;}.docblock code,.docblock-short code{border-radius:3px;padding:0 0.125em;}.docblock pre code,.docblock-short pre code{padding:0;}pre{padding:14px;line-height:1.5;}pre.item-decl{overflow-x:auto;}.item-decl .type-contents-toggle{contain:initial;}.src .content pre{padding:20px;}.rustdoc.src .example-wrap pre.src-line-numbers{padding:20px 0 20px 4px;}img{max-width:100%;}.sub-logo-container,.logo-container{line-height:0;display:block;}.sub-logo-container{margin-right:32px;}.sub-logo-container>img{height:60px;width:60px;object-fit:contain;}.rust-logo{filter:var(--rust-logo-filter);}.sidebar{font-size:0.875rem;flex:0 0 200px;overflow-y:scroll;overscroll-behavior:contain;position:sticky;height:100vh;top:0;left:0;}.rustdoc.src .sidebar{flex-basis:50px;border-right:1px solid;overflow-x:hidden;overflow-y:hidden;z-index:1;}.sidebar,.mobile-topbar,.sidebar-menu-toggle,#src-sidebar-toggle,#src-sidebar{background-color:var(--sidebar-background-color);}#src-sidebar-toggle>button:hover,#src-sidebar-toggle>button:focus{background-color:var(--sidebar-background-color-hover);}.src .sidebar>*:not(#src-sidebar-toggle){visibility:hidden;}.src-sidebar-expanded .src .sidebar{overflow-y:auto;flex-basis:300px;}.src-sidebar-expanded .src .sidebar>*:not(#src-sidebar-toggle){visibility:visible;}#all-types{margin-top:1em;}*{scrollbar-width:initial;scrollbar-color:var(--scrollbar-color);}.sidebar{scrollbar-width:thin;scrollbar-color:var(--scrollbar-color);}::-webkit-scrollbar{width:12px;}.sidebar::-webkit-scrollbar{width:8px;}::-webkit-scrollbar-track{-webkit-box-shadow:inset 0;background-color:var(--scrollbar-track-background-color);}.sidebar::-webkit-scrollbar-track{background-color:var(--scrollbar-track-background-color);}::-webkit-scrollbar-thumb,.sidebar::-webkit-scrollbar-thumb{background-color:var(--scrollbar-thumb-background-color);}.hidden{display:none !important;}.logo-container>img{height:48px;width:48px;}ul.block,.block li{padding:0;margin:0;list-style:none;}.sidebar-elems a,.sidebar>h2 a{display:block;padding:0.25rem;margin-left:-0.25rem;}.sidebar h2{overflow-wrap:anywhere;padding:0;margin:0.7rem 0;}.sidebar h3{font-size:1.125rem;padding:0;margin:0;}.sidebar-elems,.sidebar>.version,.sidebar>h2{padding-left:24px;}.sidebar a{color:var(--sidebar-link-color);}.sidebar .current,.sidebar .current a,.sidebar-crate a.logo-container:hover+h2 a,.sidebar a:hover:not(.logo-container){background-color:var(--sidebar-current-link-background-color);}.sidebar-elems .block{margin-bottom:2em;}.sidebar-elems .block li a{white-space:nowrap;text-overflow:ellipsis;overflow:hidden;}.sidebar-crate{display:flex;align-items:center;justify-content:center;margin:14px 32px 1rem;row-gap:10px;column-gap:32px;flex-wrap:wrap;}.sidebar-crate h2{flex-grow:1;margin:0 -8px;align-self:start;}.sidebar-crate .logo-container{margin:0 -16px 0 -16px;text-align:center;}.sidebar-crate h2 a{display:block;margin:0 calc(-24px + 0.25rem) 0 -0.5rem;padding:calc((16px - 0.57rem ) / 2 ) 0.25rem;padding-left:0.5rem;}.sidebar-crate h2 .version{display:block;font-weight:normal;font-size:1rem;overflow-wrap:break-word;margin-top:calc((-16px + 0.57rem ) / 2 );}.sidebar-crate+.version{margin-top:-1rem;margin-bottom:1rem;}.mobile-topbar{display:none;}.rustdoc .example-wrap{display:flex;position:relative;margin-bottom:10px;}.rustdoc .example-wrap:last-child{margin-bottom:0px;}.rustdoc .example-wrap pre{margin:0;flex-grow:1;}.rustdoc:not(.src) .example-wrap pre{overflow:auto hidden;}.rustdoc .example-wrap pre.example-line-numbers,.rustdoc .example-wrap pre.src-line-numbers{flex-grow:0;min-width:fit-content;overflow:initial;text-align:right;-webkit-user-select:none;user-select:none;padding:14px 8px;color:var(--src-line-numbers-span-color);}.rustdoc .example-wrap pre.src-line-numbers{padding:14px 0;}.src-line-numbers a,.src-line-numbers span{color:var(--src-line-numbers-span-color);padding:0 8px;}.src-line-numbers :target{background-color:transparent;border-right:none;padding:0 8px;}.src-line-numbers .line-highlighted{background-color:var(--src-line-number-highlighted-background-color);}.search-loading{text-align:center;}.docblock-short{overflow-wrap:break-word;overflow-wrap:anywhere;}.docblock :not(pre)>code,.docblock-short code{white-space:pre-wrap;}.top-doc .docblock h2{font-size:1.375rem;}.top-doc .docblock h3{font-size:1.25rem;}.top-doc .docblock h4,.top-doc .docblock h5{font-size:1.125rem;}.top-doc .docblock h6{font-size:1rem;}.docblock h5{font-size:1rem;}.docblock h6{font-size:0.875rem;}.docblock{margin-left:24px;position:relative;}.docblock>:not(.more-examples-toggle):not(.example-wrap){max-width:100%;overflow-x:auto;}.out-of-band{flex-grow:0;font-size:1.125rem;}.docblock code,.docblock-short code,pre,.rustdoc.src .example-wrap{background-color:var(--code-block-background-color);}#main-content{position:relative;}.docblock table{margin:.5em 0;border-collapse:collapse;}.docblock table td,.docblock table th{padding:.5em;border:1px solid var(--border-color);}.docblock table tbody tr:nth-child(2n){background:var(--table-alt-row-background-color);}.method .where,.fn .where,.where.fmt-newline{display:block;white-space:pre-wrap;font-size:0.875rem;}.item-info{display:block;margin-left:24px;}.item-info code{font-size:0.875rem;}#main-content>.item-info{margin-left:0;}nav.sub{flex-grow:1;flex-flow:row nowrap;margin:4px 0 25px 0;display:flex;align-items:center;}.search-form{position:relative;display:flex;height:34px;flex-grow:1;}.src nav.sub{margin:0 0 15px 0;}.small-section-header{display:block;position:relative;}.small-section-header:hover>.anchor,.impl:hover>.anchor,.trait-impl:hover>.anchor,.variant:hover>.anchor{display:initial;}.anchor{display:none;position:absolute;left:-0.5em;background:none !important;}.anchor.field{left:-5px;}.small-section-header>.anchor{left:-15px;padding-right:8px;}h2.small-section-header>.anchor{padding-right:6px;}.main-heading a:hover,.example-wrap .rust a:hover,.all-items a:hover,.docblock a:not(.test-arrow):not(.scrape-help):not(.tooltip):hover,.docblock-short a:not(.test-arrow):not(.scrape-help):not(.tooltip):hover,.item-info a{text-decoration:underline;}.crate.block a.current{font-weight:500;}table,.item-table{overflow-wrap:break-word;}.item-table{display:table;padding:0;margin:0;}.item-table>li{display:table-row;}.item-table>li>div{display:table-cell;}.item-table>li>.item-name{padding-right:1.25rem;}.search-results-title{margin-top:0;white-space:nowrap;display:flex;align-items:baseline;}#crate-search-div{position:relative;min-width:5em;}#crate-search{min-width:115px;padding:0 23px 0 4px;max-width:100%;text-overflow:ellipsis;border:1px solid var(--border-color);border-radius:4px;outline:none;cursor:pointer;-moz-appearance:none;-webkit-appearance:none;text-indent:0.01px;background-color:var(--main-background-color);color:inherit;line-height:1.5;font-weight:500;}#crate-search:hover,#crate-search:focus{border-color:var(--crate-search-hover-border);}#crate-search-div::after{pointer-events:none;width:100%;height:100%;position:absolute;top:0;left:0;content:"";background-repeat:no-repeat;background-size:20px;background-position:calc(100% - 2px) 56%;background-image:url('data:image/svg+xml, \ ');filter:var(--crate-search-div-filter);}#crate-search-div:hover::after,#crate-search-div:focus-within::after{filter:var(--crate-search-div-hover-filter);}#crate-search>option{font-size:1rem;}.search-input{-webkit-appearance:none;outline:none;border:1px solid var(--border-color);border-radius:2px;padding:8px;font-size:1rem;flex-grow:1;background-color:var(--button-background-color);color:var(--search-color);}.search-input:focus{border-color:var(--search-input-focused-border-color);}.search-results{display:none;}.search-results.active{display:block;}.search-results>a{display:flex;margin-left:2px;margin-right:2px;border-bottom:1px solid var(--search-result-border-color);gap:1em;}.search-results>a>div.desc{white-space:nowrap;text-overflow:ellipsis;overflow:hidden;flex:2;}.search-results a:hover,.search-results a:focus{background-color:var(--search-result-link-focus-background-color);}.search-results .result-name{display:flex;align-items:center;justify-content:start;flex:3;}.search-results .result-name .alias{color:var(--search-results-alias-color);}.search-results .result-name .grey{color:var(--search-results-grey-color);}.search-results .result-name .typename{color:var(--search-results-grey-color);font-size:0.875rem;width:var(--search-typename-width);}.search-results .result-name .path{word-break:break-all;max-width:calc(100% - var(--search-typename-width));display:inline-block;}.search-results .result-name .path>*{display:inline;}.popover{position:absolute;top:100%;right:0;z-index:2;margin-top:7px;border-radius:3px;border:1px solid var(--border-color);background-color:var(--main-background-color);color:var(--main-color);--popover-arrow-offset:11px;}.popover::before{content:'';position:absolute;right:var(--popover-arrow-offset);border:solid var(--border-color);border-width:1px 1px 0 0;background-color:var(--main-background-color);padding:4px;transform:rotate(-45deg);top:-5px;}.setting-line{margin:1.2em 0.6em;}.setting-radio input,.setting-check input{margin-right:0.3em;height:1.2rem;width:1.2rem;border:2px solid var(--settings-input-border-color);outline:none;-webkit-appearance:none;cursor:pointer;}.setting-radio input{border-radius:50%;}.setting-radio span,.setting-check span{padding-bottom:1px;}.setting-radio{margin-top:0.1em;margin-bottom:0.1em;min-width:3.8em;padding:0.3em;display:inline-flex;align-items:center;cursor:pointer;}.setting-radio+.setting-radio{margin-left:0.5em;}.setting-check{margin-right:20px;display:flex;align-items:center;cursor:pointer;}.setting-radio input:checked{box-shadow:inset 0 0 0 3px var(--main-background-color);background-color:var(--settings-input-color);}.setting-check input:checked{background-color:var(--settings-input-color);border-width:1px;content:url('data:image/svg+xml,\ \ - ');}.setting-radio input:focus,.setting-check input:focus{box-shadow:0 0 1px 1px var(--settings-input-color);}.setting-radio input:checked:focus{box-shadow:inset 0 0 0 3px var(--main-background-color),0 0 2px 2px var(--settings-input-color);}.setting-radio input:hover,.setting-check input:hover{border-color:var(--settings-input-color) !important;}#help.popover{max-width:600px;--popover-arrow-offset:48px;}#help dt{float:left;clear:left;margin-right:0.5rem;}#help span.top,#help span.bottom{text-align:center;display:block;font-size:1.125rem;}#help span.top{margin:10px 0;border-bottom:1px solid var(--border-color);padding-bottom:4px;margin-bottom:6px;}#help span.bottom{clear:both;border-top:1px solid var(--border-color);}.side-by-side>div{width:50%;float:left;padding:0 20px 20px 17px;}.item-info .stab{min-height:36px;display:flex;padding:3px;margin-bottom:5px;align-items:center;vertical-align:text-bottom;}.item-name .stab{margin-left:0.3125em;}.stab{padding:0 2px;font-size:0.875rem;font-weight:normal;color:var(--main-color);background-color:var(--stab-background-color);width:fit-content;white-space:pre-wrap;border-radius:3px;display:inline;}.stab.portability>code{background:none;color:var(--stab-code-color);}.stab .emoji{font-size:1.25rem;margin-right:0.3rem;}.emoji{text-shadow:1px 0 0 black,-1px 0 0 black,0 1px 0 black,0 -1px 0 black;}.since{font-weight:normal;font-size:initial;}.rightside{padding-left:12px;float:right;}.rightside:not(a),.out-of-band{color:var(--right-side-color);}pre.rust{tab-size:4;-moz-tab-size:4;}pre.rust .kw{color:var(--code-highlight-kw-color);}pre.rust .kw-2{color:var(--code-highlight-kw-2-color);}pre.rust .lifetime{color:var(--code-highlight-lifetime-color);}pre.rust .prelude-ty{color:var(--code-highlight-prelude-color);}pre.rust .prelude-val{color:var(--code-highlight-prelude-val-color);}pre.rust .string{color:var(--code-highlight-string-color);}pre.rust .number{color:var(--code-highlight-number-color);}pre.rust .bool-val{color:var(--code-highlight-literal-color);}pre.rust .self{color:var(--code-highlight-self-color);}pre.rust .attr{color:var(--code-highlight-attribute-color);}pre.rust .macro,pre.rust .macro-nonterminal{color:var(--code-highlight-macro-color);}pre.rust .question-mark{font-weight:bold;color:var(--code-highlight-question-mark-color);}pre.rust .comment{color:var(--code-highlight-comment-color);}pre.rust .doccomment{color:var(--code-highlight-doc-comment-color);}.rustdoc.src .example-wrap pre.rust a{background:var(--codeblock-link-background);}.example-wrap.compile_fail,.example-wrap.should_panic{border-left:2px solid var(--codeblock-error-color);}.ignore.example-wrap{border-left:2px solid var(--codeblock-ignore-color);}.example-wrap.compile_fail:hover,.example-wrap.should_panic:hover{border-left:2px solid var(--codeblock-error-hover-color);}.example-wrap.ignore:hover{border-left:2px solid var(--codeblock-ignore-hover-color);}.example-wrap.compile_fail .tooltip,.example-wrap.should_panic .tooltip{color:var(--codeblock-error-color);}.example-wrap.ignore .tooltip{color:var(--codeblock-ignore-color);}.example-wrap.compile_fail:hover .tooltip,.example-wrap.should_panic:hover .tooltip{color:var(--codeblock-error-hover-color);}.example-wrap.ignore:hover .tooltip{color:var(--codeblock-ignore-hover-color);}.example-wrap .tooltip{position:absolute;display:block;left:-25px;top:5px;margin:0;line-height:1;}.example-wrap.compile_fail .tooltip,.example-wrap.should_panic .tooltip,.example-wrap.ignore .tooltip{font-weight:bold;font-size:1.25rem;}.content .docblock .warning{border-left:2px solid var(--warning-border-color);padding:14px;position:relative;overflow-x:visible !important;}.content .docblock .warning::before{color:var(--warning-border-color);content:"ⓘ";position:absolute;left:-25px;top:5px;font-weight:bold;font-size:1.25rem;}a.test-arrow{visibility:hidden;position:absolute;padding:5px 10px 5px 10px;border-radius:5px;font-size:1.375rem;top:5px;right:5px;z-index:1;color:var(--test-arrow-color);background-color:var(--test-arrow-background-color);}a.test-arrow:hover{color:var(--test-arrow-hover-color);background-color:var(--test-arrow-hover-background-color);}.example-wrap:hover .test-arrow{visibility:visible;}.code-attribute{font-weight:300;color:var(--code-attribute-color);}.item-spacer{width:100%;height:12px;display:block;}.out-of-band>span.since{font-size:1.25rem;}.sub-variant h4{font-size:1rem;font-weight:400;margin-top:0;margin-bottom:0;}.sub-variant{margin-left:24px;margin-bottom:40px;}.sub-variant>.sub-variant-field{margin-left:24px;}:target{padding-right:3px;background-color:var(--target-background-color);border-right:3px solid var(--target-border-color);}.code-header a.tooltip{color:inherit;margin-right:15px;position:relative;}.code-header a.tooltip:hover{color:var(--link-color);}a.tooltip:hover::after{position:absolute;top:calc(100% - 10px);left:-15px;right:-15px;height:20px;content:"\00a0";}.fade-out{opacity:0;transition:opacity 0.45s cubic-bezier(0,0,0.1,1.0);}.popover.tooltip .content{margin:0.25em 0.5em;}.popover.tooltip .content pre,.popover.tooltip .content code{background:transparent;margin:0;padding:0;font-size:1.25rem;white-space:pre-wrap;}.popover.tooltip .content>h3:first-child{margin:0 0 5px 0;}.search-failed{text-align:center;margin-top:20px;display:none;}.search-failed.active{display:block;}.search-failed>ul{text-align:left;max-width:570px;margin-left:auto;margin-right:auto;}#search-tabs{display:flex;flex-direction:row;gap:1px;margin-bottom:4px;}#search-tabs button{text-align:center;font-size:1.125rem;border:0;border-top:2px solid;flex:1;line-height:1.5;color:inherit;}#search-tabs button:not(.selected){background-color:var(--search-tab-button-not-selected-background);border-top-color:var(--search-tab-button-not-selected-border-top-color);}#search-tabs button:hover,#search-tabs button.selected{background-color:var(--search-tab-button-selected-background);border-top-color:var(--search-tab-button-selected-border-top-color);}#search-tabs .count{font-size:1rem;font-variant-numeric:tabular-nums;color:var(--search-tab-title-count-color);}#search .error code{border-radius:3px;background-color:var(--search-error-code-background-color);}.search-corrections{font-weight:normal;}#src-sidebar-toggle{position:sticky;top:0;left:0;font-size:1.25rem;border-bottom:1px solid;display:flex;height:40px;justify-content:stretch;align-items:stretch;z-index:10;}#src-sidebar{width:100%;overflow:auto;}#src-sidebar>.title{font-size:1.5rem;text-align:center;border-bottom:1px solid var(--border-color);margin-bottom:6px;}#src-sidebar div.files>a:hover,details.dir-entry summary:hover,#src-sidebar div.files>a:focus,details.dir-entry summary:focus{background-color:var(--src-sidebar-background-hover);}#src-sidebar div.files>a.selected{background-color:var(--src-sidebar-background-selected);}#src-sidebar-toggle>button{font-size:inherit;font-weight:bold;background:none;color:inherit;text-align:center;border:none;outline:none;flex:1 1;-webkit-appearance:none;opacity:1;}#settings-menu,#help-button{margin-left:4px;display:flex;}#settings-menu>a,#help-button>a{display:flex;align-items:center;justify-content:center;background-color:var(--button-background-color);border:1px solid var(--border-color);border-radius:2px;color:var(--settings-button-color);font-size:20px;width:33px;}#settings-menu>a:hover,#settings-menu>a:focus,#help-button>a:hover,#help-button>a:focus{border-color:var(--settings-button-border-focus);}#copy-path{color:var(--copy-path-button-color);background:var(--main-background-color);height:34px;margin-left:10px;padding:0;padding-left:2px;border:0;width:33px;}#copy-path>img{filter:var(--copy-path-img-filter);}#copy-path:hover>img{filter:var(--copy-path-img-hover-filter);}@keyframes rotating{from{transform:rotate(0deg);}to{transform:rotate(360deg);}}#settings-menu.rotate>a img{animation:rotating 2s linear infinite;}kbd{display:inline-block;padding:3px 5px;font:15px monospace;line-height:10px;vertical-align:middle;border:solid 1px var(--border-color);border-radius:3px;color:var(--kbd-color);background-color:var(--kbd-background);box-shadow:inset 0 -1px 0 var(--kbd-box-shadow-color);}ul.all-items>li{list-style:none;}details.dir-entry{padding-left:4px;}details.dir-entry>summary{margin:0 0 0 -4px;padding:0 0 0 4px;cursor:pointer;}details.dir-entry div.folders,details.dir-entry div.files{padding-left:23px;}details.dir-entry a{display:block;}details.toggle{contain:layout;position:relative;}details.toggle>summary.hideme{cursor:pointer;font-size:1rem;}details.toggle>summary{list-style:none;outline:none;}details.toggle>summary::-webkit-details-marker,details.toggle>summary::marker{display:none;}details.toggle>summary.hideme>span{margin-left:9px;}details.toggle>summary::before{background:url('data:image/svg+xml,');}.setting-radio input:focus,.setting-check input:focus{box-shadow:0 0 1px 1px var(--settings-input-color);}.setting-radio input:checked:focus{box-shadow:inset 0 0 0 3px var(--main-background-color),0 0 2px 2px var(--settings-input-color);}.setting-radio input:hover,.setting-check input:hover{border-color:var(--settings-input-color) !important;}#help.popover{max-width:600px;--popover-arrow-offset:48px;}#help dt{float:left;clear:left;margin-right:0.5rem;}#help span.top,#help span.bottom{text-align:center;display:block;font-size:1.125rem;}#help span.top{margin:10px 0;border-bottom:1px solid var(--border-color);padding-bottom:4px;margin-bottom:6px;}#help span.bottom{clear:both;border-top:1px solid var(--border-color);}.side-by-side>div{width:50%;float:left;padding:0 20px 20px 17px;}.item-info .stab{min-height:36px;display:flex;padding:3px;margin-bottom:5px;align-items:center;vertical-align:text-bottom;}.item-name .stab{margin-left:0.3125em;}.stab{padding:0 2px;font-size:0.875rem;font-weight:normal;color:var(--main-color);background-color:var(--stab-background-color);width:fit-content;white-space:pre-wrap;border-radius:3px;display:inline;vertical-align:baseline;}.stab.portability>code{background:none;color:var(--stab-code-color);}.stab .emoji{font-size:1.25rem;margin-right:0.3rem;}.emoji{text-shadow:1px 0 0 black,-1px 0 0 black,0 1px 0 black,0 -1px 0 black;}.since{font-weight:normal;font-size:initial;}.rightside{padding-left:12px;float:right;}.rightside:not(a),.out-of-band{color:var(--right-side-color);}pre.rust{tab-size:4;-moz-tab-size:4;}pre.rust .kw{color:var(--code-highlight-kw-color);}pre.rust .kw-2{color:var(--code-highlight-kw-2-color);}pre.rust .lifetime{color:var(--code-highlight-lifetime-color);}pre.rust .prelude-ty{color:var(--code-highlight-prelude-color);}pre.rust .prelude-val{color:var(--code-highlight-prelude-val-color);}pre.rust .string{color:var(--code-highlight-string-color);}pre.rust .number{color:var(--code-highlight-number-color);}pre.rust .bool-val{color:var(--code-highlight-literal-color);}pre.rust .self{color:var(--code-highlight-self-color);}pre.rust .attr{color:var(--code-highlight-attribute-color);}pre.rust .macro,pre.rust .macro-nonterminal{color:var(--code-highlight-macro-color);}pre.rust .question-mark{font-weight:bold;color:var(--code-highlight-question-mark-color);}pre.rust .comment{color:var(--code-highlight-comment-color);}pre.rust .doccomment{color:var(--code-highlight-doc-comment-color);}.rustdoc.src .example-wrap pre.rust a{background:var(--codeblock-link-background);}.example-wrap.compile_fail,.example-wrap.should_panic{border-left:2px solid var(--codeblock-error-color);}.ignore.example-wrap{border-left:2px solid var(--codeblock-ignore-color);}.example-wrap.compile_fail:hover,.example-wrap.should_panic:hover{border-left:2px solid var(--codeblock-error-hover-color);}.example-wrap.ignore:hover{border-left:2px solid var(--codeblock-ignore-hover-color);}.example-wrap.compile_fail .tooltip,.example-wrap.should_panic .tooltip{color:var(--codeblock-error-color);}.example-wrap.ignore .tooltip{color:var(--codeblock-ignore-color);}.example-wrap.compile_fail:hover .tooltip,.example-wrap.should_panic:hover .tooltip{color:var(--codeblock-error-hover-color);}.example-wrap.ignore:hover .tooltip{color:var(--codeblock-ignore-hover-color);}.example-wrap .tooltip{position:absolute;display:block;left:-25px;top:5px;margin:0;line-height:1;}.example-wrap.compile_fail .tooltip,.example-wrap.should_panic .tooltip,.example-wrap.ignore .tooltip{font-weight:bold;font-size:1.25rem;}.content .docblock .warning{border-left:2px solid var(--warning-border-color);padding:14px;position:relative;overflow-x:visible !important;}.content .docblock .warning::before{color:var(--warning-border-color);content:"ⓘ";position:absolute;left:-25px;top:5px;font-weight:bold;font-size:1.25rem;}a.test-arrow{visibility:hidden;position:absolute;padding:5px 10px 5px 10px;border-radius:5px;font-size:1.375rem;top:5px;right:5px;z-index:1;color:var(--test-arrow-color);background-color:var(--test-arrow-background-color);}a.test-arrow:hover{color:var(--test-arrow-hover-color);background-color:var(--test-arrow-hover-background-color);}.example-wrap:hover .test-arrow{visibility:visible;}.code-attribute{font-weight:300;color:var(--code-attribute-color);}.item-spacer{width:100%;height:12px;display:block;}.out-of-band>span.since{font-size:1.25rem;}.sub-variant h4{font-size:1rem;font-weight:400;margin-top:0;margin-bottom:0;}.sub-variant{margin-left:24px;margin-bottom:40px;}.sub-variant>.sub-variant-field{margin-left:24px;}:target{padding-right:3px;background-color:var(--target-background-color);border-right:3px solid var(--target-border-color);}.code-header a.tooltip{color:inherit;margin-right:15px;position:relative;}.code-header a.tooltip:hover{color:var(--link-color);}a.tooltip:hover::after{position:absolute;top:calc(100% - 10px);left:-15px;right:-15px;height:20px;content:"\00a0";}.fade-out{opacity:0;transition:opacity 0.45s cubic-bezier(0,0,0.1,1.0);}.popover.tooltip .content{margin:0.25em 0.5em;}.popover.tooltip .content pre,.popover.tooltip .content code{background:transparent;margin:0;padding:0;font-size:1.25rem;white-space:pre-wrap;}.popover.tooltip .content>h3:first-child{margin:0 0 5px 0;}.search-failed{text-align:center;margin-top:20px;display:none;}.search-failed.active{display:block;}.search-failed>ul{text-align:left;max-width:570px;margin-left:auto;margin-right:auto;}#search-tabs{display:flex;flex-direction:row;gap:1px;margin-bottom:4px;}#search-tabs button{text-align:center;font-size:1.125rem;border:0;border-top:2px solid;flex:1;line-height:1.5;color:inherit;}#search-tabs button:not(.selected){background-color:var(--search-tab-button-not-selected-background);border-top-color:var(--search-tab-button-not-selected-border-top-color);}#search-tabs button:hover,#search-tabs button.selected{background-color:var(--search-tab-button-selected-background);border-top-color:var(--search-tab-button-selected-border-top-color);}#search-tabs .count{font-size:1rem;font-variant-numeric:tabular-nums;color:var(--search-tab-title-count-color);}#search .error code{border-radius:3px;background-color:var(--search-error-code-background-color);}.search-corrections{font-weight:normal;}#src-sidebar-toggle{position:sticky;top:0;left:0;font-size:1.25rem;border-bottom:1px solid;display:flex;height:40px;justify-content:stretch;align-items:stretch;z-index:10;}#src-sidebar{width:100%;overflow:auto;}#src-sidebar>.title{font-size:1.5rem;text-align:center;border-bottom:1px solid var(--border-color);margin-bottom:6px;}#src-sidebar div.files>a:hover,details.dir-entry summary:hover,#src-sidebar div.files>a:focus,details.dir-entry summary:focus{background-color:var(--src-sidebar-background-hover);}#src-sidebar div.files>a.selected{background-color:var(--src-sidebar-background-selected);}#src-sidebar-toggle>button{font-size:inherit;font-weight:bold;background:none;color:inherit;text-align:center;border:none;outline:none;flex:1 1;-webkit-appearance:none;opacity:1;}#settings-menu,#help-button{margin-left:4px;display:flex;}#settings-menu>a,#help-button>a{display:flex;align-items:center;justify-content:center;background-color:var(--button-background-color);border:1px solid var(--border-color);border-radius:2px;color:var(--settings-button-color);font-size:20px;width:33px;}#settings-menu>a:hover,#settings-menu>a:focus,#help-button>a:hover,#help-button>a:focus{border-color:var(--settings-button-border-focus);}#copy-path{color:var(--copy-path-button-color);background:var(--main-background-color);height:34px;margin-left:10px;padding:0;padding-left:2px;border:0;width:33px;}#copy-path>img{filter:var(--copy-path-img-filter);}#copy-path:hover>img{filter:var(--copy-path-img-hover-filter);}@keyframes rotating{from{transform:rotate(0deg);}to{transform:rotate(360deg);}}#settings-menu.rotate>a img{animation:rotating 2s linear infinite;}kbd{display:inline-block;padding:3px 5px;font:15px monospace;line-height:10px;vertical-align:middle;border:solid 1px var(--border-color);border-radius:3px;color:var(--kbd-color);background-color:var(--kbd-background);box-shadow:inset 0 -1px 0 var(--kbd-box-shadow-color);}ul.all-items>li{list-style:none;}details.dir-entry{padding-left:4px;}details.dir-entry>summary{margin:0 0 0 -4px;padding:0 0 0 4px;cursor:pointer;}details.dir-entry div.folders,details.dir-entry div.files{padding-left:23px;}details.dir-entry a{display:block;}details.toggle{contain:layout;position:relative;}details.toggle>summary.hideme{cursor:pointer;font-size:1rem;}details.toggle>summary{list-style:none;outline:none;}details.toggle>summary::-webkit-details-marker,details.toggle>summary::marker{display:none;}details.toggle>summary.hideme>span{margin-left:9px;}details.toggle>summary::before{background:url('data:image/svg+xml,') no-repeat top left;content:"";cursor:pointer;width:16px;height:16px;display:inline-block;vertical-align:middle;opacity:.5;filter:var(--toggle-filter);}details.toggle>summary.hideme>span,.more-examples-toggle summary,.more-examples-toggle .hide-more{color:var(--toggles-color);}details.toggle>summary::after{content:"Expand";overflow:hidden;width:0;height:0;position:absolute;}details.toggle>summary.hideme::after{content:"";}details.toggle>summary:focus::before,details.toggle>summary:hover::before{opacity:1;}details.toggle>summary:focus-visible::before{outline:1px dotted #000;outline-offset:1px;}details.non-exhaustive{margin-bottom:8px;}details.toggle>summary.hideme::before{position:relative;}details.toggle>summary:not(.hideme)::before{position:absolute;left:-24px;top:4px;}.impl-items>details.toggle>summary:not(.hideme)::before{position:absolute;left:-24px;}details.toggle[open] >summary.hideme{position:absolute;}details.toggle[open] >summary.hideme>span{display:none;}details.toggle[open] >summary::before{background:url('data:image/svg+xml,{if(nb===iter){addClass(elem,"selected");foundCurrentTab=true}else{removeClass(elem,"selected")}iter+=1});const isTypeSearch=(nb>0||iter===1);iter=0;onEachLazy(document.getElementById("results").childNodes,elem=>{if(nb===iter){addClass(elem,"active");foundCurrentResultSet=true}else{removeClass(elem,"active")}iter+=1});if(foundCurrentTab&&foundCurrentResultSet){searchState.currentTab=nb;const correctionsElem=document.getElementsByClassName("search-corrections");if(isTypeSearch){removeClass(correctionsElem[0],"hidden")}else{addClass(correctionsElem[0],"hidden")}}else if(nb!==0){printTab(0)}}const editDistanceState={current:[],prev:[],prevPrev:[],calculate:function calculate(a,b,limit){if(a.lengthlimit){return limit+1}while(b.length>0&&b[0]===a[0]){a=a.substring(1);b=b.substring(1)}while(b.length>0&&b[b.length-1]===a[a.length-1]){a=a.substring(0,a.length-1);b=b.substring(0,b.length-1)}if(b.length===0){return minDist}const aLength=a.length;const bLength=b.length;for(let i=0;i<=bLength;++i){this.current[i]=0;this.prev[i]=i;this.prevPrev[i]=Number.MAX_VALUE}for(let i=1;i<=aLength;++i){this.current[0]=i;const aIdx=i-1;for(let j=1;j<=bLength;++j){const bIdx=j-1;const substitutionCost=a[aIdx]===b[bIdx]?0:1;this.current[j]=Math.min(this.prev[j]+1,this.current[j-1]+1,this.prev[j-1]+substitutionCost);if((i>1)&&(j>1)&&(a[aIdx]===b[bIdx-1])&&(a[aIdx-1]===b[bIdx])){this.current[j]=Math.min(this.current[j],this.prevPrev[j-2]+1)}}const prevPrevTmp=this.prevPrev;this.prevPrev=this.prev;this.prev=this.current;this.current=prevPrevTmp}const distance=this.prev[bLength];return distance<=limit?distance:(limit+1)},};function editDistance(a,b,limit){return editDistanceState.calculate(a,b,limit)}function initSearch(rawSearchIndex){const MAX_RESULTS=200;const NO_TYPE_FILTER=-1;let searchIndex;let currentResults;let typeNameIdMap;const ALIASES=new Map();let typeNameIdOfArray;let typeNameIdOfSlice;let typeNameIdOfArrayOrSlice;function buildTypeMapIndex(name){if(name===""||name===null){return null}if(typeNameIdMap.has(name)){return typeNameIdMap.get(name)}else{const id=typeNameIdMap.size;typeNameIdMap.set(name,id);return id}}function isWhitespace(c){return" \t\n\r".indexOf(c)!==-1}function isSpecialStartCharacter(c){return"<\"".indexOf(c)!==-1}function isEndCharacter(c){return",>-]".indexOf(c)!==-1}function isStopCharacter(c){return isEndCharacter(c)}function isErrorCharacter(c){return"()".indexOf(c)!==-1}function itemTypeFromName(typename){const index=itemTypes.findIndex(i=>i===typename);if(index<0){throw["Unknown type filter ",typename]}return index}function getStringElem(query,parserState,isInGenerics){if(isInGenerics){throw["Unexpected ","\""," in generics"]}else if(query.literalSearch){throw["Cannot have more than one literal search element"]}else if(parserState.totalElems-parserState.genericsElems>0){throw["Cannot use literal search when there is more than one element"]}parserState.pos+=1;const start=parserState.pos;const end=getIdentEndPosition(parserState);if(parserState.pos>=parserState.length){throw["Unclosed ","\""]}else if(parserState.userQuery[end]!=="\""){throw["Unexpected ",parserState.userQuery[end]," in a string element"]}else if(start===end){throw["Cannot have empty string element"]}parserState.pos+=1;query.literalSearch=true}function isPathStart(parserState){return parserState.userQuery.slice(parserState.pos,parserState.pos+2)==="::"}function isReturnArrow(parserState){return parserState.userQuery.slice(parserState.pos,parserState.pos+2)==="->"}function isIdentCharacter(c){return(c==="_"||(c>="0"&&c<="9")||(c>="a"&&c<="z")||(c>="A"&&c<="Z"))}function isSeparatorCharacter(c){return c===","}function isPathSeparator(c){return c===":"||isWhitespace(c)}function prevIs(parserState,lookingFor){let pos=parserState.pos;while(pos>0){const c=parserState.userQuery[pos-1];if(c===lookingFor){return true}else if(!isWhitespace(c)){break}pos-=1}return false}function isLastElemGeneric(elems,parserState){return(elems.length>0&&elems[elems.length-1].generics.length>0)||prevIs(parserState,">")}function skipWhitespace(parserState){while(parserState.pos0){throw["Cannot have more than one element if you use quotes"]}const typeFilter=parserState.typeFilter;parserState.typeFilter=null;if(name==="!"){if(typeFilter!==null&&typeFilter!=="primitive"){throw["Invalid search type: primitive never type ","!"," and ",typeFilter," both specified",]}if(generics.length!==0){throw["Never type ","!"," does not accept generic parameters",]}return{name:"never",id:null,fullPath:["never"],pathWithoutLast:[],pathLast:"never",generics:[],typeFilter:"primitive",}}if(path.startsWith("::")){throw["Paths cannot start with ","::"]}else if(path.endsWith("::")){throw["Paths cannot end with ","::"]}else if(path.includes("::::")){throw["Unexpected ","::::"]}else if(path.includes(" ::")){throw["Unexpected "," ::"]}else if(path.includes(":: ")){throw["Unexpected ",":: "]}const pathSegments=path.split(/::|\s+/);if(pathSegments.length===0||(pathSegments.length===1&&pathSegments[0]==="")){if(generics.length>0||prevIs(parserState,">")){throw["Found generics without a path"]}else{throw["Unexpected ",parserState.userQuery[parserState.pos]]}}for(const[i,pathSegment]of pathSegments.entries()){if(pathSegment==="!"){if(i!==0){throw["Never type ","!"," is not associated item"]}pathSegments[i]="never"}}parserState.totalElems+=1;if(isInGenerics){parserState.genericsElems+=1}return{name:name.trim(),id:null,fullPath:pathSegments,pathWithoutLast:pathSegments.slice(0,pathSegments.length-1),pathLast:pathSegments[pathSegments.length-1],generics:generics,typeFilter,}}function getIdentEndPosition(parserState){const start=parserState.pos;let end=parserState.pos;let foundExclamation=-1;while(parserState.pos=end){throw["Found generics without a path"]}parserState.pos+=1;getItemsBefore(query,parserState,generics,">")}if(isStringElem){skipWhitespace(parserState)}if(start>=end&&generics.length===0){return}elems.push(createQueryElement(query,parserState,parserState.userQuery.slice(start,end),generics,isInGenerics))}}function getItemsBefore(query,parserState,elems,endChar){let foundStopChar=true;let start=parserState.pos;const oldTypeFilter=parserState.typeFilter;parserState.typeFilter=null;let extra="";if(endChar===">"){extra="<"}else if(endChar==="]"){extra="["}else if(endChar===""){extra="->"}else{extra=endChar}while(parserState.pos"]}else if(prevIs(parserState,"\"")){throw["Cannot have more than one element if you use quotes"]}if(endChar!==""){throw["Expected ",","," or ",endChar,...extra,", found ",c,]}throw["Expected ",",",...extra,", found ",c,]}const posBefore=parserState.pos;start=parserState.pos;getNextElem(query,parserState,elems,endChar!=="");if(endChar!==""&&parserState.pos>=parserState.length){throw["Unclosed ",extra]}if(posBefore===parserState.pos){parserState.pos+=1}foundStopChar=false}if(parserState.pos>=parserState.length&&endChar!==""){throw["Unclosed ",extra]}parserState.pos+=1;parserState.typeFilter=oldTypeFilter}function checkExtraTypeFilterCharacters(start,parserState){const query=parserState.userQuery.slice(start,parserState.pos).trim();for(const c in query){if(!isIdentCharacter(query[c])){throw["Unexpected ",query[c]," in type filter (before ",":",")",]}}}function parseInput(query,parserState){let foundStopChar=true;let start=parserState.pos;while(parserState.pos"){if(isReturnArrow(parserState)){break}throw["Unexpected ",c," (did you mean ","->","?)"]}throw["Unexpected ",c]}else if(c===":"&&!isPathStart(parserState)){if(parserState.typeFilter!==null){throw["Unexpected ",":"," (expected path after type filter ",parserState.typeFilter+":",")",]}else if(query.elems.length===0){throw["Expected type filter before ",":"]}else if(query.literalSearch){throw["Cannot use quotes on type filter"]}const typeFilterElem=query.elems.pop();checkExtraTypeFilterCharacters(start,parserState);parserState.typeFilter=typeFilterElem.name;parserState.pos+=1;parserState.totalElems-=1;query.literalSearch=false;foundStopChar=true;continue}else if(isWhitespace(c)){skipWhitespace(parserState);continue}if(!foundStopChar){let extra="";if(isLastElemGeneric(query.elems,parserState)){extra=[" after ",">"]}else if(prevIs(parserState,"\"")){throw["Cannot have more than one element if you use quotes"]}if(parserState.typeFilter!==null){throw["Expected ",","," or ","->",...extra,", found ",c,]}throw["Expected ",",",", ",":"," or ","->",...extra,", found ",c,]}const before=query.elems.length;start=parserState.pos;getNextElem(query,parserState,query.elems,false);if(query.elems.length===before){parserState.pos+=1}foundStopChar=false}if(parserState.typeFilter!==null){throw["Unexpected ",":"," (expected path after type filter ",parserState.typeFilter+":",")",]}while(parserState.pos"]}break}else{parserState.pos+=1}}}function newParsedQuery(userQuery){return{original:userQuery,userQuery:userQuery.toLowerCase(),elems:[],returned:[],foundElems:0,totalElems:0,literalSearch:false,error:null,correction:null,proposeCorrectionFrom:null,proposeCorrectionTo:null,}}function buildUrl(search,filterCrates){let extra="?search="+encodeURIComponent(search);if(filterCrates!==null){extra+="&filter-crate="+encodeURIComponent(filterCrates)}return getNakedUrl()+extra+window.location.hash}function getFilterCrates(){const elem=document.getElementById("crate-search");if(elem&&elem.value!=="all crates"&&hasOwnPropertyRustdoc(rawSearchIndex,elem.value)){return elem.value}return null}function parseQuery(userQuery){function convertTypeFilterOnElem(elem){if(elem.typeFilter!==null){let typeFilter=elem.typeFilter;if(typeFilter==="const"){typeFilter="constant"}elem.typeFilter=itemTypeFromName(typeFilter)}else{elem.typeFilter=NO_TYPE_FILTER}for(const elem2 of elem.generics){convertTypeFilterOnElem(elem2)}}userQuery=userQuery.trim();const parserState={length:userQuery.length,pos:0,totalElems:0,genericsElems:0,typeFilter:null,userQuery:userQuery.toLowerCase(),};let query=newParsedQuery(userQuery);try{parseInput(query,parserState);for(const elem of query.elems){convertTypeFilterOnElem(elem)}for(const elem of query.returned){convertTypeFilterOnElem(elem)}}catch(err){query=newParsedQuery(userQuery);query.error=err;return query}if(!query.literalSearch){query.literalSearch=parserState.totalElems>1}query.foundElems=query.elems.length+query.returned.length;query.totalElems=parserState.totalElems;return query}function createQueryResults(results_in_args,results_returned,results_others,parsedQuery){return{"in_args":results_in_args,"returned":results_returned,"others":results_others,"query":parsedQuery,}}function execQuery(parsedQuery,searchWords,filterCrates,currentCrate){const results_others=new Map(),results_in_args=new Map(),results_returned=new Map();function transformResults(results){const duplicates=new Set();const out=[];for(const result of results){if(result.id!==-1){const obj=searchIndex[result.id];obj.dist=result.dist;const res=buildHrefAndPath(obj);obj.displayPath=pathSplitter(res[0]);obj.fullPath=obj.displayPath+obj.name;obj.fullPath+="|"+obj.ty;if(duplicates.has(obj.fullPath)){continue}duplicates.add(obj.fullPath);obj.href=res[1];out.push(obj);if(out.length>=MAX_RESULTS){break}}}return out}function sortResults(results,isType,preferredCrate){if(results.size===0){return[]}const userQuery=parsedQuery.userQuery;const result_list=[];for(const result of results.values()){result.word=searchWords[result.id];result.item=searchIndex[result.id]||{};result_list.push(result)}result_list.sort((aaa,bbb)=>{let a,b;a=(aaa.word!==userQuery);b=(bbb.word!==userQuery);if(a!==b){return a-b}a=(aaa.index<0);b=(bbb.index<0);if(a!==b){return a-b}a=aaa.path_dist;b=bbb.path_dist;if(a!==b){return a-b}a=aaa.index;b=bbb.index;if(a!==b){return a-b}a=(aaa.dist);b=(bbb.dist);if(a!==b){return a-b}a=aaa.item.deprecated;b=bbb.item.deprecated;if(a!==b){return a-b}a=(aaa.item.crate!==preferredCrate);b=(bbb.item.crate!==preferredCrate);if(a!==b){return a-b}a=aaa.word.length;b=bbb.word.length;if(a!==b){return a-b}a=aaa.word;b=bbb.word;if(a!==b){return(a>b?+1:-1)}if((aaa.item.ty===TY_PRIMITIVE&&bbb.item.ty!==TY_KEYWORD)||(aaa.item.ty===TY_KEYWORD&&bbb.item.ty!==TY_PRIMITIVE)){return-1}if((bbb.item.ty===TY_PRIMITIVE&&aaa.item.ty!==TY_PRIMITIVE)||(bbb.item.ty===TY_KEYWORD&&aaa.item.ty!==TY_KEYWORD)){return 1}a=(aaa.item.desc==="");b=(bbb.item.desc==="");if(a!==b){return a-b}a=aaa.item.ty;b=bbb.item.ty;if(a!==b){return a-b}a=aaa.item.path;b=bbb.item.path;if(a!==b){return(a>b?+1:-1)}return 0});let nameSplit=null;if(parsedQuery.elems.length===1){const hasPath=typeof parsedQuery.elems[0].path==="undefined";nameSplit=hasPath?null:parsedQuery.elems[0].path}for(const result of result_list){if(result.dontValidate){continue}const name=result.item.name.toLowerCase(),path=result.item.path.toLowerCase(),parent=result.item.parent;if(!isType&&!validateResult(name,path,nameSplit,parent)){result.id=-1}}return transformResults(result_list)}function checkGenerics(fnType,queryElem,whereClause,mgensInout){return unifyFunctionTypes(fnType.generics,queryElem.generics,whereClause,mgensInout,mgens=>{if(mgensInout){for(const[fid,qid]of mgens.entries()){mgensInout.set(fid,qid)}}return true})}function unifyFunctionTypes(fnTypesIn,queryElems,whereClause,mgensIn,solutionCb){let mgens=new Map(mgensIn);if(queryElems.length===0){return!solutionCb||solutionCb(mgens)}if(!fnTypesIn||fnTypesIn.length===0){return false}const ql=queryElems.length;let fl=fnTypesIn.length;let fnTypes=fnTypesIn.slice();const backtracking=[];let i=0;let j=0;const backtrack=()=>{while(backtracking.length!==0){const{fnTypesScratch,mgensScratch,queryElemsOffset,fnTypesOffset,unbox,}=backtracking.pop();mgens=new Map(mgensScratch);const fnType=fnTypesScratch[fnTypesOffset];const queryElem=queryElems[queryElemsOffset];if(unbox){if(fnType.id<0){if(mgens.has(fnType.id)&&mgens.get(fnType.id)!==0){continue}mgens.set(fnType.id,0)}const generics=fnType.id<0?whereClause[(-fnType.id)-1]:fnType.generics;fnTypes=fnTypesScratch.toSpliced(fnTypesOffset,1,...generics);fl=fnTypes.length;i=queryElemsOffset-1}else{if(fnType.id<0){if(mgens.has(fnType.id)&&mgens.get(fnType.id)!==queryElem.id){continue}mgens.set(fnType.id,queryElem.id)}fnTypes=fnTypesScratch.slice();fl=fnTypes.length;const tmp=fnTypes[queryElemsOffset];fnTypes[queryElemsOffset]=fnTypes[fnTypesOffset];fnTypes[fnTypesOffset]=tmp;i=queryElemsOffset}return true}return false};for(i=0;i!==ql;++i){const queryElem=queryElems[i];const matchCandidates=[];let fnTypesScratch=null;let mgensScratch=null;for(j=i;j!==fl;++j){const fnType=fnTypes[j];if(unifyFunctionTypeIsMatchCandidate(fnType,queryElem,whereClause,mgens)){if(!fnTypesScratch){fnTypesScratch=fnTypes.slice()}unifyFunctionTypes(fnType.generics,queryElem.generics,whereClause,mgens,mgensScratch=>{matchCandidates.push({fnTypesScratch,mgensScratch,queryElemsOffset:i,fnTypesOffset:j,unbox:false,});return false})}if(unifyFunctionTypeIsUnboxCandidate(fnType,queryElem,whereClause,mgens)){if(!fnTypesScratch){fnTypesScratch=fnTypes.slice()}if(!mgensScratch){mgensScratch=new Map(mgens)}backtracking.push({fnTypesScratch,mgensScratch,queryElemsOffset:i,fnTypesOffset:j,unbox:true,})}}if(matchCandidates.length===0){if(backtrack()){continue}else{return false}}const{fnTypesOffset:candidate,mgensScratch:mgensNew}=matchCandidates.pop();if(fnTypes[candidate].id<0&&queryElems[i].id<0){mgens.set(fnTypes[candidate].id,queryElems[i].id)}for(const[fid,qid]of mgensNew){mgens.set(fid,qid)}const tmp=fnTypes[candidate];fnTypes[candidate]=fnTypes[i];fnTypes[i]=tmp;for(const otherCandidate of matchCandidates){backtracking.push(otherCandidate)}while(i===(ql-1)&&solutionCb&&!solutionCb(mgens)){if(!backtrack()){return false}}}return true}function unifyFunctionTypeIsMatchCandidate(fnType,queryElem,whereClause,mgens){if(!typePassesFilter(queryElem.typeFilter,fnType.ty)){return false}if(fnType.id<0&&queryElem.id<0){if(mgens.has(fnType.id)&&mgens.get(fnType.id)!==queryElem.id){return false}for(const[fid,qid]of mgens.entries()){if(fnType.id!==fid&&queryElem.id===qid){return false}if(fnType.id===fid&&queryElem.id!==qid){return false}}}else if(fnType.id!==null){if(queryElem.id===typeNameIdOfArrayOrSlice&&(fnType.id===typeNameIdOfSlice||fnType.id===typeNameIdOfArray)){}else if(fnType.id!==queryElem.id){return false}if(fnType.generics.length===0&&queryElem.generics.length!==0){return false}const queryElemPathLength=queryElem.pathWithoutLast.length;if(queryElemPathLength>0){const fnTypePath=fnType.path!==undefined&&fnType.path!==null?fnType.path.split("::"):[];if(queryElemPathLength>fnTypePath.length){return false}let i=0;for(const path of fnTypePath){if(path===queryElem.pathWithoutLast[i]){i+=1;if(i>=queryElemPathLength){break}}}if(i=0){if(!whereClause){return false}if(mgens.has(fnType.id)&&mgens.get(fnType.id)!==0){return false}return checkIfInList(whereClause[(-fnType.id)-1],queryElem,whereClause)}else if(fnType.generics&&fnType.generics.length>0){return checkIfInList(fnType.generics,queryElem,whereClause)}return false}function checkIfInList(list,elem,whereClause){for(const entry of list){if(checkType(entry,elem,whereClause)){return true}}return false}function checkType(row,elem,whereClause){if(row.id===null){return row.generics.length>0?checkIfInList(row.generics,elem,whereClause):false}if(row.id<0&&elem.id>=0){const gid=(-row.id)-1;return checkIfInList(whereClause[gid],elem,whereClause)}if(row.id<0&&elem.id<0){return true}const matchesExact=row.id===elem.id;const matchesArrayOrSlice=elem.id===typeNameIdOfArrayOrSlice&&(row.id===typeNameIdOfSlice||row.id===typeNameIdOfArray);if((matchesExact||matchesArrayOrSlice)&&typePassesFilter(elem.typeFilter,row.ty)){if(elem.generics.length>0){return checkGenerics(row,elem,whereClause,new Map())}return true}return checkIfInList(row.generics,elem,whereClause)}function checkPath(contains,ty,maxEditDistance){if(contains.length===0){return 0}let ret_dist=maxEditDistance+1;const path=ty.path.split("::");if(ty.parent&&ty.parent.name){path.push(ty.parent.name.toLowerCase())}const length=path.length;const clength=contains.length;if(clength>length){return maxEditDistance+1}for(let i=0;ilength){break}let dist_total=0;let aborted=false;for(let x=0;xmaxEditDistance){aborted=true;break}dist_total+=dist}if(!aborted){ret_dist=Math.min(ret_dist,Math.round(dist_total/clength))}}return ret_dist}function typePassesFilter(filter,type){if(filter<=NO_TYPE_FILTER||filter===type)return true;const name=itemTypes[type];switch(itemTypes[filter]){case"constant":return name==="associatedconstant";case"fn":return name==="method"||name==="tymethod";case"type":return name==="primitive"||name==="associatedtype";case"trait":return name==="traitalias"}return false}function createAliasFromItem(item){return{crate:item.crate,name:item.name,path:item.path,desc:item.desc,ty:item.ty,parent:item.parent,type:item.type,is_alias:true,deprecated:item.deprecated,}}function handleAliases(ret,query,filterCrates,currentCrate){const lowerQuery=query.toLowerCase();const aliases=[];const crateAliases=[];if(filterCrates!==null){if(ALIASES.has(filterCrates)&&ALIASES.get(filterCrates).has(lowerQuery)){const query_aliases=ALIASES.get(filterCrates).get(lowerQuery);for(const alias of query_aliases){aliases.push(createAliasFromItem(searchIndex[alias]))}}}else{for(const[crate,crateAliasesIndex]of ALIASES){if(crateAliasesIndex.has(lowerQuery)){const pushTo=crate===currentCrate?crateAliases:aliases;const query_aliases=crateAliasesIndex.get(lowerQuery);for(const alias of query_aliases){pushTo.push(createAliasFromItem(searchIndex[alias]))}}}}const sortFunc=(aaa,bbb)=>{if(aaa.path{alias.alias=query;const res=buildHrefAndPath(alias);alias.displayPath=pathSplitter(res[0]);alias.fullPath=alias.displayPath+alias.name;alias.href=res[1];ret.others.unshift(alias);if(ret.others.length>MAX_RESULTS){ret.others.pop()}};aliases.forEach(pushFunc);crateAliases.forEach(pushFunc)}function addIntoResults(results,fullId,id,index,dist,path_dist,maxEditDistance){const inBounds=dist<=maxEditDistance||index!==-1;if(dist===0||(!parsedQuery.literalSearch&&inBounds)){if(results.has(fullId)){const result=results.get(fullId);if(result.dontValidate||result.dist<=dist){return}}results.set(fullId,{id:id,index:index,dontValidate:parsedQuery.literalSearch,dist:dist,path_dist:path_dist,})}}function handleSingleArg(row,pos,elem,results_others,results_in_args,results_returned,maxEditDistance){if(!row||(filterCrates!==null&&row.crate!==filterCrates)){return}let index=-1,path_dist=0;const fullId=row.id;const searchWord=searchWords[pos];const in_args=row.type&&row.type.inputs&&checkIfInList(row.type.inputs,elem,row.type.where_clause);if(in_args){addIntoResults(results_in_args,fullId,pos,-1,0,0,maxEditDistance)}const returned=row.type&&row.type.output&&checkIfInList(row.type.output,elem,row.type.where_clause);if(returned){addIntoResults(results_returned,fullId,pos,-1,0,0,maxEditDistance)}if(!typePassesFilter(elem.typeFilter,row.ty)){return}const row_index=row.normalizedName.indexOf(elem.pathLast);const word_index=searchWord.indexOf(elem.pathLast);if(row_index===-1){index=word_index}else if(word_index===-1){index=row_index}else if(word_index1){path_dist=checkPath(elem.pathWithoutLast,row,maxEditDistance);if(path_dist>maxEditDistance){return}}if(parsedQuery.literalSearch){if(searchWord===elem.name){addIntoResults(results_others,fullId,pos,index,0,path_dist)}return}const dist=editDistance(searchWord,elem.pathLast,maxEditDistance);if(index===-1&&dist+path_dist>maxEditDistance){return}addIntoResults(results_others,fullId,pos,index,dist,path_dist,maxEditDistance)}function handleArgs(row,pos,results){if(!row||(filterCrates!==null&&row.crate!==filterCrates)||!row.type){return}if(!unifyFunctionTypes(row.type.inputs,parsedQuery.elems,row.type.where_clause,null,mgens=>{return unifyFunctionTypes(row.type.output,parsedQuery.returned,row.type.where_clause,mgens)})){return}addIntoResults(results,row.id,pos,0,0,0,Number.MAX_VALUE)}function innerRunQuery(){let elem,i,nSearchWords,in_returned,row;let queryLen=0;for(const elem of parsedQuery.elems){queryLen+=elem.name.length}for(const elem of parsedQuery.returned){queryLen+=elem.name.length}const maxEditDistance=Math.floor(queryLen/3);const genericSymbols=new Map();function convertNameToId(elem){if(typeNameIdMap.has(elem.pathLast)){elem.id=typeNameIdMap.get(elem.pathLast)}else if(!parsedQuery.literalSearch){let match=null;let matchDist=maxEditDistance+1;let matchName="";for(const[name,id]of typeNameIdMap){const dist=editDistance(name,elem.pathLast,maxEditDistance);if(dist<=matchDist&&dist<=maxEditDistance){if(dist===matchDist&&matchName>name){continue}match=id;matchDist=dist;matchName=name}}if(match!==null){parsedQuery.correction=matchName}elem.id=match}if((elem.id===null&&parsedQuery.totalElems>1&&elem.typeFilter===-1&&elem.generics.length===0)||elem.typeFilter===TY_GENERIC){if(genericSymbols.has(elem.name)){elem.id=genericSymbols.get(elem.name)}else{elem.id=-(genericSymbols.size+1);genericSymbols.set(elem.name,elem.id)}if(elem.typeFilter===-1&&elem.name.length>=3){const maxPartDistance=Math.floor(elem.name.length/3);let matchDist=maxPartDistance+1;let matchName="";for(const name of typeNameIdMap.keys()){const dist=editDistance(name,elem.name,maxPartDistance);if(dist<=matchDist&&dist<=maxPartDistance){if(dist===matchDist&&matchName>name){continue}matchDist=dist;matchName=name}}if(matchName!==""){parsedQuery.proposeCorrectionFrom=elem.name;parsedQuery.proposeCorrectionTo=matchName}}elem.typeFilter=TY_GENERIC}if(elem.generics.length>0&&elem.typeFilter===TY_GENERIC){parsedQuery.error=["Generic type parameter ",elem.name," does not accept generic parameters",]}for(const elem2 of elem.generics){convertNameToId(elem2)}}for(const elem of parsedQuery.elems){convertNameToId(elem)}for(const elem of parsedQuery.returned){convertNameToId(elem)}if(parsedQuery.foundElems===1){if(parsedQuery.elems.length===1){elem=parsedQuery.elems[0];for(i=0,nSearchWords=searchWords.length;i0){for(i=0,nSearchWords=searchWords.length;i-1||path.indexOf(key)>-1||(parent!==undefined&&parent.name!==undefined&&parent.name.toLowerCase().indexOf(key)>-1)||editDistance(name,key,maxEditDistance)<=maxEditDistance)){return false}}return true}function nextTab(direction){const next=(searchState.currentTab+direction+3)%searchState.focusedByTab.length;searchState.focusedByTab[searchState.currentTab]=document.activeElement;printTab(next);focusSearchResult()}function focusSearchResult(){const target=searchState.focusedByTab[searchState.currentTab]||document.querySelectorAll(".search-results.active a").item(0)||document.querySelectorAll("#search-tabs button").item(searchState.currentTab);searchState.focusedByTab[searchState.currentTab]=null;if(target){target.focus()}}function buildHrefAndPath(item){let displayPath;let href;const type=itemTypes[item.ty];const name=item.name;let path=item.path;if(type==="mod"){displayPath=path+"::";href=ROOT_PATH+path.replace(/::/g,"/")+"/"+name+"/index.html"}else if(type==="import"){displayPath=item.path+"::";href=ROOT_PATH+item.path.replace(/::/g,"/")+"/index.html#reexport."+name}else if(type==="primitive"||type==="keyword"){displayPath="";href=ROOT_PATH+path.replace(/::/g,"/")+"/"+type+"."+name+".html"}else if(type==="externcrate"){displayPath="";href=ROOT_PATH+name+"/index.html"}else if(item.parent!==undefined){const myparent=item.parent;let anchor="#"+type+"."+name;const parentType=itemTypes[myparent.ty];let pageType=parentType;let pageName=myparent.name;if(parentType==="primitive"){displayPath=myparent.name+"::"}else if(type==="structfield"&&parentType==="variant"){const enumNameIdx=item.path.lastIndexOf("::");const enumName=item.path.substr(enumNameIdx+2);path=item.path.substr(0,enumNameIdx);displayPath=path+"::"+enumName+"::"+myparent.name+"::";anchor="#variant."+myparent.name+".field."+name;pageType="enum";pageName=enumName}else{displayPath=path+"::"+myparent.name+"::"}href=ROOT_PATH+path.replace(/::/g,"/")+"/"+pageType+"."+pageName+".html"+anchor}else{displayPath=item.path+"::";href=ROOT_PATH+item.path.replace(/::/g,"/")+"/"+type+"."+name+".html"}return[displayPath,href]}function pathSplitter(path){const tmp=""+path.replace(/::/g,"::");if(tmp.endsWith("")){return tmp.slice(0,tmp.length-6)}return tmp}function addTab(array,query,display){let extraClass="";if(display===true){extraClass=" active"}const output=document.createElement("div");let length=0;if(array.length>0){output.className="search-results "+extraClass;array.forEach(item=>{const name=item.name;const type=itemTypes[item.ty];const longType=longItemTypes[item.ty];const typeName=longType.length!==0?`${longType}`:"?";length+=1;const link=document.createElement("a");link.className="result-"+type;link.href=item.href;const resultName=document.createElement("div");resultName.className="result-name";resultName.insertAdjacentHTML("beforeend",`${typeName}`);link.appendChild(resultName);let alias=" ";if(item.is_alias){alias=`
\ +"use strict";if(!Array.prototype.toSpliced){Array.prototype.toSpliced=function(){const me=this.slice();Array.prototype.splice.apply(me,arguments);return me}}(function(){const itemTypes=["mod","externcrate","import","struct","enum","fn","type","static","trait","impl","tymethod","method","structfield","variant","macro","primitive","associatedtype","constant","associatedconstant","union","foreigntype","keyword","existential","attr","derive","traitalias","generic",];const longItemTypes=["module","extern crate","re-export","struct","enum","function","type alias","static","trait","","trait method","method","struct field","enum variant","macro","primitive type","assoc type","constant","assoc const","union","foreign type","keyword","existential type","attribute macro","derive macro","trait alias",];const TY_PRIMITIVE=itemTypes.indexOf("primitive");const TY_KEYWORD=itemTypes.indexOf("keyword");const TY_GENERIC=itemTypes.indexOf("generic");const ROOT_PATH=typeof window!=="undefined"?window.rootPath:"../";function hasOwnPropertyRustdoc(obj,property){return Object.prototype.hasOwnProperty.call(obj,property)}function printTab(nb){let iter=0;let foundCurrentTab=false;let foundCurrentResultSet=false;onEachLazy(document.getElementById("search-tabs").childNodes,elem=>{if(nb===iter){addClass(elem,"selected");foundCurrentTab=true}else{removeClass(elem,"selected")}iter+=1});const isTypeSearch=(nb>0||iter===1);iter=0;onEachLazy(document.getElementById("results").childNodes,elem=>{if(nb===iter){addClass(elem,"active");foundCurrentResultSet=true}else{removeClass(elem,"active")}iter+=1});if(foundCurrentTab&&foundCurrentResultSet){searchState.currentTab=nb;const correctionsElem=document.getElementsByClassName("search-corrections");if(isTypeSearch){removeClass(correctionsElem[0],"hidden")}else{addClass(correctionsElem[0],"hidden")}}else if(nb!==0){printTab(0)}}const editDistanceState={current:[],prev:[],prevPrev:[],calculate:function calculate(a,b,limit){if(a.lengthlimit){return limit+1}while(b.length>0&&b[0]===a[0]){a=a.substring(1);b=b.substring(1)}while(b.length>0&&b[b.length-1]===a[a.length-1]){a=a.substring(0,a.length-1);b=b.substring(0,b.length-1)}if(b.length===0){return minDist}const aLength=a.length;const bLength=b.length;for(let i=0;i<=bLength;++i){this.current[i]=0;this.prev[i]=i;this.prevPrev[i]=Number.MAX_VALUE}for(let i=1;i<=aLength;++i){this.current[0]=i;const aIdx=i-1;for(let j=1;j<=bLength;++j){const bIdx=j-1;const substitutionCost=a[aIdx]===b[bIdx]?0:1;this.current[j]=Math.min(this.prev[j]+1,this.current[j-1]+1,this.prev[j-1]+substitutionCost);if((i>1)&&(j>1)&&(a[aIdx]===b[bIdx-1])&&(a[aIdx-1]===b[bIdx])){this.current[j]=Math.min(this.current[j],this.prevPrev[j-2]+1)}}const prevPrevTmp=this.prevPrev;this.prevPrev=this.prev;this.prev=this.current;this.current=prevPrevTmp}const distance=this.prev[bLength];return distance<=limit?distance:(limit+1)},};function editDistance(a,b,limit){return editDistanceState.calculate(a,b,limit)}function initSearch(rawSearchIndex){const MAX_RESULTS=200;const NO_TYPE_FILTER=-1;let searchIndex;let currentResults;let typeNameIdMap;const ALIASES=new Map();let typeNameIdOfArray;let typeNameIdOfSlice;let typeNameIdOfArrayOrSlice;function buildTypeMapIndex(name){if(name===""||name===null){return null}if(typeNameIdMap.has(name)){return typeNameIdMap.get(name)}else{const id=typeNameIdMap.size;typeNameIdMap.set(name,id);return id}}function isWhitespace(c){return" \t\n\r".indexOf(c)!==-1}function isSpecialStartCharacter(c){return"<\"".indexOf(c)!==-1}function isEndCharacter(c){return",>-]".indexOf(c)!==-1}function isStopCharacter(c){return isEndCharacter(c)}function isErrorCharacter(c){return"()".indexOf(c)!==-1}function itemTypeFromName(typename){const index=itemTypes.findIndex(i=>i===typename);if(index<0){throw["Unknown type filter ",typename]}return index}function getStringElem(query,parserState,isInGenerics){if(isInGenerics){throw["Unexpected ","\""," in generics"]}else if(query.literalSearch){throw["Cannot have more than one literal search element"]}else if(parserState.totalElems-parserState.genericsElems>0){throw["Cannot use literal search when there is more than one element"]}parserState.pos+=1;const start=parserState.pos;const end=getIdentEndPosition(parserState);if(parserState.pos>=parserState.length){throw["Unclosed ","\""]}else if(parserState.userQuery[end]!=="\""){throw["Unexpected ",parserState.userQuery[end]," in a string element"]}else if(start===end){throw["Cannot have empty string element"]}parserState.pos+=1;query.literalSearch=true}function isPathStart(parserState){return parserState.userQuery.slice(parserState.pos,parserState.pos+2)==="::"}function isReturnArrow(parserState){return parserState.userQuery.slice(parserState.pos,parserState.pos+2)==="->"}function isIdentCharacter(c){return(c==="_"||(c>="0"&&c<="9")||(c>="a"&&c<="z")||(c>="A"&&c<="Z"))}function isSeparatorCharacter(c){return c===","}function isPathSeparator(c){return c===":"||isWhitespace(c)}function prevIs(parserState,lookingFor){let pos=parserState.pos;while(pos>0){const c=parserState.userQuery[pos-1];if(c===lookingFor){return true}else if(!isWhitespace(c)){break}pos-=1}return false}function isLastElemGeneric(elems,parserState){return(elems.length>0&&elems[elems.length-1].generics.length>0)||prevIs(parserState,">")}function skipWhitespace(parserState){while(parserState.pos0){throw["Cannot have more than one element if you use quotes"]}const typeFilter=parserState.typeFilter;parserState.typeFilter=null;if(name==="!"){if(typeFilter!==null&&typeFilter!=="primitive"){throw["Invalid search type: primitive never type ","!"," and ",typeFilter," both specified",]}if(generics.length!==0){throw["Never type ","!"," does not accept generic parameters",]}return{name:"never",id:null,fullPath:["never"],pathWithoutLast:[],pathLast:"never",generics:[],typeFilter:"primitive",}}if(path.startsWith("::")){throw["Paths cannot start with ","::"]}else if(path.endsWith("::")){throw["Paths cannot end with ","::"]}else if(path.includes("::::")){throw["Unexpected ","::::"]}else if(path.includes(" ::")){throw["Unexpected "," ::"]}else if(path.includes(":: ")){throw["Unexpected ",":: "]}const pathSegments=path.split(/::|\s+/);if(pathSegments.length===0||(pathSegments.length===1&&pathSegments[0]==="")){if(generics.length>0||prevIs(parserState,">")){throw["Found generics without a path"]}else{throw["Unexpected ",parserState.userQuery[parserState.pos]]}}for(const[i,pathSegment]of pathSegments.entries()){if(pathSegment==="!"){if(i!==0){throw["Never type ","!"," is not associated item"]}pathSegments[i]="never"}}parserState.totalElems+=1;if(isInGenerics){parserState.genericsElems+=1}return{name:name.trim(),id:null,fullPath:pathSegments,pathWithoutLast:pathSegments.slice(0,pathSegments.length-1),pathLast:pathSegments[pathSegments.length-1],generics:generics,typeFilter,}}function getIdentEndPosition(parserState){const start=parserState.pos;let end=parserState.pos;let foundExclamation=-1;while(parserState.pos=end){throw["Found generics without a path"]}parserState.pos+=1;getItemsBefore(query,parserState,generics,">")}if(isStringElem){skipWhitespace(parserState)}if(start>=end&&generics.length===0){return}elems.push(createQueryElement(query,parserState,parserState.userQuery.slice(start,end),generics,isInGenerics))}}function getItemsBefore(query,parserState,elems,endChar){let foundStopChar=true;let start=parserState.pos;const oldTypeFilter=parserState.typeFilter;parserState.typeFilter=null;let extra="";if(endChar===">"){extra="<"}else if(endChar==="]"){extra="["}else if(endChar===""){extra="->"}else{extra=endChar}while(parserState.pos"]}else if(prevIs(parserState,"\"")){throw["Cannot have more than one element if you use quotes"]}if(endChar!==""){throw["Expected ",","," or ",endChar,...extra,", found ",c,]}throw["Expected ",",",...extra,", found ",c,]}const posBefore=parserState.pos;start=parserState.pos;getNextElem(query,parserState,elems,endChar!=="");if(endChar!==""&&parserState.pos>=parserState.length){throw["Unclosed ",extra]}if(posBefore===parserState.pos){parserState.pos+=1}foundStopChar=false}if(parserState.pos>=parserState.length&&endChar!==""){throw["Unclosed ",extra]}parserState.pos+=1;parserState.typeFilter=oldTypeFilter}function checkExtraTypeFilterCharacters(start,parserState){const query=parserState.userQuery.slice(start,parserState.pos).trim();for(const c in query){if(!isIdentCharacter(query[c])){throw["Unexpected ",query[c]," in type filter (before ",":",")",]}}}function parseInput(query,parserState){let foundStopChar=true;let start=parserState.pos;while(parserState.pos"){if(isReturnArrow(parserState)){break}throw["Unexpected ",c," (did you mean ","->","?)"]}throw["Unexpected ",c]}else if(c===":"&&!isPathStart(parserState)){if(parserState.typeFilter!==null){throw["Unexpected ",":"," (expected path after type filter ",parserState.typeFilter+":",")",]}else if(query.elems.length===0){throw["Expected type filter before ",":"]}else if(query.literalSearch){throw["Cannot use quotes on type filter"]}const typeFilterElem=query.elems.pop();checkExtraTypeFilterCharacters(start,parserState);parserState.typeFilter=typeFilterElem.name;parserState.pos+=1;parserState.totalElems-=1;query.literalSearch=false;foundStopChar=true;continue}else if(isWhitespace(c)){skipWhitespace(parserState);continue}if(!foundStopChar){let extra="";if(isLastElemGeneric(query.elems,parserState)){extra=[" after ",">"]}else if(prevIs(parserState,"\"")){throw["Cannot have more than one element if you use quotes"]}if(parserState.typeFilter!==null){throw["Expected ",","," or ","->",...extra,", found ",c,]}throw["Expected ",",",", ",":"," or ","->",...extra,", found ",c,]}const before=query.elems.length;start=parserState.pos;getNextElem(query,parserState,query.elems,false);if(query.elems.length===before){parserState.pos+=1}foundStopChar=false}if(parserState.typeFilter!==null){throw["Unexpected ",":"," (expected path after type filter ",parserState.typeFilter+":",")",]}while(parserState.pos"]}break}else{parserState.pos+=1}}}function newParsedQuery(userQuery){return{original:userQuery,userQuery:userQuery.toLowerCase(),elems:[],returned:[],foundElems:0,totalElems:0,literalSearch:false,error:null,correction:null,proposeCorrectionFrom:null,proposeCorrectionTo:null,}}function buildUrl(search,filterCrates){let extra="?search="+encodeURIComponent(search);if(filterCrates!==null){extra+="&filter-crate="+encodeURIComponent(filterCrates)}return getNakedUrl()+extra+window.location.hash}function getFilterCrates(){const elem=document.getElementById("crate-search");if(elem&&elem.value!=="all crates"&&hasOwnPropertyRustdoc(rawSearchIndex,elem.value)){return elem.value}return null}function parseQuery(userQuery){function convertTypeFilterOnElem(elem){if(elem.typeFilter!==null){let typeFilter=elem.typeFilter;if(typeFilter==="const"){typeFilter="constant"}elem.typeFilter=itemTypeFromName(typeFilter)}else{elem.typeFilter=NO_TYPE_FILTER}for(const elem2 of elem.generics){convertTypeFilterOnElem(elem2)}}userQuery=userQuery.trim();const parserState={length:userQuery.length,pos:0,totalElems:0,genericsElems:0,typeFilter:null,userQuery:userQuery.toLowerCase(),};let query=newParsedQuery(userQuery);try{parseInput(query,parserState);for(const elem of query.elems){convertTypeFilterOnElem(elem)}for(const elem of query.returned){convertTypeFilterOnElem(elem)}}catch(err){query=newParsedQuery(userQuery);query.error=err;return query}if(!query.literalSearch){query.literalSearch=parserState.totalElems>1}query.foundElems=query.elems.length+query.returned.length;query.totalElems=parserState.totalElems;return query}function createQueryResults(results_in_args,results_returned,results_others,parsedQuery){return{"in_args":results_in_args,"returned":results_returned,"others":results_others,"query":parsedQuery,}}function execQuery(parsedQuery,searchWords,filterCrates,currentCrate){const results_others=new Map(),results_in_args=new Map(),results_returned=new Map();function transformResults(results){const duplicates=new Set();const out=[];for(const result of results){if(result.id!==-1){const obj=searchIndex[result.id];obj.dist=result.dist;const res=buildHrefAndPath(obj);obj.displayPath=pathSplitter(res[0]);obj.fullPath=obj.displayPath+obj.name;obj.fullPath+="|"+obj.ty;if(duplicates.has(obj.fullPath)){continue}duplicates.add(obj.fullPath);obj.href=res[1];out.push(obj);if(out.length>=MAX_RESULTS){break}}}return out}function sortResults(results,isType,preferredCrate){if(results.size===0){return[]}const userQuery=parsedQuery.userQuery;const result_list=[];for(const result of results.values()){result.word=searchWords[result.id];result.item=searchIndex[result.id]||{};result_list.push(result)}result_list.sort((aaa,bbb)=>{let a,b;a=(aaa.word!==userQuery);b=(bbb.word!==userQuery);if(a!==b){return a-b}a=(aaa.index<0);b=(bbb.index<0);if(a!==b){return a-b}a=aaa.path_dist;b=bbb.path_dist;if(a!==b){return a-b}a=aaa.index;b=bbb.index;if(a!==b){return a-b}a=(aaa.dist);b=(bbb.dist);if(a!==b){return a-b}a=aaa.item.deprecated;b=bbb.item.deprecated;if(a!==b){return a-b}a=(aaa.item.crate!==preferredCrate);b=(bbb.item.crate!==preferredCrate);if(a!==b){return a-b}a=aaa.word.length;b=bbb.word.length;if(a!==b){return a-b}a=aaa.word;b=bbb.word;if(a!==b){return(a>b?+1:-1)}if((aaa.item.ty===TY_PRIMITIVE&&bbb.item.ty!==TY_KEYWORD)||(aaa.item.ty===TY_KEYWORD&&bbb.item.ty!==TY_PRIMITIVE)){return-1}if((bbb.item.ty===TY_PRIMITIVE&&aaa.item.ty!==TY_PRIMITIVE)||(bbb.item.ty===TY_KEYWORD&&aaa.item.ty!==TY_KEYWORD)){return 1}a=(aaa.item.desc==="");b=(bbb.item.desc==="");if(a!==b){return a-b}a=aaa.item.ty;b=bbb.item.ty;if(a!==b){return a-b}a=aaa.item.path;b=bbb.item.path;if(a!==b){return(a>b?+1:-1)}return 0});let nameSplit=null;if(parsedQuery.elems.length===1){const hasPath=typeof parsedQuery.elems[0].path==="undefined";nameSplit=hasPath?null:parsedQuery.elems[0].path}for(const result of result_list){if(result.dontValidate){continue}const name=result.item.name.toLowerCase(),path=result.item.path.toLowerCase(),parent=result.item.parent;if(!isType&&!validateResult(name,path,nameSplit,parent)){result.id=-1}}return transformResults(result_list)}function checkGenerics(fnType,queryElem,whereClause,mgensInout){return unifyFunctionTypes(fnType.generics,queryElem.generics,whereClause,mgensInout,mgens=>{if(mgensInout){for(const[fid,qid]of mgens.entries()){mgensInout.set(fid,qid)}}return true})}function unifyFunctionTypes(fnTypesIn,queryElems,whereClause,mgensIn,solutionCb){let mgens=new Map(mgensIn);if(queryElems.length===0){return!solutionCb||solutionCb(mgens)}if(!fnTypesIn||fnTypesIn.length===0){return false}const ql=queryElems.length;let fl=fnTypesIn.length;let fnTypes=fnTypesIn.slice();const backtracking=[];let i=0;let j=0;const backtrack=()=>{while(backtracking.length!==0){const{fnTypesScratch,mgensScratch,queryElemsOffset,fnTypesOffset,unbox,}=backtracking.pop();mgens=new Map(mgensScratch);const fnType=fnTypesScratch[fnTypesOffset];const queryElem=queryElems[queryElemsOffset];if(unbox){if(fnType.id<0){if(mgens.has(fnType.id)&&mgens.get(fnType.id)!==0){continue}mgens.set(fnType.id,0)}const generics=fnType.id<0?whereClause[(-fnType.id)-1]:fnType.generics;fnTypes=fnTypesScratch.toSpliced(fnTypesOffset,1,...generics);fl=fnTypes.length;i=queryElemsOffset-1}else{if(fnType.id<0){if(mgens.has(fnType.id)&&mgens.get(fnType.id)!==queryElem.id){continue}mgens.set(fnType.id,queryElem.id)}fnTypes=fnTypesScratch.slice();fl=fnTypes.length;const tmp=fnTypes[queryElemsOffset];fnTypes[queryElemsOffset]=fnTypes[fnTypesOffset];fnTypes[fnTypesOffset]=tmp;i=queryElemsOffset}return true}return false};for(i=0;i!==ql;++i){const queryElem=queryElems[i];const matchCandidates=[];let fnTypesScratch=null;let mgensScratch=null;for(j=i;j!==fl;++j){const fnType=fnTypes[j];if(unifyFunctionTypeIsMatchCandidate(fnType,queryElem,whereClause,mgens)){if(!fnTypesScratch){fnTypesScratch=fnTypes.slice()}unifyFunctionTypes(fnType.generics,queryElem.generics,whereClause,mgens,mgensScratch=>{matchCandidates.push({fnTypesScratch,mgensScratch,queryElemsOffset:i,fnTypesOffset:j,unbox:false,});return false})}if(unifyFunctionTypeIsUnboxCandidate(fnType,queryElem,whereClause,mgens)){if(!fnTypesScratch){fnTypesScratch=fnTypes.slice()}if(!mgensScratch){mgensScratch=new Map(mgens)}backtracking.push({fnTypesScratch,mgensScratch,queryElemsOffset:i,fnTypesOffset:j,unbox:true,})}}if(matchCandidates.length===0){if(backtrack()){continue}else{return false}}const{fnTypesOffset:candidate,mgensScratch:mgensNew}=matchCandidates.pop();if(fnTypes[candidate].id<0&&queryElems[i].id<0){mgens.set(fnTypes[candidate].id,queryElems[i].id)}for(const[fid,qid]of mgensNew){mgens.set(fid,qid)}const tmp=fnTypes[candidate];fnTypes[candidate]=fnTypes[i];fnTypes[i]=tmp;for(const otherCandidate of matchCandidates){backtracking.push(otherCandidate)}while(i===(ql-1)&&solutionCb&&!solutionCb(mgens)){if(!backtrack()){return false}}}return true}function unifyFunctionTypeIsMatchCandidate(fnType,queryElem,whereClause,mgens){if(!typePassesFilter(queryElem.typeFilter,fnType.ty)){return false}if(fnType.id<0&&queryElem.id<0){if(mgens.has(fnType.id)&&mgens.get(fnType.id)!==queryElem.id){return false}for(const[fid,qid]of mgens.entries()){if(fnType.id!==fid&&queryElem.id===qid){return false}if(fnType.id===fid&&queryElem.id!==qid){return false}}}else{if(queryElem.id===typeNameIdOfArrayOrSlice&&(fnType.id===typeNameIdOfSlice||fnType.id===typeNameIdOfArray)){}else if(fnType.id!==queryElem.id){return false}if(fnType.generics.length===0&&queryElem.generics.length!==0){return false}const queryElemPathLength=queryElem.pathWithoutLast.length;if(queryElemPathLength>0){const fnTypePath=fnType.path!==undefined&&fnType.path!==null?fnType.path.split("::"):[];if(queryElemPathLength>fnTypePath.length){return false}let i=0;for(const path of fnTypePath){if(path===queryElem.pathWithoutLast[i]){i+=1;if(i>=queryElemPathLength){break}}}if(i=0){if(!whereClause){return false}if(mgens.has(fnType.id)&&mgens.get(fnType.id)!==0){return false}return checkIfInList(whereClause[(-fnType.id)-1],queryElem,whereClause)}else if(fnType.generics&&fnType.generics.length>0){return checkIfInList(fnType.generics,queryElem,whereClause)}return false}function checkIfInList(list,elem,whereClause){for(const entry of list){if(checkType(entry,elem,whereClause)){return true}}return false}function checkType(row,elem,whereClause){if(row.id===null){return row.generics.length>0?checkIfInList(row.generics,elem,whereClause):false}if(row.id<0&&elem.id>=0){const gid=(-row.id)-1;return checkIfInList(whereClause[gid],elem,whereClause)}if(row.id<0&&elem.id<0){return true}const matchesExact=row.id===elem.id;const matchesArrayOrSlice=elem.id===typeNameIdOfArrayOrSlice&&(row.id===typeNameIdOfSlice||row.id===typeNameIdOfArray);if((matchesExact||matchesArrayOrSlice)&&typePassesFilter(elem.typeFilter,row.ty)){if(elem.generics.length>0){return checkGenerics(row,elem,whereClause,new Map())}return true}return checkIfInList(row.generics,elem,whereClause)}function checkPath(contains,ty,maxEditDistance){if(contains.length===0){return 0}let ret_dist=maxEditDistance+1;const path=ty.path.split("::");if(ty.parent&&ty.parent.name){path.push(ty.parent.name.toLowerCase())}const length=path.length;const clength=contains.length;if(clength>length){return maxEditDistance+1}for(let i=0;ilength){break}let dist_total=0;let aborted=false;for(let x=0;xmaxEditDistance){aborted=true;break}dist_total+=dist}if(!aborted){ret_dist=Math.min(ret_dist,Math.round(dist_total/clength))}}return ret_dist}function typePassesFilter(filter,type){if(filter<=NO_TYPE_FILTER||filter===type)return true;const name=itemTypes[type];switch(itemTypes[filter]){case"constant":return name==="associatedconstant";case"fn":return name==="method"||name==="tymethod";case"type":return name==="primitive"||name==="associatedtype";case"trait":return name==="traitalias"}return false}function createAliasFromItem(item){return{crate:item.crate,name:item.name,path:item.path,desc:item.desc,ty:item.ty,parent:item.parent,type:item.type,is_alias:true,deprecated:item.deprecated,implDisambiguator:item.implDisambiguator,}}function handleAliases(ret,query,filterCrates,currentCrate){const lowerQuery=query.toLowerCase();const aliases=[];const crateAliases=[];if(filterCrates!==null){if(ALIASES.has(filterCrates)&&ALIASES.get(filterCrates).has(lowerQuery)){const query_aliases=ALIASES.get(filterCrates).get(lowerQuery);for(const alias of query_aliases){aliases.push(createAliasFromItem(searchIndex[alias]))}}}else{for(const[crate,crateAliasesIndex]of ALIASES){if(crateAliasesIndex.has(lowerQuery)){const pushTo=crate===currentCrate?crateAliases:aliases;const query_aliases=crateAliasesIndex.get(lowerQuery);for(const alias of query_aliases){pushTo.push(createAliasFromItem(searchIndex[alias]))}}}}const sortFunc=(aaa,bbb)=>{if(aaa.path{alias.alias=query;const res=buildHrefAndPath(alias);alias.displayPath=pathSplitter(res[0]);alias.fullPath=alias.displayPath+alias.name;alias.href=res[1];ret.others.unshift(alias);if(ret.others.length>MAX_RESULTS){ret.others.pop()}};aliases.forEach(pushFunc);crateAliases.forEach(pushFunc)}function addIntoResults(results,fullId,id,index,dist,path_dist,maxEditDistance){const inBounds=dist<=maxEditDistance||index!==-1;if(dist===0||(!parsedQuery.literalSearch&&inBounds)){if(results.has(fullId)){const result=results.get(fullId);if(result.dontValidate||result.dist<=dist){return}}results.set(fullId,{id:id,index:index,dontValidate:parsedQuery.literalSearch,dist:dist,path_dist:path_dist,})}}function handleSingleArg(row,pos,elem,results_others,results_in_args,results_returned,maxEditDistance){if(!row||(filterCrates!==null&&row.crate!==filterCrates)){return}let index=-1,path_dist=0;const fullId=row.id;const searchWord=searchWords[pos];const in_args=row.type&&row.type.inputs&&checkIfInList(row.type.inputs,elem,row.type.where_clause);if(in_args){addIntoResults(results_in_args,fullId,pos,-1,0,0,maxEditDistance)}const returned=row.type&&row.type.output&&checkIfInList(row.type.output,elem,row.type.where_clause);if(returned){addIntoResults(results_returned,fullId,pos,-1,0,0,maxEditDistance)}if(!typePassesFilter(elem.typeFilter,row.ty)){return}const row_index=row.normalizedName.indexOf(elem.pathLast);const word_index=searchWord.indexOf(elem.pathLast);if(row_index===-1){index=word_index}else if(word_index===-1){index=row_index}else if(word_index1){path_dist=checkPath(elem.pathWithoutLast,row,maxEditDistance);if(path_dist>maxEditDistance){return}}if(parsedQuery.literalSearch){if(searchWord===elem.name){addIntoResults(results_others,fullId,pos,index,0,path_dist)}return}const dist=editDistance(searchWord,elem.pathLast,maxEditDistance);if(index===-1&&dist+path_dist>maxEditDistance){return}addIntoResults(results_others,fullId,pos,index,dist,path_dist,maxEditDistance)}function handleArgs(row,pos,results){if(!row||(filterCrates!==null&&row.crate!==filterCrates)||!row.type){return}if(!unifyFunctionTypes(row.type.inputs,parsedQuery.elems,row.type.where_clause,null,mgens=>{return unifyFunctionTypes(row.type.output,parsedQuery.returned,row.type.where_clause,mgens)})){return}addIntoResults(results,row.id,pos,0,0,0,Number.MAX_VALUE)}function innerRunQuery(){let elem,i,nSearchWords,in_returned,row;let queryLen=0;for(const elem of parsedQuery.elems){queryLen+=elem.name.length}for(const elem of parsedQuery.returned){queryLen+=elem.name.length}const maxEditDistance=Math.floor(queryLen/3);const genericSymbols=new Map();function convertNameToId(elem){if(typeNameIdMap.has(elem.pathLast)){elem.id=typeNameIdMap.get(elem.pathLast)}else if(!parsedQuery.literalSearch){let match=null;let matchDist=maxEditDistance+1;let matchName="";for(const[name,id]of typeNameIdMap){const dist=editDistance(name,elem.pathLast,maxEditDistance);if(dist<=matchDist&&dist<=maxEditDistance){if(dist===matchDist&&matchName>name){continue}match=id;matchDist=dist;matchName=name}}if(match!==null){parsedQuery.correction=matchName}elem.id=match}if((elem.id===null&&parsedQuery.totalElems>1&&elem.typeFilter===-1&&elem.generics.length===0)||elem.typeFilter===TY_GENERIC){if(genericSymbols.has(elem.name)){elem.id=genericSymbols.get(elem.name)}else{elem.id=-(genericSymbols.size+1);genericSymbols.set(elem.name,elem.id)}if(elem.typeFilter===-1&&elem.name.length>=3){const maxPartDistance=Math.floor(elem.name.length/3);let matchDist=maxPartDistance+1;let matchName="";for(const name of typeNameIdMap.keys()){const dist=editDistance(name,elem.name,maxPartDistance);if(dist<=matchDist&&dist<=maxPartDistance){if(dist===matchDist&&matchName>name){continue}matchDist=dist;matchName=name}}if(matchName!==""){parsedQuery.proposeCorrectionFrom=elem.name;parsedQuery.proposeCorrectionTo=matchName}}elem.typeFilter=TY_GENERIC}if(elem.generics.length>0&&elem.typeFilter===TY_GENERIC){parsedQuery.error=["Generic type parameter ",elem.name," does not accept generic parameters",]}for(const elem2 of elem.generics){convertNameToId(elem2)}}for(const elem of parsedQuery.elems){convertNameToId(elem)}for(const elem of parsedQuery.returned){convertNameToId(elem)}if(parsedQuery.foundElems===1){if(parsedQuery.elems.length===1){elem=parsedQuery.elems[0];for(i=0,nSearchWords=searchWords.length;i0){for(i=0,nSearchWords=searchWords.length;i-1||path.indexOf(key)>-1||(parent!==undefined&&parent.name!==undefined&&parent.name.toLowerCase().indexOf(key)>-1)||editDistance(name,key,maxEditDistance)<=maxEditDistance)){return false}}return true}function nextTab(direction){const next=(searchState.currentTab+direction+3)%searchState.focusedByTab.length;searchState.focusedByTab[searchState.currentTab]=document.activeElement;printTab(next);focusSearchResult()}function focusSearchResult(){const target=searchState.focusedByTab[searchState.currentTab]||document.querySelectorAll(".search-results.active a").item(0)||document.querySelectorAll("#search-tabs button").item(searchState.currentTab);searchState.focusedByTab[searchState.currentTab]=null;if(target){target.focus()}}function buildHrefAndPath(item){let displayPath;let href;const type=itemTypes[item.ty];const name=item.name;let path=item.path;if(type==="mod"){displayPath=path+"::";href=ROOT_PATH+path.replace(/::/g,"/")+"/"+name+"/index.html"}else if(type==="import"){displayPath=item.path+"::";href=ROOT_PATH+item.path.replace(/::/g,"/")+"/index.html#reexport."+name}else if(type==="primitive"||type==="keyword"){displayPath="";href=ROOT_PATH+path.replace(/::/g,"/")+"/"+type+"."+name+".html"}else if(type==="externcrate"){displayPath="";href=ROOT_PATH+name+"/index.html"}else if(item.parent!==undefined){const myparent=item.parent;let anchor=type+"."+name;const parentType=itemTypes[myparent.ty];let pageType=parentType;let pageName=myparent.name;if(parentType==="primitive"){displayPath=myparent.name+"::"}else if(type==="structfield"&&parentType==="variant"){const enumNameIdx=item.path.lastIndexOf("::");const enumName=item.path.substr(enumNameIdx+2);path=item.path.substr(0,enumNameIdx);displayPath=path+"::"+enumName+"::"+myparent.name+"::";anchor="variant."+myparent.name+".field."+name;pageType="enum";pageName=enumName}else{displayPath=path+"::"+myparent.name+"::"}if(item.implDisambiguator!==null){anchor=item.implDisambiguator+"/"+anchor}href=ROOT_PATH+path.replace(/::/g,"/")+"/"+pageType+"."+pageName+".html#"+anchor}else{displayPath=item.path+"::";href=ROOT_PATH+item.path.replace(/::/g,"/")+"/"+type+"."+name+".html"}return[displayPath,href]}function pathSplitter(path){const tmp=""+path.replace(/::/g,"::");if(tmp.endsWith("")){return tmp.slice(0,tmp.length-6)}return tmp}function addTab(array,query,display){let extraClass="";if(display===true){extraClass=" active"}const output=document.createElement("div");let length=0;if(array.length>0){output.className="search-results "+extraClass;array.forEach(item=>{const name=item.name;const type=itemTypes[item.ty];const longType=longItemTypes[item.ty];const typeName=longType.length!==0?`${longType}`:"?";length+=1;const link=document.createElement("a");link.className="result-"+type;link.href=item.href;const resultName=document.createElement("div");resultName.className="result-name";resultName.insertAdjacentHTML("beforeend",`${typeName}`);link.appendChild(resultName);let alias=" ";if(item.is_alias){alias=`
\ ${item.alias} - see \
`}resultName.insertAdjacentHTML("beforeend",`
${alias}\ ${item.displayPath}${name}\ -
`);const description=document.createElement("div");description.className="desc";description.insertAdjacentHTML("beforeend",item.desc);link.appendChild(description);output.appendChild(link)})}else if(query.error===null){output.className="search-failed"+extraClass;output.innerHTML="No results :(
"+"Try on DuckDuckGo?

"+"Or try looking in one of these:"}return[output,length]}function makeTabHeader(tabNb,text,nbElems){const fmtNbElems=nbElems<10?`\u{2007}(${nbElems})\u{2007}\u{2007}`:nbElems<100?`\u{2007}(${nbElems})\u{2007}`:`\u{2007}(${nbElems})`;if(searchState.currentTab===tabNb){return""}return""}function showResults(results,go_to_first,filterCrates){const search=searchState.outputElement();if(go_to_first||(results.others.length===1&&getSettingValue("go-to-only-result")==="true")){window.onunload=()=>{};searchState.removeQueryParameters();const elem=document.createElement("a");elem.href=results.others[0].href;removeClass(elem,"active");document.body.appendChild(elem);elem.click();return}if(results.query===undefined){results.query=parseQuery(searchState.input.value)}currentResults=results.query.userQuery;const ret_others=addTab(results.others,results.query,true);const ret_in_args=addTab(results.in_args,results.query,false);const ret_returned=addTab(results.returned,results.query,false);let currentTab=searchState.currentTab;if((currentTab===0&&ret_others[1]===0)||(currentTab===1&&ret_in_args[1]===0)||(currentTab===2&&ret_returned[1]===0)){if(ret_others[1]!==0){currentTab=0}else if(ret_in_args[1]!==0){currentTab=1}else if(ret_returned[1]!==0){currentTab=2}}let crates="";const crates_list=Object.keys(rawSearchIndex);if(crates_list.length>1){crates=" in 
"}let output=`

Results${crates}

`;if(results.query.error!==null){const error=results.query.error;error.forEach((value,index)=>{value=value.split("<").join("<").split(">").join(">");if(index%2!==0){error[index]=`${value.replaceAll(" ", " ")}`}else{error[index]=value}});output+=`

Query parser error: "${error.join("")}".

`;output+="
"+makeTabHeader(0,"In Names",ret_others[1])+"
";currentTab=0}else if(results.query.foundElems<=1&&results.query.returned.length===0){output+="
"+makeTabHeader(0,"In Names",ret_others[1])+makeTabHeader(1,"In Parameters",ret_in_args[1])+makeTabHeader(2,"In Return Types",ret_returned[1])+"
"}else{const signatureTabTitle=results.query.elems.length===0?"In Function Return Types":results.query.returned.length===0?"In Function Parameters":"In Function Signatures";output+="
"+makeTabHeader(0,signatureTabTitle,ret_others[1])+"
";currentTab=0}if(results.query.correction!==null){const orig=results.query.returned.length>0?results.query.returned[0].name:results.query.elems[0].name;output+="

"+`Type "${orig}" not found. `+"Showing results for closest type name "+`"${results.query.correction}" instead.

`}if(results.query.proposeCorrectionFrom!==null){const orig=results.query.proposeCorrectionFrom;const targ=results.query.proposeCorrectionTo;output+="

"+`Type "${orig}" not found and used as generic parameter. `+`Consider searching for "${targ}" instead.

`}const resultsElem=document.createElement("div");resultsElem.id="results";resultsElem.appendChild(ret_others[0]);resultsElem.appendChild(ret_in_args[0]);resultsElem.appendChild(ret_returned[0]);search.innerHTML=output;const crateSearch=document.getElementById("crate-search");if(crateSearch){crateSearch.addEventListener("input",updateCrate)}search.appendChild(resultsElem);searchState.showResults(search);const elems=document.getElementById("search-tabs").childNodes;searchState.focusedByTab=[];let i=0;for(const elem of elems){const j=i;elem.onclick=()=>printTab(j);searchState.focusedByTab.push(null);i+=1}printTab(currentTab)}function updateSearchHistory(url){if(!browserSupportsHistoryApi()){return}const params=searchState.getQueryStringParams();if(!history.state&&!params.search){history.pushState(null,"",url)}else{history.replaceState(null,"",url)}}function search(e,forced){if(e){e.preventDefault()}const query=parseQuery(searchState.input.value.trim());let filterCrates=getFilterCrates();if(!forced&&query.userQuery===currentResults){if(query.userQuery.length>0){putBackSearch()}return}searchState.setLoadingSearch();const params=searchState.getQueryStringParams();if(filterCrates===null&¶ms["filter-crate"]!==undefined){filterCrates=params["filter-crate"]}searchState.title="Results for "+query.original+" - Rust";updateSearchHistory(buildUrl(query.original,filterCrates));showResults(execQuery(query,searchWords,filterCrates,window.currentCrate),params.go_to_first,filterCrates)}function buildItemSearchTypeAll(types,lowercasePaths){return types.map(type=>buildItemSearchType(type,lowercasePaths))}function buildItemSearchType(type,lowercasePaths){const PATH_INDEX_DATA=0;const GENERICS_DATA=1;let pathIndex,generics;if(typeof type==="number"){pathIndex=type;generics=[]}else{pathIndex=type[PATH_INDEX_DATA];generics=buildItemSearchTypeAll(type[GENERICS_DATA],lowercasePaths)}if(pathIndex<0){return{id:pathIndex,ty:TY_GENERIC,path:null,generics,}}if(pathIndex===0){return{id:null,ty:null,path:null,generics,}}const item=lowercasePaths[pathIndex-1];return{id:buildTypeMapIndex(item.name),ty:item.ty,path:item.path,generics,}}function buildFunctionSearchType(functionSearchType,lowercasePaths){const INPUTS_DATA=0;const OUTPUT_DATA=1;if(functionSearchType===0){return null}let inputs,output;if(typeof functionSearchType[INPUTS_DATA]==="number"){inputs=[buildItemSearchType(functionSearchType[INPUTS_DATA],lowercasePaths)]}else{inputs=buildItemSearchTypeAll(functionSearchType[INPUTS_DATA],lowercasePaths)}if(functionSearchType.length>1){if(typeof functionSearchType[OUTPUT_DATA]==="number"){output=[buildItemSearchType(functionSearchType[OUTPUT_DATA],lowercasePaths)]}else{output=buildItemSearchTypeAll(functionSearchType[OUTPUT_DATA],lowercasePaths)}}else{output=[]}const where_clause=[];const l=functionSearchType.length;for(let i=2;i2){path=itemPaths.has(elem[2])?itemPaths.get(elem[2]):lastPath;lastPath=path}lowercasePaths.push({ty:ty,name:name.toLowerCase(),path:path});paths[i]={ty:ty,name:name,path:path}}lastPath="";len=itemTypes.length;for(let i=0;i0?paths[itemParentIdxs[i]-1]:undefined,type:buildFunctionSearchType(itemFunctionSearchTypes[i],lowercasePaths),id:id,normalizedName:word.indexOf("_")===-1?word:word.replace(/_/g,""),deprecated:deprecatedItems.has(i),};id+=1;searchIndex.push(row);lastPath=row.path;crateSize+=1}if(aliases){const currentCrateAliases=new Map();ALIASES.set(crate,currentCrateAliases);for(const alias_name in aliases){if(!hasOwnPropertyRustdoc(aliases,alias_name)){continue}let currentNameAliases;if(currentCrateAliases.has(alias_name)){currentNameAliases=currentCrateAliases.get(alias_name)}else{currentNameAliases=[];currentCrateAliases.set(alias_name,currentNameAliases)}for(const local_alias of aliases[alias_name]){currentNameAliases.push(local_alias+currentIndex)}}}currentIndex+=crateSize}return searchWords}function onSearchSubmit(e){e.preventDefault();searchState.clearInputTimeout();search()}function putBackSearch(){const search_input=searchState.input;if(!searchState.input){return}if(search_input.value!==""&&!searchState.isDisplayed()){searchState.showResults();if(browserSupportsHistoryApi()){history.replaceState(null,"",buildUrl(search_input.value,getFilterCrates()))}document.title=searchState.title}}function registerSearchEvents(){const params=searchState.getQueryStringParams();if(searchState.input.value===""){searchState.input.value=params.search||""}const searchAfter500ms=()=>{searchState.clearInputTimeout();if(searchState.input.value.length===0){searchState.hideResults()}else{searchState.timeout=setTimeout(search,500)}};searchState.input.onkeyup=searchAfter500ms;searchState.input.oninput=searchAfter500ms;document.getElementsByClassName("search-form")[0].onsubmit=onSearchSubmit;searchState.input.onchange=e=>{if(e.target!==document.activeElement){return}searchState.clearInputTimeout();setTimeout(search,0)};searchState.input.onpaste=searchState.input.onchange;searchState.outputElement().addEventListener("keydown",e=>{if(e.altKey||e.ctrlKey||e.shiftKey||e.metaKey){return}if(e.which===38){const previous=document.activeElement.previousElementSibling;if(previous){previous.focus()}else{searchState.focus()}e.preventDefault()}else if(e.which===40){const next=document.activeElement.nextElementSibling;if(next){next.focus()}const rect=document.activeElement.getBoundingClientRect();if(window.innerHeight-rect.bottom{if(e.which===40){focusSearchResult();e.preventDefault()}});searchState.input.addEventListener("focus",()=>{putBackSearch()});searchState.input.addEventListener("blur",()=>{searchState.input.placeholder=searchState.input.origPlaceholder});if(browserSupportsHistoryApi()){const previousTitle=document.title;window.addEventListener("popstate",e=>{const params=searchState.getQueryStringParams();document.title=previousTitle;currentResults=null;if(params.search&¶ms.search.length>0){searchState.input.value=params.search;search(e)}else{searchState.input.value="";searchState.hideResults()}})}window.onpageshow=()=>{const qSearch=searchState.getQueryStringParams().search;if(searchState.input.value===""&&qSearch){searchState.input.value=qSearch}search()}}function updateCrate(ev){if(ev.target.value==="all crates"){const query=searchState.input.value.trim();updateSearchHistory(buildUrl(query,null))}currentResults=null;search(undefined,true)}const searchWords=buildIndex(rawSearchIndex);if(typeof window!=="undefined"){registerSearchEvents();if(window.searchState.getQueryStringParams().search){search()}}if(typeof exports!=="undefined"){exports.initSearch=initSearch;exports.execQuery=execQuery;exports.parseQuery=parseQuery}return searchWords}if(typeof window!=="undefined"){window.initSearch=initSearch;if(window.searchIndex!==undefined){initSearch(window.searchIndex)}}else{initSearch({})}})() \ No newline at end of file +
`);const description=document.createElement("div");description.className="desc";description.insertAdjacentHTML("beforeend",item.desc);link.appendChild(description);output.appendChild(link)})}else if(query.error===null){output.className="search-failed"+extraClass;output.innerHTML="No results :(
"+"Try on DuckDuckGo?

"+"Or try looking in one of these:"}return[output,length]}function makeTabHeader(tabNb,text,nbElems){const fmtNbElems=nbElems<10?`\u{2007}(${nbElems})\u{2007}\u{2007}`:nbElems<100?`\u{2007}(${nbElems})\u{2007}`:`\u{2007}(${nbElems})`;if(searchState.currentTab===tabNb){return""}return""}function showResults(results,go_to_first,filterCrates){const search=searchState.outputElement();if(go_to_first||(results.others.length===1&&getSettingValue("go-to-only-result")==="true")){window.onunload=()=>{};searchState.removeQueryParameters();const elem=document.createElement("a");elem.href=results.others[0].href;removeClass(elem,"active");document.body.appendChild(elem);elem.click();return}if(results.query===undefined){results.query=parseQuery(searchState.input.value)}currentResults=results.query.userQuery;const ret_others=addTab(results.others,results.query,true);const ret_in_args=addTab(results.in_args,results.query,false);const ret_returned=addTab(results.returned,results.query,false);let currentTab=searchState.currentTab;if((currentTab===0&&ret_others[1]===0)||(currentTab===1&&ret_in_args[1]===0)||(currentTab===2&&ret_returned[1]===0)){if(ret_others[1]!==0){currentTab=0}else if(ret_in_args[1]!==0){currentTab=1}else if(ret_returned[1]!==0){currentTab=2}}let crates="";const crates_list=Object.keys(rawSearchIndex);if(crates_list.length>1){crates=" in 
"}let output=`

Results${crates}

`;if(results.query.error!==null){const error=results.query.error;error.forEach((value,index)=>{value=value.split("<").join("<").split(">").join(">");if(index%2!==0){error[index]=`${value.replaceAll(" ", " ")}`}else{error[index]=value}});output+=`

Query parser error: "${error.join("")}".

`;output+="
"+makeTabHeader(0,"In Names",ret_others[1])+"
";currentTab=0}else if(results.query.foundElems<=1&&results.query.returned.length===0){output+="
"+makeTabHeader(0,"In Names",ret_others[1])+makeTabHeader(1,"In Parameters",ret_in_args[1])+makeTabHeader(2,"In Return Types",ret_returned[1])+"
"}else{const signatureTabTitle=results.query.elems.length===0?"In Function Return Types":results.query.returned.length===0?"In Function Parameters":"In Function Signatures";output+="
"+makeTabHeader(0,signatureTabTitle,ret_others[1])+"
";currentTab=0}if(results.query.correction!==null){const orig=results.query.returned.length>0?results.query.returned[0].name:results.query.elems[0].name;output+="

"+`Type "${orig}" not found. `+"Showing results for closest type name "+`"${results.query.correction}" instead.

`}if(results.query.proposeCorrectionFrom!==null){const orig=results.query.proposeCorrectionFrom;const targ=results.query.proposeCorrectionTo;output+="

"+`Type "${orig}" not found and used as generic parameter. `+`Consider searching for "${targ}" instead.

`}const resultsElem=document.createElement("div");resultsElem.id="results";resultsElem.appendChild(ret_others[0]);resultsElem.appendChild(ret_in_args[0]);resultsElem.appendChild(ret_returned[0]);search.innerHTML=output;const crateSearch=document.getElementById("crate-search");if(crateSearch){crateSearch.addEventListener("input",updateCrate)}search.appendChild(resultsElem);searchState.showResults(search);const elems=document.getElementById("search-tabs").childNodes;searchState.focusedByTab=[];let i=0;for(const elem of elems){const j=i;elem.onclick=()=>printTab(j);searchState.focusedByTab.push(null);i+=1}printTab(currentTab)}function updateSearchHistory(url){if(!browserSupportsHistoryApi()){return}const params=searchState.getQueryStringParams();if(!history.state&&!params.search){history.pushState(null,"",url)}else{history.replaceState(null,"",url)}}function search(e,forced){if(e){e.preventDefault()}const query=parseQuery(searchState.input.value.trim());let filterCrates=getFilterCrates();if(!forced&&query.userQuery===currentResults){if(query.userQuery.length>0){putBackSearch()}return}searchState.setLoadingSearch();const params=searchState.getQueryStringParams();if(filterCrates===null&¶ms["filter-crate"]!==undefined){filterCrates=params["filter-crate"]}searchState.title="Results for "+query.original+" - Rust";updateSearchHistory(buildUrl(query.original,filterCrates));showResults(execQuery(query,searchWords,filterCrates,window.currentCrate),params.go_to_first,filterCrates)}function buildItemSearchTypeAll(types,lowercasePaths){return types.map(type=>buildItemSearchType(type,lowercasePaths))}function buildItemSearchType(type,lowercasePaths){const PATH_INDEX_DATA=0;const GENERICS_DATA=1;let pathIndex,generics;if(typeof type==="number"){pathIndex=type;generics=[]}else{pathIndex=type[PATH_INDEX_DATA];generics=buildItemSearchTypeAll(type[GENERICS_DATA],lowercasePaths)}if(pathIndex<0){return{id:pathIndex,ty:TY_GENERIC,path:null,generics,}}if(pathIndex===0){return{id:null,ty:null,path:null,generics,}}const item=lowercasePaths[pathIndex-1];return{id:buildTypeMapIndex(item.name),ty:item.ty,path:item.path,generics,}}function buildFunctionSearchType(functionSearchType,lowercasePaths){const INPUTS_DATA=0;const OUTPUT_DATA=1;if(functionSearchType===0){return null}let inputs,output;if(typeof functionSearchType[INPUTS_DATA]==="number"){inputs=[buildItemSearchType(functionSearchType[INPUTS_DATA],lowercasePaths)]}else{inputs=buildItemSearchTypeAll(functionSearchType[INPUTS_DATA],lowercasePaths)}if(functionSearchType.length>1){if(typeof functionSearchType[OUTPUT_DATA]==="number"){output=[buildItemSearchType(functionSearchType[OUTPUT_DATA],lowercasePaths)]}else{output=buildItemSearchTypeAll(functionSearchType[OUTPUT_DATA],lowercasePaths)}}else{output=[]}const where_clause=[];const l=functionSearchType.length;for(let i=2;i2){path=itemPaths.has(elem[2])?itemPaths.get(elem[2]):lastPath;lastPath=path}lowercasePaths.push({ty:ty,name:name.toLowerCase(),path:path});paths[i]={ty:ty,name:name,path:path}}lastPath="";len=itemTypes.length;for(let i=0;i0?paths[itemParentIdxs[i]-1]:undefined,type:buildFunctionSearchType(itemFunctionSearchTypes[i],lowercasePaths),id:id,normalizedName:word.indexOf("_")===-1?word:word.replace(/_/g,""),deprecated:deprecatedItems.has(i),implDisambiguator:implDisambiguator.has(i)?implDisambiguator.get(i):null,};id+=1;searchIndex.push(row);lastPath=row.path;crateSize+=1}if(aliases){const currentCrateAliases=new Map();ALIASES.set(crate,currentCrateAliases);for(const alias_name in aliases){if(!hasOwnPropertyRustdoc(aliases,alias_name)){continue}let currentNameAliases;if(currentCrateAliases.has(alias_name)){currentNameAliases=currentCrateAliases.get(alias_name)}else{currentNameAliases=[];currentCrateAliases.set(alias_name,currentNameAliases)}for(const local_alias of aliases[alias_name]){currentNameAliases.push(local_alias+currentIndex)}}}currentIndex+=crateSize}return searchWords}function onSearchSubmit(e){e.preventDefault();searchState.clearInputTimeout();search()}function putBackSearch(){const search_input=searchState.input;if(!searchState.input){return}if(search_input.value!==""&&!searchState.isDisplayed()){searchState.showResults();if(browserSupportsHistoryApi()){history.replaceState(null,"",buildUrl(search_input.value,getFilterCrates()))}document.title=searchState.title}}function registerSearchEvents(){const params=searchState.getQueryStringParams();if(searchState.input.value===""){searchState.input.value=params.search||""}const searchAfter500ms=()=>{searchState.clearInputTimeout();if(searchState.input.value.length===0){searchState.hideResults()}else{searchState.timeout=setTimeout(search,500)}};searchState.input.onkeyup=searchAfter500ms;searchState.input.oninput=searchAfter500ms;document.getElementsByClassName("search-form")[0].onsubmit=onSearchSubmit;searchState.input.onchange=e=>{if(e.target!==document.activeElement){return}searchState.clearInputTimeout();setTimeout(search,0)};searchState.input.onpaste=searchState.input.onchange;searchState.outputElement().addEventListener("keydown",e=>{if(e.altKey||e.ctrlKey||e.shiftKey||e.metaKey){return}if(e.which===38){const previous=document.activeElement.previousElementSibling;if(previous){previous.focus()}else{searchState.focus()}e.preventDefault()}else if(e.which===40){const next=document.activeElement.nextElementSibling;if(next){next.focus()}const rect=document.activeElement.getBoundingClientRect();if(window.innerHeight-rect.bottom{if(e.which===40){focusSearchResult();e.preventDefault()}});searchState.input.addEventListener("focus",()=>{putBackSearch()});searchState.input.addEventListener("blur",()=>{searchState.input.placeholder=searchState.input.origPlaceholder});if(browserSupportsHistoryApi()){const previousTitle=document.title;window.addEventListener("popstate",e=>{const params=searchState.getQueryStringParams();document.title=previousTitle;currentResults=null;if(params.search&¶ms.search.length>0){searchState.input.value=params.search;search(e)}else{searchState.input.value="";searchState.hideResults()}})}window.onpageshow=()=>{const qSearch=searchState.getQueryStringParams().search;if(searchState.input.value===""&&qSearch){searchState.input.value=qSearch}search()}}function updateCrate(ev){if(ev.target.value==="all crates"){const query=searchState.input.value.trim();updateSearchHistory(buildUrl(query,null))}currentResults=null;search(undefined,true)}const searchWords=buildIndex(rawSearchIndex);if(typeof window!=="undefined"){registerSearchEvents();if(window.searchState.getQueryStringParams().search){search()}}if(typeof exports!=="undefined"){exports.initSearch=initSearch;exports.execQuery=execQuery;exports.parseQuery=parseQuery}return searchWords}if(typeof window!=="undefined"){window.initSearch=initSearch;if(window.searchIndex!==undefined){initSearch(window.searchIndex)}}else{initSearch({})}})() \ No newline at end of file diff --git a/rust/sudachi/all.html b/rust/sudachi/all.html index 5288b094..d2af7247 100644 --- a/rust/sudachi/all.html +++ b/rust/sudachi/all.html @@ -1 +1 @@ -List of all items in this crate

List of all items

Structs

Enums

Traits

Macros

Functions

Type Aliases

Constants

\ No newline at end of file +List of all items in this crate

List of all items

Structs

Enums

Traits

Macros

Functions

Type Aliases

Constants

\ No newline at end of file diff --git a/rust/sudachi/analysis/created/enum.HasWord.html b/rust/sudachi/analysis/created/enum.HasWord.html index 3b9c99a9..f36523e4 100644 --- a/rust/sudachi/analysis/created/enum.HasWord.html +++ b/rust/sudachi/analysis/created/enum.HasWord.html @@ -1,22 +1,22 @@ -HasWord in sudachi::analysis::created - Rust
pub enum HasWord {
+HasWord in sudachi::analysis::created - Rust
pub enum HasWord {
     Yes,
     No,
     Maybe,
-}

Variants§

§

Yes

§

No

§

Maybe

Trait Implementations§

source§

impl Clone for HasWord

source§

fn clone(&self) -> HasWord

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 HasWord

source§

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

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

impl PartialEq<HasWord> for HasWord

source§

fn eq(&self, other: &HasWord) -> 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 Copy for HasWord

source§

impl Eq for HasWord

source§

impl StructuralEq for HasWord

source§

impl StructuralPartialEq for HasWord

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,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

source§

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

Mutably borrows from an owned value. Read more
§

impl<Q, K> Equivalent<K> for Qwhere - Q: Eq + ?Sized, - K: Borrow<Q> + ?Sized,

§

fn equivalent(&self, key: &K) -> bool

Checks if this value is equivalent to the given key. Read more
§

impl<Q, K> Equivalent<K> for Qwhere - Q: Eq + ?Sized, - K: Borrow<Q> + ?Sized,

§

fn equivalent(&self, key: &K) -> bool

Compare self to key and return true if they are equal.
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

-
source§

impl<T, U> Into<U> for Twhere - U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

+}

Variants§

§

Yes

§

No

§

Maybe

Trait Implementations§

source§

impl Clone for HasWord

source§

fn clone(&self) -> HasWord

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 HasWord

source§

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

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

impl PartialEq for HasWord

source§

fn eq(&self, other: &HasWord) -> 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 Copy for HasWord

source§

impl Eq for HasWord

source§

impl StructuralEq for HasWord

source§

impl StructuralPartialEq for HasWord

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,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

source§

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

Mutably borrows from an owned value. Read more
§

impl<Q, K> Equivalent<K> for Qwhere + Q: Eq + ?Sized, + K: Borrow<Q> + ?Sized,

§

fn equivalent(&self, key: &K) -> bool

Checks if this value is equivalent to the given key. Read more
§

impl<Q, K> Equivalent<K> for Qwhere + Q: Eq + ?Sized, + K: Borrow<Q> + ?Sized,

§

fn equivalent(&self, key: &K) -> bool

Compare self to key and return true if they are equal.
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

+
source§

impl<T, U> Into<U> for Twhere + U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of -From<T> for U chooses to do.

-
source§

impl<T> ToOwned for Twhere - T: Clone,

§

type Owned = T

The resulting type after obtaining ownership.
source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
source§

impl<T, U> TryFrom<U> for Twhere - U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
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.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
\ No newline at end of file +From<T> for U chooses to do.

+
source§

impl<T> ToOwned for Twhere + T: Clone,

§

type Owned = T

The resulting type after obtaining ownership.
source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
source§

impl<T, U> TryFrom<U> for Twhere + U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
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.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
\ No newline at end of file diff --git a/rust/sudachi/analysis/created/index.html b/rust/sudachi/analysis/created/index.html index e0f1dfba..bd60a53e 100644 --- a/rust/sudachi/analysis/created/index.html +++ b/rust/sudachi/analysis/created/index.html @@ -1,3 +1,3 @@ -sudachi::analysis::created - Rust

Module sudachi::analysis::created

source ·

Structs

\ No newline at end of file diff --git a/rust/sudachi/analysis/enum.Mode.html b/rust/sudachi/analysis/enum.Mode.html index 7ab52391..8c684e99 100644 --- a/rust/sudachi/analysis/enum.Mode.html +++ b/rust/sudachi/analysis/enum.Mode.html @@ -1,4 +1,4 @@ -Mode in sudachi::analysis - Rust

Enum sudachi::analysis::Mode

source ·
pub enum Mode {
+Mode in sudachi::analysis - Rust

Enum sudachi::analysis::Mode

source ·
pub enum Mode {
     A,
     B,
     C,
@@ -25,22 +25,22 @@
 

Variants§

§

A

Short

§

B

Middle (similar to “word”)

§

C

Named Entity

-

Trait Implementations§

source§

impl Clone for Mode

source§

fn clone(&self) -> Mode

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 Mode

source§

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

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

impl Display for Mode

source§

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

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

impl FromStr for Mode

§

type Err = &'static str

The associated error which can be returned from parsing.
source§

fn from_str(s: &str) -> Result<Self, Self::Err>

Parses a string s to return a value of this type. Read more
source§

impl PartialEq<Mode> for Mode

source§

fn eq(&self, other: &Mode) -> 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 Copy for Mode

source§

impl Eq for Mode

source§

impl StructuralEq for Mode

source§

impl StructuralPartialEq for Mode

Auto Trait Implementations§

§

impl RefUnwindSafe for Mode

§

impl Send for Mode

§

impl Sync for Mode

§

impl Unpin for Mode

§

impl UnwindSafe for Mode

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,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

source§

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

Mutably borrows from an owned value. Read more
§

impl<Q, K> Equivalent<K> for Qwhere - Q: Eq + ?Sized, - K: Borrow<Q> + ?Sized,

§

fn equivalent(&self, key: &K) -> bool

Checks if this value is equivalent to the given key. Read more
§

impl<Q, K> Equivalent<K> for Qwhere - Q: Eq + ?Sized, - K: Borrow<Q> + ?Sized,

§

fn equivalent(&self, key: &K) -> bool

Compare self to key and return true if they are equal.
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

-
source§

impl<T, U> Into<U> for Twhere - U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

+

Trait Implementations§

source§

impl Clone for Mode

source§

fn clone(&self) -> Mode

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 Mode

source§

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

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

impl Display for Mode

source§

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

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

impl FromStr for Mode

§

type Err = &'static str

The associated error which can be returned from parsing.
source§

fn from_str(s: &str) -> Result<Self, Self::Err>

Parses a string s to return a value of this type. Read more
source§

impl PartialEq for Mode

source§

fn eq(&self, other: &Mode) -> 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 Copy for Mode

source§

impl Eq for Mode

source§

impl StructuralEq for Mode

source§

impl StructuralPartialEq for Mode

Auto Trait Implementations§

§

impl RefUnwindSafe for Mode

§

impl Send for Mode

§

impl Sync for Mode

§

impl Unpin for Mode

§

impl UnwindSafe for Mode

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,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

source§

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

Mutably borrows from an owned value. Read more
§

impl<Q, K> Equivalent<K> for Qwhere + Q: Eq + ?Sized, + K: Borrow<Q> + ?Sized,

§

fn equivalent(&self, key: &K) -> bool

Checks if this value is equivalent to the given key. Read more
§

impl<Q, K> Equivalent<K> for Qwhere + Q: Eq + ?Sized, + K: Borrow<Q> + ?Sized,

§

fn equivalent(&self, key: &K) -> bool

Compare self to key and return true if they are equal.
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

+
source§

impl<T, U> Into<U> for Twhere + U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of -From<T> for U chooses to do.

-
source§

impl<T> ToOwned for Twhere - T: Clone,

§

type Owned = T

The resulting type after obtaining ownership.
source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
source§

impl<T> ToString for Twhere - T: Display + ?Sized,

source§

default fn to_string(&self) -> String

Converts the given value to a String. Read more
source§

impl<T, U> TryFrom<U> for Twhere - U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
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.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
\ No newline at end of file +From<T> for U chooses to do.

+
source§

impl<T> ToOwned for Twhere + T: Clone,

§

type Owned = T

The resulting type after obtaining ownership.
source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
source§

impl<T> ToString for Twhere + T: Display + ?Sized,

source§

default fn to_string(&self) -> String

Converts the given value to a String. Read more
source§

impl<T, U> TryFrom<U> for Twhere + U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
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.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
\ No newline at end of file diff --git a/rust/sudachi/analysis/index.html b/rust/sudachi/analysis/index.html index 007e2a0e..a7abae6e 100644 --- a/rust/sudachi/analysis/index.html +++ b/rust/sudachi/analysis/index.html @@ -1 +1 @@ -sudachi::analysis - Rust
\ No newline at end of file +sudachi::analysis - Rust
\ No newline at end of file diff --git a/rust/sudachi/analysis/lattice/index.html b/rust/sudachi/analysis/lattice/index.html index 156a4404..57f87bc5 100644 --- a/rust/sudachi/analysis/lattice/index.html +++ b/rust/sudachi/analysis/lattice/index.html @@ -1,4 +1,4 @@ -sudachi::analysis::lattice - Rust

Module sudachi::analysis::lattice

source ·

Structs

Trait Implementations§

source§

impl Default for Lattice

source§

fn default() -> Self

Returns the “default value” for a type. 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,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

source§

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

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

-
source§

impl<T, U> Into<U> for Twhere - U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

+ out: &mut W +) -> SudachiResult<()>

Trait Implementations§

source§

impl Default for Lattice

source§

fn default() -> Self

Returns the “default value” for a type. 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,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

source§

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

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

+
source§

impl<T, U> Into<U> for Twhere + U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of -From<T> for U chooses to do.

-
source§

impl<T, U> TryFrom<U> for Twhere - U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
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.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
\ No newline at end of file +From<T> for U chooses to do.

+
source§

impl<T, U> TryFrom<U> for Twhere + U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
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.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
\ No newline at end of file diff --git a/rust/sudachi/analysis/mlist/index.html b/rust/sudachi/analysis/mlist/index.html index 04a207b2..d9cfe482 100644 --- a/rust/sudachi/analysis/mlist/index.html +++ b/rust/sudachi/analysis/mlist/index.html @@ -1 +1 @@ -sudachi::analysis::mlist - Rust

Module sudachi::analysis::mlist

source ·

Structs

\ No newline at end of file +sudachi::analysis::mlist - Rust

Module sudachi::analysis::mlist

source ·

Structs

\ No newline at end of file diff --git a/rust/sudachi/analysis/mlist/struct.MorphemeIter.html b/rust/sudachi/analysis/mlist/struct.MorphemeIter.html index 99d992a8..ece1dea7 100644 --- a/rust/sudachi/analysis/mlist/struct.MorphemeIter.html +++ b/rust/sudachi/analysis/mlist/struct.MorphemeIter.html @@ -1,592 +1,589 @@ -MorphemeIter in sudachi::analysis::mlist - Rust
pub struct MorphemeIter<'a, T> { /* private fields */ }
Expand description

Iterates over morpheme list

-

Trait Implementations§

source§

impl<'a, T: DictionaryAccess> ExactSizeIterator for MorphemeIter<'a, T>

source§

fn len(&self) -> usize

Returns the exact remaining length of the iterator. Read more
source§

fn is_empty(&self) -> bool

🔬This is a nightly-only experimental API. (exact_size_is_empty)
Returns true if the iterator is empty. Read more
source§

impl<'a, T: DictionaryAccess> Iterator for MorphemeIter<'a, T>

§

type Item = Morpheme<'a, T>

The type of the elements being iterated over.
source§

fn next(&mut self) -> Option<Self::Item>

Advances the iterator and returns the next value. Read more
source§

fn size_hint(&self) -> (usize, Option<usize>)

Returns the bounds on the remaining length of the iterator. Read more
source§

fn next_chunk<const N: usize>( +MorphemeIter in sudachi::analysis::mlist - Rust
pub struct MorphemeIter<'a, T> { /* private fields */ }
Expand description

Iterates over morpheme list

+

Trait Implementations§

source§

impl<'a, T: DictionaryAccess> ExactSizeIterator for MorphemeIter<'a, T>

source§

fn len(&self) -> usize

Returns the exact remaining length of the iterator. Read more
source§

fn is_empty(&self) -> bool

🔬This is a nightly-only experimental API. (exact_size_is_empty)
Returns true if the iterator is empty. Read more
source§

impl<'a, T: DictionaryAccess> Iterator for MorphemeIter<'a, T>

§

type Item = Morpheme<'a, T>

The type of the elements being iterated over.
source§

fn next(&mut self) -> Option<Self::Item>

Advances the iterator and returns the next value. Read more
source§

fn size_hint(&self) -> (usize, Option<usize>)

Returns the bounds on the remaining length of the iterator. Read more
source§

fn next_chunk<const N: usize>( &mut self -) -> Result<[Self::Item; N], IntoIter<Self::Item, N>>where - Self: Sized,

🔬This is a nightly-only experimental API. (iter_next_chunk)
Advances the iterator and returns an array containing the next N values. Read more
1.0.0 · source§

fn count(self) -> usizewhere - Self: Sized,

Consumes the iterator, counting the number of iterations and returning it. Read more
1.0.0 · source§

fn last(self) -> Option<Self::Item>where - Self: Sized,

Consumes the iterator, returning the last element. Read more
source§

fn advance_by(&mut self, n: usize) -> Result<(), NonZeroUsize>

🔬This is a nightly-only experimental API. (iter_advance_by)
Advances the iterator by n elements. Read more
1.0.0 · source§

fn nth(&mut self, n: usize) -> Option<Self::Item>

Returns the nth element of the iterator. Read more
1.28.0 · source§

fn step_by(self, step: usize) -> StepBy<Self>where - Self: Sized,

Creates an iterator starting at the same point, but stepping by -the given amount at each iteration. Read more
1.0.0 · source§

fn chain<U>(self, other: U) -> Chain<Self, <U as IntoIterator>::IntoIter>where - Self: Sized, - U: IntoIterator<Item = Self::Item>,

Takes two iterators and creates a new iterator over both in sequence. Read more
1.0.0 · source§

fn zip<U>(self, other: U) -> Zip<Self, <U as IntoIterator>::IntoIter>where - Self: Sized, - U: IntoIterator,

‘Zips up’ two iterators into a single iterator of pairs. Read more
source§

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

🔬This is a nightly-only experimental API. (iter_intersperse)
Creates a new iterator which places an item generated by separator -between adjacent items of the original iterator. Read more
1.0.0 · source§

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

Takes a closure and creates an iterator which calls that closure on each -element. Read more
1.21.0 · source§

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

Calls a closure on each element of an iterator. Read more
1.0.0 · source§

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

Creates an iterator which uses a closure to determine if an element -should be yielded. Read more
1.0.0 · source§

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

Creates an iterator that both filters and maps. Read more
1.0.0 · source§

fn enumerate(self) -> Enumerate<Self>where - Self: Sized,

Creates an iterator which gives the current iteration count as well as -the next value. Read more
1.0.0 · source§

fn peekable(self) -> Peekable<Self>where - Self: Sized,

Creates an iterator which can use the peek and peek_mut methods +) -> Result<[Self::Item; N], IntoIter<Self::Item, N>>where + Self: Sized,

🔬This is a nightly-only experimental API. (iter_next_chunk)
Advances the iterator and returns an array containing the next N values. Read more
1.0.0 · source§

fn count(self) -> usizewhere + Self: Sized,

Consumes the iterator, counting the number of iterations and returning it. Read more
1.0.0 · source§

fn last(self) -> Option<Self::Item>where + Self: Sized,

Consumes the iterator, returning the last element. Read more
source§

fn advance_by(&mut self, n: usize) -> Result<(), NonZeroUsize>

🔬This is a nightly-only experimental API. (iter_advance_by)
Advances the iterator by n elements. Read more
1.0.0 · source§

fn nth(&mut self, n: usize) -> Option<Self::Item>

Returns the nth element of the iterator. Read more
1.28.0 · source§

fn step_by(self, step: usize) -> StepBy<Self>where + Self: Sized,

Creates an iterator starting at the same point, but stepping by +the given amount at each iteration. Read more
1.0.0 · source§

fn chain<U>(self, other: U) -> Chain<Self, <U as IntoIterator>::IntoIter>where + Self: Sized, + U: IntoIterator<Item = Self::Item>,

Takes two iterators and creates a new iterator over both in sequence. Read more
1.0.0 · source§

fn zip<U>(self, other: U) -> Zip<Self, <U as IntoIterator>::IntoIter>where + Self: Sized, + U: IntoIterator,

‘Zips up’ two iterators into a single iterator of pairs. Read more
source§

fn intersperse_with<G>(self, separator: G) -> IntersperseWith<Self, G>where + Self: Sized, + G: FnMut() -> Self::Item,

🔬This is a nightly-only experimental API. (iter_intersperse)
Creates a new iterator which places an item generated by separator +between adjacent items of the original iterator. Read more
1.0.0 · source§

fn map<B, F>(self, f: F) -> Map<Self, F>where + Self: Sized, + F: FnMut(Self::Item) -> B,

Takes a closure and creates an iterator which calls that closure on each +element. Read more
1.21.0 · source§

fn for_each<F>(self, f: F)where + Self: Sized, + F: FnMut(Self::Item),

Calls a closure on each element of an iterator. Read more
1.0.0 · source§

fn filter<P>(self, predicate: P) -> Filter<Self, P>where + Self: Sized, + P: FnMut(&Self::Item) -> bool,

Creates an iterator which uses a closure to determine if an element +should be yielded. Read more
1.0.0 · source§

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F>where + Self: Sized, + F: FnMut(Self::Item) -> Option<B>,

Creates an iterator that both filters and maps. Read more
1.0.0 · source§

fn enumerate(self) -> Enumerate<Self>where + Self: Sized,

Creates an iterator which gives the current iteration count as well as +the next value. Read more
1.0.0 · source§

fn peekable(self) -> Peekable<Self>where + Self: Sized,

Creates an iterator which can use the peek and peek_mut methods to look at the next element of the iterator without consuming it. See -their documentation for more information. Read more
1.0.0 · source§

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

Creates an iterator that skips elements based on a predicate. Read more
1.0.0 · source§

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

Creates an iterator that yields elements based on a predicate. Read more
1.57.0 · source§

fn map_while<B, P>(self, predicate: P) -> MapWhile<Self, P>where - Self: Sized, - P: FnMut(Self::Item) -> Option<B>,

Creates an iterator that both yields elements based on a predicate and maps. Read more
1.0.0 · source§

fn skip(self, n: usize) -> Skip<Self>where - Self: Sized,

Creates an iterator that skips the first n elements. Read more
1.0.0 · source§

fn take(self, n: usize) -> Take<Self>where - Self: Sized,

Creates an iterator that yields the first n elements, or fewer -if the underlying iterator ends sooner. Read more
1.0.0 · source§

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F>where - Self: Sized, - F: FnMut(&mut St, Self::Item) -> Option<B>,

An iterator adapter which, like fold, holds internal state, but -unlike fold, produces a new iterator. Read more
1.0.0 · source§

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F>where - Self: Sized, - U: IntoIterator, - F: FnMut(Self::Item) -> U,

Creates an iterator that works like map, but flattens nested structure. Read more
source§

fn map_windows<F, R, const N: usize>(self, f: F) -> MapWindows<Self, F, N>where - Self: Sized, - F: FnMut(&[Self::Item; N]) -> R,

🔬This is a nightly-only experimental API. (iter_map_windows)
Calls the given function f for each contiguous window of size N over -self and returns an iterator over the outputs of f. Like slice::windows(), -the windows during mapping overlap as well. Read more
1.0.0 · source§

fn fuse(self) -> Fuse<Self>where - Self: Sized,

Creates an iterator which ends after the first None. Read more
1.0.0 · source§

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

Does something with each element of an iterator, passing the value on. Read more
1.0.0 · source§

fn by_ref(&mut self) -> &mut Selfwhere - Self: Sized,

Borrows an iterator, rather than consuming it. Read more
1.0.0 · source§

fn collect<B>(self) -> Bwhere - B: FromIterator<Self::Item>, - Self: Sized,

Transforms an iterator into a collection. Read more
source§

fn collect_into<E>(self, collection: &mut E) -> &mut Ewhere - E: Extend<Self::Item>, - Self: Sized,

🔬This is a nightly-only experimental API. (iter_collect_into)
Collects all the items from an iterator into a collection. Read more
1.0.0 · source§

fn partition<B, F>(self, f: F) -> (B, B)where - Self: Sized, - B: Default + Extend<Self::Item>, - F: FnMut(&Self::Item) -> bool,

Consumes an iterator, creating two collections from it. Read more
source§

fn is_partitioned<P>(self, predicate: P) -> boolwhere - Self: Sized, - P: FnMut(Self::Item) -> bool,

🔬This is a nightly-only experimental API. (iter_is_partitioned)
Checks if the elements of this iterator are partitioned according to the given predicate, -such that all those that return true precede all those that return false. Read more
1.27.0 · source§

fn try_fold<B, F, R>(&mut self, init: B, f: F) -> Rwhere - Self: Sized, - F: FnMut(B, Self::Item) -> R, - R: Try<Output = B>,

An iterator method that applies a function as long as it returns -successfully, producing a single, final value. Read more
1.27.0 · source§

fn try_for_each<F, R>(&mut self, f: F) -> Rwhere - Self: Sized, - F: FnMut(Self::Item) -> R, - R: Try<Output = ()>,

An iterator method that applies a fallible function to each item in the -iterator, stopping at the first error and returning that error. Read more
1.0.0 · source§

fn fold<B, F>(self, init: B, f: F) -> Bwhere - Self: Sized, - F: FnMut(B, Self::Item) -> B,

Folds every element into an accumulator by applying an operation, -returning the final result. Read more
1.51.0 · source§

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

Reduces the elements to a single one, by repeatedly applying a reducing -operation. Read more
source§

fn try_reduce<F, R>( +their documentation for more information. Read more

1.0.0 · source§

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P>where + Self: Sized, + P: FnMut(&Self::Item) -> bool,

Creates an iterator that skips elements based on a predicate. Read more
1.0.0 · source§

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P>where + Self: Sized, + P: FnMut(&Self::Item) -> bool,

Creates an iterator that yields elements based on a predicate. Read more
1.57.0 · source§

fn map_while<B, P>(self, predicate: P) -> MapWhile<Self, P>where + Self: Sized, + P: FnMut(Self::Item) -> Option<B>,

Creates an iterator that both yields elements based on a predicate and maps. Read more
1.0.0 · source§

fn skip(self, n: usize) -> Skip<Self>where + Self: Sized,

Creates an iterator that skips the first n elements. Read more
1.0.0 · source§

fn take(self, n: usize) -> Take<Self>where + Self: Sized,

Creates an iterator that yields the first n elements, or fewer +if the underlying iterator ends sooner. Read more
1.0.0 · source§

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F>where + Self: Sized, + F: FnMut(&mut St, Self::Item) -> Option<B>,

An iterator adapter which, like fold, holds internal state, but +unlike fold, produces a new iterator. Read more
1.0.0 · source§

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F>where + Self: Sized, + U: IntoIterator, + F: FnMut(Self::Item) -> U,

Creates an iterator that works like map, but flattens nested structure. Read more
source§

fn map_windows<F, R, const N: usize>(self, f: F) -> MapWindows<Self, F, N>where + Self: Sized, + F: FnMut(&[Self::Item; N]) -> R,

🔬This is a nightly-only experimental API. (iter_map_windows)
Calls the given function f for each contiguous window of size N over +self and returns an iterator over the outputs of f. Like slice::windows(), +the windows during mapping overlap as well. Read more
1.0.0 · source§

fn fuse(self) -> Fuse<Self>where + Self: Sized,

Creates an iterator which ends after the first None. Read more
1.0.0 · source§

fn inspect<F>(self, f: F) -> Inspect<Self, F>where + Self: Sized, + F: FnMut(&Self::Item),

Does something with each element of an iterator, passing the value on. Read more
1.0.0 · source§

fn by_ref(&mut self) -> &mut Selfwhere + Self: Sized,

Borrows an iterator, rather than consuming it. Read more
1.0.0 · source§

fn collect<B>(self) -> Bwhere + B: FromIterator<Self::Item>, + Self: Sized,

Transforms an iterator into a collection. Read more
source§

fn collect_into<E>(self, collection: &mut E) -> &mut Ewhere + E: Extend<Self::Item>, + Self: Sized,

🔬This is a nightly-only experimental API. (iter_collect_into)
Collects all the items from an iterator into a collection. Read more
1.0.0 · source§

fn partition<B, F>(self, f: F) -> (B, B)where + Self: Sized, + B: Default + Extend<Self::Item>, + F: FnMut(&Self::Item) -> bool,

Consumes an iterator, creating two collections from it. Read more
source§

fn is_partitioned<P>(self, predicate: P) -> boolwhere + Self: Sized, + P: FnMut(Self::Item) -> bool,

🔬This is a nightly-only experimental API. (iter_is_partitioned)
Checks if the elements of this iterator are partitioned according to the given predicate, +such that all those that return true precede all those that return false. Read more
1.27.0 · source§

fn try_fold<B, F, R>(&mut self, init: B, f: F) -> Rwhere + Self: Sized, + F: FnMut(B, Self::Item) -> R, + R: Try<Output = B>,

An iterator method that applies a function as long as it returns +successfully, producing a single, final value. Read more
1.27.0 · source§

fn try_for_each<F, R>(&mut self, f: F) -> Rwhere + Self: Sized, + F: FnMut(Self::Item) -> R, + R: Try<Output = ()>,

An iterator method that applies a fallible function to each item in the +iterator, stopping at the first error and returning that error. Read more
1.0.0 · source§

fn fold<B, F>(self, init: B, f: F) -> Bwhere + Self: Sized, + F: FnMut(B, Self::Item) -> B,

Folds every element into an accumulator by applying an operation, +returning the final result. Read more
1.51.0 · source§

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

Reduces the elements to a single one, by repeatedly applying a reducing +operation. Read more
source§

fn try_reduce<F, R>( &mut self, f: F -) -> <<R as Try>::Residual as Residual<Option<<R as Try>::Output>>>::TryTypewhere - Self: Sized, - F: FnMut(Self::Item, Self::Item) -> R, - R: Try<Output = Self::Item>, - <R as Try>::Residual: Residual<Option<Self::Item>>,

🔬This is a nightly-only experimental API. (iterator_try_reduce)
Reduces the elements to a single one by repeatedly applying a reducing operation. If the -closure returns a failure, the failure is propagated back to the caller immediately. Read more
1.0.0 · source§

fn all<F>(&mut self, f: F) -> boolwhere - Self: Sized, - F: FnMut(Self::Item) -> bool,

Tests if every element of the iterator matches a predicate. Read more
1.0.0 · source§

fn any<F>(&mut self, f: F) -> boolwhere - Self: Sized, - F: FnMut(Self::Item) -> bool,

Tests if any element of the iterator matches a predicate. Read more
1.0.0 · source§

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

Searches for an element of an iterator that satisfies a predicate. Read more
1.30.0 · source§

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

Applies function to the elements of iterator and returns -the first non-none result. Read more
source§

fn try_find<F, R>( +) -> <<R as Try>::Residual as Residual<Option<<R as Try>::Output>>>::TryTypewhere + Self: Sized, + F: FnMut(Self::Item, Self::Item) -> R, + R: Try<Output = Self::Item>, + <R as Try>::Residual: Residual<Option<Self::Item>>,

🔬This is a nightly-only experimental API. (iterator_try_reduce)
Reduces the elements to a single one by repeatedly applying a reducing operation. If the +closure returns a failure, the failure is propagated back to the caller immediately. Read more
1.0.0 · source§

fn all<F>(&mut self, f: F) -> boolwhere + Self: Sized, + F: FnMut(Self::Item) -> bool,

Tests if every element of the iterator matches a predicate. Read more
1.0.0 · source§

fn any<F>(&mut self, f: F) -> boolwhere + Self: Sized, + F: FnMut(Self::Item) -> bool,

Tests if any element of the iterator matches a predicate. Read more
1.0.0 · source§

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

Searches for an element of an iterator that satisfies a predicate. Read more
1.30.0 · source§

fn find_map<B, F>(&mut self, f: F) -> Option<B>where + Self: Sized, + F: FnMut(Self::Item) -> Option<B>,

Applies function to the elements of iterator and returns +the first non-none result. Read more
source§

fn try_find<F, R>( &mut self, f: F -) -> <<R as Try>::Residual as Residual<Option<Self::Item>>>::TryTypewhere - Self: Sized, - F: FnMut(&Self::Item) -> R, - R: Try<Output = bool>, - <R as Try>::Residual: Residual<Option<Self::Item>>,

🔬This is a nightly-only experimental API. (try_find)
Applies function to the elements of iterator and returns -the first true result or the first error. Read more
1.0.0 · source§

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

Searches for an element in an iterator, returning its index. Read more
1.6.0 · source§

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item>where - B: Ord, - Self: Sized, - F: FnMut(&Self::Item) -> B,

Returns the element that gives the maximum value from the -specified function. Read more
1.15.0 · source§

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

Returns the element that gives the maximum value with respect to the -specified comparison function. Read more
1.6.0 · source§

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item>where - B: Ord, - Self: Sized, - F: FnMut(&Self::Item) -> B,

Returns the element that gives the minimum value from the -specified function. Read more
1.15.0 · source§

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

Returns the element that gives the minimum value with respect to the -specified comparison function. Read more
1.0.0 · source§

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB)where - FromA: Default + Extend<A>, - FromB: Default + Extend<B>, - Self: Sized + Iterator<Item = (A, B)>,

Converts an iterator of pairs into a pair of containers. Read more
1.36.0 · source§

fn copied<'a, T>(self) -> Copied<Self>where - T: 'a + Copy, - Self: Sized + Iterator<Item = &'a T>,

Creates an iterator which copies all of its elements. Read more
1.0.0 · source§

fn cloned<'a, T>(self) -> Cloned<Self>where - T: 'a + Clone, - Self: Sized + Iterator<Item = &'a T>,

Creates an iterator which clones all of its elements. Read more
source§

fn array_chunks<const N: usize>(self) -> ArrayChunks<Self, N>where - Self: Sized,

🔬This is a nightly-only experimental API. (iter_array_chunks)
Returns an iterator over N elements of the iterator at a time. Read more
1.11.0 · source§

fn sum<S>(self) -> Swhere - Self: Sized, - S: Sum<Self::Item>,

Sums the elements of an iterator. Read more
1.11.0 · source§

fn product<P>(self) -> Pwhere - Self: Sized, - P: Product<Self::Item>,

Iterates over the entire iterator, multiplying all the elements Read more
source§

fn cmp_by<I, F>(self, other: I, cmp: F) -> Orderingwhere - Self: Sized, - I: IntoIterator, - F: FnMut(Self::Item, <I as IntoIterator>::Item) -> Ordering,

🔬This is a nightly-only experimental API. (iter_order_by)
Lexicographically compares the elements of this Iterator with those -of another with respect to the specified comparison function. Read more
1.5.0 · source§

fn partial_cmp<I>(self, other: I) -> Option<Ordering>where - I: IntoIterator, - Self::Item: PartialOrd<<I as IntoIterator>::Item>, - Self: Sized,

Lexicographically compares the PartialOrd elements of -this Iterator with those of another. The comparison works like short-circuit +) -> <<R as Try>::Residual as Residual<Option<Self::Item>>>::TryTypewhere + Self: Sized, + F: FnMut(&Self::Item) -> R, + R: Try<Output = bool>, + <R as Try>::Residual: Residual<Option<Self::Item>>,
🔬This is a nightly-only experimental API. (try_find)
Applies function to the elements of iterator and returns +the first true result or the first error. Read more
1.0.0 · source§

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

Searches for an element in an iterator, returning its index. Read more
1.6.0 · source§

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item>where + B: Ord, + Self: Sized, + F: FnMut(&Self::Item) -> B,

Returns the element that gives the maximum value from the +specified function. Read more
1.15.0 · source§

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

Returns the element that gives the maximum value with respect to the +specified comparison function. Read more
1.6.0 · source§

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item>where + B: Ord, + Self: Sized, + F: FnMut(&Self::Item) -> B,

Returns the element that gives the minimum value from the +specified function. Read more
1.15.0 · source§

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

Returns the element that gives the minimum value with respect to the +specified comparison function. Read more
1.0.0 · source§

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB)where + FromA: Default + Extend<A>, + FromB: Default + Extend<B>, + Self: Sized + Iterator<Item = (A, B)>,

Converts an iterator of pairs into a pair of containers. Read more
1.36.0 · source§

fn copied<'a, T>(self) -> Copied<Self>where + T: 'a + Copy, + Self: Sized + Iterator<Item = &'a T>,

Creates an iterator which copies all of its elements. Read more
1.0.0 · source§

fn cloned<'a, T>(self) -> Cloned<Self>where + T: 'a + Clone, + Self: Sized + Iterator<Item = &'a T>,

Creates an iterator which clones all of its elements. Read more
source§

fn array_chunks<const N: usize>(self) -> ArrayChunks<Self, N>where + Self: Sized,

🔬This is a nightly-only experimental API. (iter_array_chunks)
Returns an iterator over N elements of the iterator at a time. Read more
1.11.0 · source§

fn sum<S>(self) -> Swhere + Self: Sized, + S: Sum<Self::Item>,

Sums the elements of an iterator. Read more
1.11.0 · source§

fn product<P>(self) -> Pwhere + Self: Sized, + P: Product<Self::Item>,

Iterates over the entire iterator, multiplying all the elements Read more
source§

fn cmp_by<I, F>(self, other: I, cmp: F) -> Orderingwhere + Self: Sized, + I: IntoIterator, + F: FnMut(Self::Item, <I as IntoIterator>::Item) -> Ordering,

🔬This is a nightly-only experimental API. (iter_order_by)
Lexicographically compares the elements of this Iterator with those +of another with respect to the specified comparison function. Read more
1.5.0 · source§

fn partial_cmp<I>(self, other: I) -> Option<Ordering>where + I: IntoIterator, + Self::Item: PartialOrd<<I as IntoIterator>::Item>, + Self: Sized,

Lexicographically compares the PartialOrd elements of +this Iterator with those of another. The comparison works like short-circuit evaluation, returning a result without comparing the remaining elements. -As soon as an order can be determined, the evaluation stops and a result is returned. Read more
source§

fn partial_cmp_by<I, F>(self, other: I, partial_cmp: F) -> Option<Ordering>where - Self: Sized, - I: IntoIterator, - F: FnMut(Self::Item, <I as IntoIterator>::Item) -> Option<Ordering>,

🔬This is a nightly-only experimental API. (iter_order_by)
Lexicographically compares the elements of this Iterator with those -of another with respect to the specified comparison function. Read more
1.5.0 · source§

fn eq<I>(self, other: I) -> boolwhere - I: IntoIterator, - Self::Item: PartialEq<<I as IntoIterator>::Item>, - Self: Sized,

Determines if the elements of this Iterator are equal to those of -another. Read more
source§

fn eq_by<I, F>(self, other: I, eq: F) -> boolwhere - Self: Sized, - I: IntoIterator, - F: FnMut(Self::Item, <I as IntoIterator>::Item) -> bool,

🔬This is a nightly-only experimental API. (iter_order_by)
Determines if the elements of this Iterator are equal to those of -another with respect to the specified equality function. Read more
1.5.0 · source§

fn ne<I>(self, other: I) -> boolwhere - I: IntoIterator, - Self::Item: PartialEq<<I as IntoIterator>::Item>, - Self: Sized,

Determines if the elements of this Iterator are not equal to those of -another. Read more
1.5.0 · source§

fn lt<I>(self, other: I) -> boolwhere - I: IntoIterator, - Self::Item: PartialOrd<<I as IntoIterator>::Item>, - Self: Sized,

Determines if the elements of this Iterator are lexicographically -less than those of another. Read more
1.5.0 · source§

fn le<I>(self, other: I) -> boolwhere - I: IntoIterator, - Self::Item: PartialOrd<<I as IntoIterator>::Item>, - Self: Sized,

Determines if the elements of this Iterator are lexicographically -less or equal to those of another. Read more
1.5.0 · source§

fn gt<I>(self, other: I) -> boolwhere - I: IntoIterator, - Self::Item: PartialOrd<<I as IntoIterator>::Item>, - Self: Sized,

Determines if the elements of this Iterator are lexicographically -greater than those of another. Read more
1.5.0 · source§

fn ge<I>(self, other: I) -> boolwhere - I: IntoIterator, - Self::Item: PartialOrd<<I as IntoIterator>::Item>, - Self: Sized,

Determines if the elements of this Iterator are lexicographically -greater than or equal to those of another. Read more
source§

fn is_sorted_by<F>(self, compare: F) -> boolwhere - Self: Sized, - F: FnMut(&Self::Item, &Self::Item) -> Option<Ordering>,

🔬This is a nightly-only experimental API. (is_sorted)
Checks if the elements of this iterator are sorted using the given comparator function. Read more
source§

fn is_sorted_by_key<F, K>(self, f: F) -> boolwhere - Self: Sized, - F: FnMut(Self::Item) -> K, - K: PartialOrd<K>,

🔬This is a nightly-only experimental API. (is_sorted)
Checks if the elements of this iterator are sorted using the given key extraction -function. Read more
source§

impl<'a, T: DictionaryAccess> FusedIterator for MorphemeIter<'a, T>

Auto Trait Implementations§

§

impl<'a, T> !RefUnwindSafe for MorphemeIter<'a, T>

§

impl<'a, T> !Send for MorphemeIter<'a, T>

§

impl<'a, T> !Sync for MorphemeIter<'a, T>

§

impl<'a, T> Unpin for MorphemeIter<'a, T>

§

impl<'a, T> !UnwindSafe for MorphemeIter<'a, T>

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,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

source§

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

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

-
source§

impl<T, U> Into<U> for Twhere - U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

+As soon as an order can be determined, the evaluation stops and a result is returned. Read more
source§

fn partial_cmp_by<I, F>(self, other: I, partial_cmp: F) -> Option<Ordering>where + Self: Sized, + I: IntoIterator, + F: FnMut(Self::Item, <I as IntoIterator>::Item) -> Option<Ordering>,

🔬This is a nightly-only experimental API. (iter_order_by)
Lexicographically compares the elements of this Iterator with those +of another with respect to the specified comparison function. Read more
1.5.0 · source§

fn eq<I>(self, other: I) -> boolwhere + I: IntoIterator, + Self::Item: PartialEq<<I as IntoIterator>::Item>, + Self: Sized,

Determines if the elements of this Iterator are equal to those of +another. Read more
source§

fn eq_by<I, F>(self, other: I, eq: F) -> boolwhere + Self: Sized, + I: IntoIterator, + F: FnMut(Self::Item, <I as IntoIterator>::Item) -> bool,

🔬This is a nightly-only experimental API. (iter_order_by)
Determines if the elements of this Iterator are equal to those of +another with respect to the specified equality function. Read more
1.5.0 · source§

fn ne<I>(self, other: I) -> boolwhere + I: IntoIterator, + Self::Item: PartialEq<<I as IntoIterator>::Item>, + Self: Sized,

Determines if the elements of this Iterator are not equal to those of +another. Read more
1.5.0 · source§

fn lt<I>(self, other: I) -> boolwhere + I: IntoIterator, + Self::Item: PartialOrd<<I as IntoIterator>::Item>, + Self: Sized,

Determines if the elements of this Iterator are lexicographically +less than those of another. Read more
1.5.0 · source§

fn le<I>(self, other: I) -> boolwhere + I: IntoIterator, + Self::Item: PartialOrd<<I as IntoIterator>::Item>, + Self: Sized,

Determines if the elements of this Iterator are lexicographically +less or equal to those of another. Read more
1.5.0 · source§

fn gt<I>(self, other: I) -> boolwhere + I: IntoIterator, + Self::Item: PartialOrd<<I as IntoIterator>::Item>, + Self: Sized,

Determines if the elements of this Iterator are lexicographically +greater than those of another. Read more
1.5.0 · source§

fn ge<I>(self, other: I) -> boolwhere + I: IntoIterator, + Self::Item: PartialOrd<<I as IntoIterator>::Item>, + Self: Sized,

Determines if the elements of this Iterator are lexicographically +greater than or equal to those of another. Read more
source§

fn is_sorted_by<F>(self, compare: F) -> boolwhere + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> Option<Ordering>,

🔬This is a nightly-only experimental API. (is_sorted)
Checks if the elements of this iterator are sorted using the given comparator function. Read more
source§

fn is_sorted_by_key<F, K>(self, f: F) -> boolwhere + Self: Sized, + F: FnMut(Self::Item) -> K, + K: PartialOrd,

🔬This is a nightly-only experimental API. (is_sorted)
Checks if the elements of this iterator are sorted using the given key extraction +function. Read more
source§

impl<'a, T: DictionaryAccess> FusedIterator for MorphemeIter<'a, T>

Auto Trait Implementations§

§

impl<'a, T> !RefUnwindSafe for MorphemeIter<'a, T>

§

impl<'a, T> !Send for MorphemeIter<'a, T>

§

impl<'a, T> !Sync for MorphemeIter<'a, T>

§

impl<'a, T> Unpin for MorphemeIter<'a, T>

§

impl<'a, T> !UnwindSafe for MorphemeIter<'a, T>

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,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

source§

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

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

+
source§

impl<T, U> Into<U> for Twhere + U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of -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>( +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>( 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>( +) -> 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, 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 +) -> 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( self, - element: Self::Item -) -> IntersperseWith<Self, IntersperseElementSimple<Self::Item>>where - Self: Sized, - Self::Item: Clone,

An iterator adaptor to insert a particular value + 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 - Self: Sized, - F: FnMut() -> Self::Item,

An iterator adaptor to insert a particular value created by a function + 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>( 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 - J: IntoIterator, - Self: Sized,

Create an iterator which iterates over both this and the specified +) -> 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 + 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 - F: FnMut(&mut Self) -> Option<B>, - Self: Sized,

A “meta iterator adaptor”. Its closure receives a reference to the + 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 - Self: Sized, - F: FnMut(&Self::Item) -> K, - K: PartialEq<K>,

Return an iterable that can group iterator elements. + Self: Sized, + F: FnMut(&Self::Item) -> K, + K: PartialEq,
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 - Self: Sized + Iterator<Item = <T as TupleCollect>::Item>, +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 + <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 - 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 + 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 - Self: Sized + Iterator<Item = <T as TupleCollect>::Item>, + 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 - 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 - Self: Sized,

👎Deprecated since 0.8.0: Use std .step_by() instead
Return an iterator adaptor that steps n elements in the base iterator + 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 + 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 - 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: 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, 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
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 + Self: Iterator<Item = Result<T, E>> + Sized, + F: FnMut(T) -> U,
👎Deprecated since 0.10.0: Use .map_ok() instead
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 - Self: Iterator<Item = Result<T, E>> + Sized, - F: FnMut(&T) -> bool,

Return an iterator adaptor that filters every Result::Ok + 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 - Self: Iterator<Item = Result<T, E>> + Sized, - F: FnMut(T) -> Option<U>,

Return an iterator adaptor that filters and transforms every + 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 - 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 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 + 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 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 - Self: Sized, - Self::Item: PartialOrd<Self::Item>, - J: IntoIterator<Item = Self::Item>,

Return an iterator adaptor that merges the two base iterators in +) -> MergeBy<Self, <J as IntoIterator>::IntoIter, MergeLte>where + Self: Sized, + Self::Item: PartialOrd, + 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>( self, other: J, is_first: F -) -> MergeBy<Self, <J as IntoIterator>::IntoIter, F>where - Self: 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. +) -> MergeBy<Self, <J as IntoIterator>::IntoIter, F>where + Self: 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, T>( self, other: J, cmp_fn: F -) -> MergeBy<Self, <J as IntoIterator>::IntoIter, MergeFuncLR<F, <F as FuncLR<Self::Item, <<J as IntoIterator>::IntoIter as Iterator>::Item>>::T>>where - J: IntoIterator, - F: FnMut(&Self::Item, &<J as IntoIterator>::Item) -> T, - 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 - 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 +) -> MergeBy<Self, <J as IntoIterator>::IntoIter, MergeFuncLR<F, <F as FuncLR<Self::Item, <<J as IntoIterator>::IntoIter as Iterator>::Item>>::T>>where + J: IntoIterator, + F: FnMut(&Self::Item, &<J as IntoIterator>::Item) -> T, + 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 + Self: Sized, + Self::Item: IntoIterator, + <Self::Item as IntoIterator>::Item: PartialOrd,

Return an iterator adaptor that flattens an iterator of iterators by 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 +) -> 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>( self, other: J -) -> Product<Self, <J as IntoIterator>::IntoIter>where - Self: Sized, - Self::Item: Clone, - J: IntoIterator, - <J as IntoIterator>::IntoIter: Clone,

Return an iterator adaptor that iterates over the cartesian product of +) -> Product<Self, <J as IntoIterator>::IntoIter>where + Self: Sized, + Self::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( 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 - 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 - Self: Sized, - Self::Item: PartialEq<Self::Item>,

Remove duplicates from sections of consecutive identical elements. +) -> 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 + 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 + Self: Sized, + Self::Item: PartialEq,

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>( 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, +) -> 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( self -) -> CoalesceBy<Self, DedupPredWithCount2CoalescePred<DedupEq>, (usize, Self::Item)>where - Self: Sized,

Remove duplicates from sections of consecutive identical elements, while keeping a count of +) -> 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>( self, cmp: Cmp -) -> CoalesceBy<Self, DedupPredWithCount2CoalescePred<Cmp>, (usize, Self::Item)>where - Self: Sized, - Cmp: FnMut(&Self::Item, &Self::Item) -> bool,

Remove duplicates from sections of consecutive identical elements, while keeping a count of +) -> CoalesceBy<Self, DedupPredWithCount2CoalescePred<Cmp>, (usize, Self::Item)>where + Self: Sized, + Cmp: 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 - Self: Sized, - Self::Item: Eq + Hash,

Return an iterator adaptor that produces elements that appear more than once during the +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 - Self: Sized, - V: Eq + Hash, - F: FnMut(&Self::Item) -> V,

Return an iterator adaptor that produces elements that appear more than once during the + 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 - Self: Sized, - Self::Item: Clone + Eq + Hash,

Return an iterator adaptor that filters out elements that have + 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 - Self: Sized, - V: Eq + Hash, - F: FnMut(&Self::Item) -> V,

Return an iterator adaptor that filters out elements that have + 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 - Self: Sized + PeekingNext, - F: FnMut(&Self::Item) -> bool,

Return an iterator adaptor that borrows from this iterator and + 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 - Self: Clone, - F: FnMut(&Self::Item) -> bool,

Return an iterator adaptor that borrows from a Clone-able iterator + 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 take_while_inclusive<F>(self, accept: F) -> TakeWhileInclusive<Self, F>where - Self: Sized, - F: FnMut(&Self::Item) -> bool,

Returns an iterator adaptor that consumes elements while the given + 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 + 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 - Self: Sized + Clone, - Self::Item: Clone, + 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 - Self: Sized, - Self::Item: Clone,

Return an iterator adaptor that iterates over the k-length combinations of +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( self, - k: usize + 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 - Self: Sized, - Self::Item: Clone,

Return an iterator adaptor that iterates over all k-permutations of the + 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 + 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 - 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 - Self: Sized, - F: FnMut(usize) -> Self::Item,

Return an iterator adaptor that pads the sequence to a minimum length of + 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 + 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 combines each element with a Position to + 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 + 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 - 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 - Self: Sized + Iterator<Item = <T as TupleCollect>::Item>, + 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 + 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 - Self: Sized + Iterator<Item = <T as TupleCollect>::Item>, +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 - 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 - 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 - 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 - Self: Sized, - Self::Item: PartialEq<Self::Item>,

Check whether all elements compare equal. Read more
source§

fn all_equal_value( +(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 + 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 + Self: Sized, + Self::Item: Borrow<Q>, + Q: PartialEq,

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,

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: PartialEq<Self::Item>,

If there are elements and they are all equal, return a single copy of that element. +) -> Result<Self::Item, Option<(Self::Item, Self::Item)>>where + Self: Sized, + Self::Item: PartialEq,
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 - Self: Sized + DoubleEndedIterator,

Consume the last n elements from the iterator eagerly, +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 + 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 - 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, - 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 - 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 + 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, + 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>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 + 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 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 - 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 - Self: Iterator<Item = Result<A, E>>, - F: FnMut(B, A) -> B,

👎Deprecated since 0.10.0: Use .fold_ok() instead
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 - 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(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 - 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, - 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 - 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 - 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: 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 - 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 - 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: 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 - 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 - 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 - 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: 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 - 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 - 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>( - 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 + 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 + 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 + Self: Iterator<Item = Result<A, E>>, + F: FnMut(B, A) -> B,

👎Deprecated since 0.10.0: Use .fold_ok() instead
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 + 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(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 + 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, + 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 + 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>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>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>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>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>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>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>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>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: 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 + 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>>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>(self, f: F) -> HashMap<K, Vec<V>>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 - Self: Iterator<Item = (K, V)> + Sized, - K: Hash + Eq,

Constructs a GroupingMap to be used later with one of the efficient + 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>( 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 - 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: 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 - 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 - 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: 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 - Self: Sized, - K: Ord, - 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: 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 - 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 - 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: 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 - 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 - 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: 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 - 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 - 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 - 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 - 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 - Self: Sized,

If the iterator yields exactly one element, that element will be returned, otherwise + 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>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>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>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>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>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>where + Self: Sized, + K: Ord, + 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,

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, + 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 + 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 + 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: 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 + 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 + 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: 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 + 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 + Self: Sized, + Self::Item: PartialOrd,

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 + Self: Sized, + K: PartialOrd, + 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 + 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 + 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 - Self: Sized,

If the iterator yields no elements, Ok(None) will be returned. If the iterator yields +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 - 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 - Self: Sized, - Self::Item: Eq + Hash,

Collect the items in this iterator and return a HashMap which + 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>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 - Self: Sized, - K: Eq + Hash, - F: FnMut(Self::Item) -> K,

Collect the items in this iterator and return a HashMap which +of times it appears. Read more
source§

fn counts_by<K, F>(self, f: F) -> HashMap<K, usize>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 - Self: Sized + MultiUnzip<FromI>,

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

fn try_len(&self) -> Result<usize, (usize, Option<usize>)>

Returns the length of the iterator if one exists. -Otherwise return self.size_hint(). Read more
source§

impl<T, U> TryFrom<U> for Twhere - U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
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.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
\ No newline at end of file + Self: Sized + MultiUnzip<FromI>,
Converts an iterator of tuples into a tuple of containers. Read more
source§

fn try_len(&self) -> Result<usize, (usize, Option<usize>)>

Returns the length of the iterator if one exists. +Otherwise return self.size_hint(). Read more
source§

impl<T, U> TryFrom<U> for Twhere + U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
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.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
\ No newline at end of file diff --git a/rust/sudachi/analysis/mlist/struct.MorphemeList.html b/rust/sudachi/analysis/mlist/struct.MorphemeList.html index 4fab6deb..048df2e0 100644 --- a/rust/sudachi/analysis/mlist/struct.MorphemeList.html +++ b/rust/sudachi/analysis/mlist/struct.MorphemeList.html @@ -1,38 +1,38 @@ -MorphemeList in sudachi::analysis::mlist - Rust
pub struct MorphemeList<T> { /* private fields */ }

Implementations§

source§

impl<T: DictionaryAccess> MorphemeList<T>

source

pub fn empty(dict: T) -> Self

Returns an empty morpheme list

+MorphemeList in sudachi::analysis::mlist - Rust
pub struct MorphemeList<T> { /* private fields */ }

Implementations§

source§

impl<T: DictionaryAccess> MorphemeList<T>

source

pub fn empty(dict: T) -> Self

Returns an empty morpheme list

source

pub fn from_components( dict: T, input: InputBuffer, - path: Vec<ResultNode>, + path: Vec<ResultNode>, subset: InfoSubset ) -> Self

Creates MorphemeList from components

source

pub fn collect_results<U: DictionaryAccess>( &mut self, analyzer: &mut StatefulTokenizer<U> -) -> SudachiResult<()>

source

pub fn split_into( +) -> SudachiResult<()>

source

pub fn split_into( &self, mode: Mode, - index: usize, - out: &mut Self -) -> SudachiResult<bool>

Splits morphemes and writes them into the resulting list + index: usize, + out: &mut Self +) -> SudachiResult<bool>

Splits morphemes and writes them into the resulting list The resulting list is not cleared before that Returns true if split produced more than two elements

source

pub fn clear(&mut self)

Clears morphemes from analysis result

-
source

pub fn len(&self) -> usize

source

pub fn is_empty(&self) -> bool

source

pub fn get(&self, idx: usize) -> Morpheme<'_, T>

source

pub fn surface(&self) -> Ref<'_, str>

source

pub fn iter(&self) -> MorphemeIter<'_, T>

source

pub fn get_internal_cost(&self) -> i32

Gets the whole cost of the path

-
source

pub fn dict(&self) -> &T

source

pub fn subset(&self) -> InfoSubset

source

pub fn copy_slice(&self, start: usize, end: usize, out: &mut Self)

source

pub fn lookup( +

source

pub fn len(&self) -> usize

source

pub fn is_empty(&self) -> bool

source

pub fn get(&self, idx: usize) -> Morpheme<'_, T>

source

pub fn surface(&self) -> Ref<'_, str>

source

pub fn iter(&self) -> MorphemeIter<'_, T>

source

pub fn get_internal_cost(&self) -> i32

Gets the whole cost of the path

+
source

pub fn dict(&self) -> &T

source

pub fn subset(&self) -> InfoSubset

source

pub fn copy_slice(&self, start: usize, end: usize, out: &mut Self)

source

pub fn lookup( &mut self, - query: &str, + query: &str, subset: InfoSubset -) -> SudachiResult<usize>

source§

impl<T: DictionaryAccess + Clone> MorphemeList<T>

source

pub fn empty_clone(&self) -> Self

source

pub fn split(&self, mode: Mode, index: usize) -> SudachiResult<MorphemeList<T>>

👎Deprecated since 0.6.1: use split_into

Returns a new morpheme list splitting the morpheme with a given mode. +) -> SudachiResult<usize>

source§

impl<T: DictionaryAccess + Clone> MorphemeList<T>

source

pub fn empty_clone(&self) -> Self

source

pub fn split(&self, mode: Mode, index: usize) -> SudachiResult<MorphemeList<T>>

👎Deprecated since 0.6.1: use split_into

Returns a new morpheme list splitting the morpheme with a given mode. Returns an empty list if there was no splits

-

Auto Trait Implementations§

§

impl<T> !RefUnwindSafe for MorphemeList<T>

§

impl<T> !Send for MorphemeList<T>

§

impl<T> !Sync for MorphemeList<T>

§

impl<T> Unpin for MorphemeList<T>where - T: Unpin,

§

impl<T> !UnwindSafe for MorphemeList<T>

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,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

source§

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

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

-
source§

impl<T, U> Into<U> for Twhere - U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

+

Auto Trait Implementations§

§

impl<T> !RefUnwindSafe for MorphemeList<T>

§

impl<T> !Send for MorphemeList<T>

§

impl<T> !Sync for MorphemeList<T>

§

impl<T> Unpin for MorphemeList<T>where + T: Unpin,

§

impl<T> !UnwindSafe for MorphemeList<T>

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,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

source§

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

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

+
source§

impl<T, U> Into<U> for Twhere + U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of -From<T> for U chooses to do.

-
source§

impl<T, U> TryFrom<U> for Twhere - U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
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.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
\ No newline at end of file +From<T> for U chooses to do.

+
source§

impl<T, U> TryFrom<U> for Twhere + U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
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.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
\ No newline at end of file diff --git a/rust/sudachi/analysis/morpheme/index.html b/rust/sudachi/analysis/morpheme/index.html index f2420911..3225e24b 100644 --- a/rust/sudachi/analysis/morpheme/index.html +++ b/rust/sudachi/analysis/morpheme/index.html @@ -1 +1 @@ -sudachi::analysis::morpheme - Rust

Module sudachi::analysis::morpheme

source ·

Structs

  • A morpheme (basic semantic unit of language)
\ No newline at end of file +sudachi::analysis::morpheme - Rust

Module sudachi::analysis::morpheme

source ·

Structs

  • A morpheme (basic semantic unit of language)
\ No newline at end of file diff --git a/rust/sudachi/analysis/morpheme/struct.Morpheme.html b/rust/sudachi/analysis/morpheme/struct.Morpheme.html index b47a6db6..2bc4a2c2 100644 --- a/rust/sudachi/analysis/morpheme/struct.Morpheme.html +++ b/rust/sudachi/analysis/morpheme/struct.Morpheme.html @@ -1,38 +1,38 @@ -Morpheme in sudachi::analysis::morpheme - Rust
pub struct Morpheme<'a, T> { /* private fields */ }
Expand description

A morpheme (basic semantic unit of language)

-

Implementations§

source§

impl<T: DictionaryAccess> Morpheme<'_, T>

source

pub fn part_of_speech(&self) -> &[String]

Returns the part of speech

-
source§

impl<T: DictionaryAccess + Clone> Morpheme<'_, T>

source

pub fn split(&self, mode: Mode) -> SudachiResult<MorphemeList<T>>

👎Deprecated since 0.6.1: use split_into

Returns new morpheme list splitting the morpheme with given mode.

-
source§

impl<'a, T: DictionaryAccess> Morpheme<'a, T>

source

pub fn begin(&self) -> usize

Returns the begin index in bytes of the morpheme in the original text

-
source

pub fn end(&self) -> usize

Returns the end index in bytes of the morpheme in the original text

-
source

pub fn begin_c(&self) -> usize

Returns the codepoint offset of the morpheme begin in the original text

-
source

pub fn end_c(&self) -> usize

Returns the codepoint offset of the morpheme begin in the original text

-
source

pub fn surface(&self) -> Ref<'_, str>

Returns a substring of the original text which corresponds to the morpheme

-
source

pub fn part_of_speech_id(&self) -> u16

source

pub fn dictionary_form(&self) -> &str

Returns the dictionary form of morpheme

+Morpheme in sudachi::analysis::morpheme - Rust
pub struct Morpheme<'a, T> { /* private fields */ }
Expand description

A morpheme (basic semantic unit of language)

+

Implementations§

source§

impl<T: DictionaryAccess> Morpheme<'_, T>

source

pub fn part_of_speech(&self) -> &[String]

Returns the part of speech

+
source§

impl<T: DictionaryAccess + Clone> Morpheme<'_, T>

source

pub fn split(&self, mode: Mode) -> SudachiResult<MorphemeList<T>>

👎Deprecated since 0.6.1: use split_into

Returns new morpheme list splitting the morpheme with given mode.

+
source§

impl<'a, T: DictionaryAccess> Morpheme<'a, T>

source

pub fn begin(&self) -> usize

Returns the begin index in bytes of the morpheme in the original text

+
source

pub fn end(&self) -> usize

Returns the end index in bytes of the morpheme in the original text

+
source

pub fn begin_c(&self) -> usize

Returns the codepoint offset of the morpheme begin in the original text

+
source

pub fn end_c(&self) -> usize

Returns the codepoint offset of the morpheme begin in the original text

+
source

pub fn surface(&self) -> Ref<'_, str>

Returns a substring of the original text which corresponds to the morpheme

+
source

pub fn part_of_speech_id(&self) -> u16

source

pub fn dictionary_form(&self) -> &str

Returns the dictionary form of morpheme

“Dictionary form” means a word’s lemma and “終止形” in Japanese.

-
source

pub fn normalized_form(&self) -> &str

Returns the normalized form of morpheme

+
source

pub fn normalized_form(&self) -> &str

Returns the normalized form of morpheme

This method returns the form normalizing inconsistent spellings and inflected forms

-
source

pub fn reading_form(&self) -> &str

Returns the reading form of morpheme.

+
source

pub fn reading_form(&self) -> &str

Returns the reading form of morpheme.

Returns Japanese syllabaries ‘フリガナ’ in katakana.

-
source

pub fn is_oov(&self) -> bool

Returns if this morpheme is out of vocabulary

+
source

pub fn is_oov(&self) -> bool

Returns if this morpheme is out of vocabulary

source

pub fn word_id(&self) -> WordId

Returns the word id of morpheme

-
source

pub fn dictionary_id(&self) -> i32

Returns the dictionary id where the morpheme belongs

+
source

pub fn dictionary_id(&self) -> i32

Returns the dictionary id where the morpheme belongs

Returns -1 if the morpheme is oov

-
source

pub fn synonym_group_ids(&self) -> &[u32]

source

pub fn get_word_info(&self) -> &WordInfo

source

pub fn index(&self) -> usize

Returns the index of this morpheme

+
source

pub fn synonym_group_ids(&self) -> &[u32]

source

pub fn get_word_info(&self) -> &WordInfo

source

pub fn index(&self) -> usize

Returns the index of this morpheme

source

pub fn split_into( &self, mode: Mode, out: &mut MorphemeList<T> -) -> SudachiResult<bool>

Splits morpheme and writes sub-morphemes into the provided list. +) -> SudachiResult<bool>

Splits morpheme and writes sub-morphemes into the provided list. The resulting list is not cleared before that. Returns true if split has produced any elements.

-
source

pub fn total_cost(&self) -> i32

Returns total cost from the beginning of the path

-

Trait Implementations§

source§

impl<T: DictionaryAccess> Debug for Morpheme<'_, T>

source§

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

Formats the value using the given formatter. Read more

Auto Trait Implementations§

§

impl<'a, T> !RefUnwindSafe for Morpheme<'a, T>

§

impl<'a, T> !Send for Morpheme<'a, T>

§

impl<'a, T> !Sync for Morpheme<'a, T>

§

impl<'a, T> Unpin for Morpheme<'a, T>

§

impl<'a, T> !UnwindSafe for Morpheme<'a, T>

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,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

source§

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

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

-
source§

impl<T, U> Into<U> for Twhere - U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

+
source

pub fn total_cost(&self) -> i32

Returns total cost from the beginning of the path

+

Trait Implementations§

source§

impl<T: DictionaryAccess> Debug for Morpheme<'_, T>

source§

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

Formats the value using the given formatter. Read more

Auto Trait Implementations§

§

impl<'a, T> !RefUnwindSafe for Morpheme<'a, T>

§

impl<'a, T> !Send for Morpheme<'a, T>

§

impl<'a, T> !Sync for Morpheme<'a, T>

§

impl<'a, T> Unpin for Morpheme<'a, T>

§

impl<'a, T> !UnwindSafe for Morpheme<'a, T>

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,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

source§

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

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

+
source§

impl<T, U> Into<U> for Twhere + U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of -From<T> for U chooses to do.

-
source§

impl<T, U> TryFrom<U> for Twhere - U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
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.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
\ No newline at end of file +From<T> for U chooses to do.

+
source§

impl<T, U> TryFrom<U> for Twhere + U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
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.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
\ No newline at end of file diff --git a/rust/sudachi/analysis/node/fn.concat_nodes.html b/rust/sudachi/analysis/node/fn.concat_nodes.html index 88f70891..af17c4a9 100644 --- a/rust/sudachi/analysis/node/fn.concat_nodes.html +++ b/rust/sudachi/analysis/node/fn.concat_nodes.html @@ -1,7 +1,7 @@ -concat_nodes in sudachi::analysis::node - Rust
pub fn concat_nodes(
-    path: Vec<ResultNode>,
-    begin: usize,
-    end: usize,
-    normalized_form: Option<String>
-) -> SudachiResult<Vec<ResultNode>>
Expand description

Concatenate the nodes in the range and replace normalized_form if given.

+concat_nodes in sudachi::analysis::node - Rust
pub fn concat_nodes(
+    path: Vec<ResultNode>,
+    begin: usize,
+    end: usize,
+    normalized_form: Option<String>
+) -> SudachiResult<Vec<ResultNode>>
Expand description

Concatenate the nodes in the range and replace normalized_form if given.

\ No newline at end of file diff --git a/rust/sudachi/analysis/node/fn.concat_oov_nodes.html b/rust/sudachi/analysis/node/fn.concat_oov_nodes.html index 6a2de6d0..6fe9c364 100644 --- a/rust/sudachi/analysis/node/fn.concat_oov_nodes.html +++ b/rust/sudachi/analysis/node/fn.concat_oov_nodes.html @@ -1,7 +1,7 @@ -concat_oov_nodes in sudachi::analysis::node - Rust
pub fn concat_oov_nodes(
-    path: Vec<ResultNode>,
-    begin: usize,
-    end: usize,
-    pos_id: u16
-) -> SudachiResult<Vec<ResultNode>>
Expand description

Concatenate the nodes in the range and set pos_id.

+concat_oov_nodes in sudachi::analysis::node - Rust
pub fn concat_oov_nodes(
+    path: Vec<ResultNode>,
+    begin: usize,
+    end: usize,
+    pos_id: u16
+) -> SudachiResult<Vec<ResultNode>>
Expand description

Concatenate the nodes in the range and set pos_id.

\ No newline at end of file diff --git a/rust/sudachi/analysis/node/index.html b/rust/sudachi/analysis/node/index.html index 085287db..1502cc3e 100644 --- a/rust/sudachi/analysis/node/index.html +++ b/rust/sudachi/analysis/node/index.html @@ -1,3 +1,3 @@ -sudachi::analysis::node - Rust

Module sudachi::analysis::node

source ·

Structs

1.0.0 · source§

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

Searches for an element in an iterator, returning its index. Read more
1.6.0 · source§

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item>where + B: Ord, + Self: Sized, + F: FnMut(&Self::Item) -> B,

Returns the element that gives the maximum value from the +specified function. Read more
1.15.0 · source§

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

Returns the element that gives the maximum value with respect to the +specified comparison function. Read more
1.6.0 · source§

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item>where + B: Ord, + Self: Sized, + F: FnMut(&Self::Item) -> B,

Returns the element that gives the minimum value from the +specified function. Read more
1.15.0 · source§

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

Returns the element that gives the minimum value with respect to the +specified comparison function. Read more
1.0.0 · source§

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB)where + FromA: Default + Extend<A>, + FromB: Default + Extend<B>, + Self: Sized + Iterator<Item = (A, B)>,

Converts an iterator of pairs into a pair of containers. Read more
1.36.0 · source§

fn copied<'a, T>(self) -> Copied<Self>where + T: 'a + Copy, + Self: Sized + Iterator<Item = &'a T>,

Creates an iterator which copies all of its elements. Read more
1.0.0 · source§

fn cloned<'a, T>(self) -> Cloned<Self>where + T: 'a + Clone, + Self: Sized + Iterator<Item = &'a T>,

Creates an iterator which clones all of its elements. Read more
source§

fn array_chunks<const N: usize>(self) -> ArrayChunks<Self, N>where + Self: Sized,

🔬This is a nightly-only experimental API. (iter_array_chunks)
Returns an iterator over N elements of the iterator at a time. Read more
1.11.0 · source§

fn sum<S>(self) -> Swhere + Self: Sized, + S: Sum<Self::Item>,

Sums the elements of an iterator. Read more
1.11.0 · source§

fn product<P>(self) -> Pwhere + Self: Sized, + P: Product<Self::Item>,

Iterates over the entire iterator, multiplying all the elements Read more
source§

fn cmp_by<I, F>(self, other: I, cmp: F) -> Orderingwhere + Self: Sized, + I: IntoIterator, + F: FnMut(Self::Item, <I as IntoIterator>::Item) -> Ordering,

🔬This is a nightly-only experimental API. (iter_order_by)
Lexicographically compares the elements of this Iterator with those +of another with respect to the specified comparison function. Read more
1.5.0 · source§

fn partial_cmp<I>(self, other: I) -> Option<Ordering>where + I: IntoIterator, + Self::Item: PartialOrd<<I as IntoIterator>::Item>, + Self: Sized,

Lexicographically compares the PartialOrd elements of +this Iterator with those of another. The comparison works like short-circuit evaluation, returning a result without comparing the remaining elements. -As soon as an order can be determined, the evaluation stops and a result is returned. Read more
source§

fn partial_cmp_by<I, F>(self, other: I, partial_cmp: F) -> Option<Ordering>where - Self: Sized, - I: IntoIterator, - F: FnMut(Self::Item, <I as IntoIterator>::Item) -> Option<Ordering>,

🔬This is a nightly-only experimental API. (iter_order_by)
Lexicographically compares the elements of this Iterator with those -of another with respect to the specified comparison function. Read more
1.5.0 · source§

fn eq<I>(self, other: I) -> boolwhere - I: IntoIterator, - Self::Item: PartialEq<<I as IntoIterator>::Item>, - Self: Sized,

Determines if the elements of this Iterator are equal to those of -another. Read more
source§

fn eq_by<I, F>(self, other: I, eq: F) -> boolwhere - Self: Sized, - I: IntoIterator, - F: FnMut(Self::Item, <I as IntoIterator>::Item) -> bool,

🔬This is a nightly-only experimental API. (iter_order_by)
Determines if the elements of this Iterator are equal to those of -another with respect to the specified equality function. Read more
1.5.0 · source§

fn ne<I>(self, other: I) -> boolwhere - I: IntoIterator, - Self::Item: PartialEq<<I as IntoIterator>::Item>, - Self: Sized,

Determines if the elements of this Iterator are not equal to those of -another. Read more
1.5.0 · source§

fn lt<I>(self, other: I) -> boolwhere - I: IntoIterator, - Self::Item: PartialOrd<<I as IntoIterator>::Item>, - Self: Sized,

Determines if the elements of this Iterator are lexicographically -less than those of another. Read more
1.5.0 · source§

fn le<I>(self, other: I) -> boolwhere - I: IntoIterator, - Self::Item: PartialOrd<<I as IntoIterator>::Item>, - Self: Sized,

Determines if the elements of this Iterator are lexicographically -less or equal to those of another. Read more
1.5.0 · source§

fn gt<I>(self, other: I) -> boolwhere - I: IntoIterator, - Self::Item: PartialOrd<<I as IntoIterator>::Item>, - Self: Sized,

Determines if the elements of this Iterator are lexicographically -greater than those of another. Read more
1.5.0 · source§

fn ge<I>(self, other: I) -> boolwhere - I: IntoIterator, - Self::Item: PartialOrd<<I as IntoIterator>::Item>, - Self: Sized,

Determines if the elements of this Iterator are lexicographically -greater than or equal to those of another. Read more
source§

fn is_sorted_by<F>(self, compare: F) -> boolwhere - Self: Sized, - F: FnMut(&Self::Item, &Self::Item) -> Option<Ordering>,

🔬This is a nightly-only experimental API. (is_sorted)
Checks if the elements of this iterator are sorted using the given comparator function. Read more
source§

fn is_sorted_by_key<F, K>(self, f: F) -> boolwhere - Self: Sized, - F: FnMut(Self::Item) -> K, - K: PartialOrd<K>,

🔬This is a nightly-only experimental API. (is_sorted)
Checks if the elements of this iterator are sorted using the given key extraction -function. Read more
source§

impl FusedIterator for NodeSplitIterator<'_>

Auto Trait Implementations§

§

impl<'a> RefUnwindSafe for NodeSplitIterator<'a>

§

impl<'a> Send for NodeSplitIterator<'a>

§

impl<'a> Sync for NodeSplitIterator<'a>

§

impl<'a> Unpin for NodeSplitIterator<'a>

§

impl<'a> UnwindSafe for NodeSplitIterator<'a>

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,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

source§

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

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

-
source§

impl<T, U> Into<U> for Twhere - U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

+As soon as an order can be determined, the evaluation stops and a result is returned. Read more
source§

fn partial_cmp_by<I, F>(self, other: I, partial_cmp: F) -> Option<Ordering>where + Self: Sized, + I: IntoIterator, + F: FnMut(Self::Item, <I as IntoIterator>::Item) -> Option<Ordering>,

🔬This is a nightly-only experimental API. (iter_order_by)
Lexicographically compares the elements of this Iterator with those +of another with respect to the specified comparison function. Read more
1.5.0 · source§

fn eq<I>(self, other: I) -> boolwhere + I: IntoIterator, + Self::Item: PartialEq<<I as IntoIterator>::Item>, + Self: Sized,

Determines if the elements of this Iterator are equal to those of +another. Read more
source§

fn eq_by<I, F>(self, other: I, eq: F) -> boolwhere + Self: Sized, + I: IntoIterator, + F: FnMut(Self::Item, <I as IntoIterator>::Item) -> bool,

🔬This is a nightly-only experimental API. (iter_order_by)
Determines if the elements of this Iterator are equal to those of +another with respect to the specified equality function. Read more
1.5.0 · source§

fn ne<I>(self, other: I) -> boolwhere + I: IntoIterator, + Self::Item: PartialEq<<I as IntoIterator>::Item>, + Self: Sized,

Determines if the elements of this Iterator are not equal to those of +another. Read more
1.5.0 · source§

fn lt<I>(self, other: I) -> boolwhere + I: IntoIterator, + Self::Item: PartialOrd<<I as IntoIterator>::Item>, + Self: Sized,

Determines if the elements of this Iterator are lexicographically +less than those of another. Read more
1.5.0 · source§

fn le<I>(self, other: I) -> boolwhere + I: IntoIterator, + Self::Item: PartialOrd<<I as IntoIterator>::Item>, + Self: Sized,

Determines if the elements of this Iterator are lexicographically +less or equal to those of another. Read more
1.5.0 · source§

fn gt<I>(self, other: I) -> boolwhere + I: IntoIterator, + Self::Item: PartialOrd<<I as IntoIterator>::Item>, + Self: Sized,

Determines if the elements of this Iterator are lexicographically +greater than those of another. Read more
1.5.0 · source§

fn ge<I>(self, other: I) -> boolwhere + I: IntoIterator, + Self::Item: PartialOrd<<I as IntoIterator>::Item>, + Self: Sized,

Determines if the elements of this Iterator are lexicographically +greater than or equal to those of another. Read more
source§

fn is_sorted_by<F>(self, compare: F) -> boolwhere + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> Option<Ordering>,

🔬This is a nightly-only experimental API. (is_sorted)
Checks if the elements of this iterator are sorted using the given comparator function. Read more
source§

fn is_sorted_by_key<F, K>(self, f: F) -> boolwhere + Self: Sized, + F: FnMut(Self::Item) -> K, + K: PartialOrd,

🔬This is a nightly-only experimental API. (is_sorted)
Checks if the elements of this iterator are sorted using the given key extraction +function. Read more
source§

impl FusedIterator for NodeSplitIterator<'_>

Auto Trait Implementations§

§

impl<'a> RefUnwindSafe for NodeSplitIterator<'a>

§

impl<'a> Send for NodeSplitIterator<'a>

§

impl<'a> Sync for NodeSplitIterator<'a>

§

impl<'a> Unpin for NodeSplitIterator<'a>

§

impl<'a> UnwindSafe for NodeSplitIterator<'a>

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,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

source§

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

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

+
source§

impl<T, U> Into<U> for Twhere + U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of -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>( +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>( 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>( +) -> 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, 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 +) -> 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( self, - element: Self::Item -) -> IntersperseWith<Self, IntersperseElementSimple<Self::Item>>where - Self: Sized, - Self::Item: Clone,

An iterator adaptor to insert a particular value + 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 - Self: Sized, - F: FnMut() -> Self::Item,

An iterator adaptor to insert a particular value created by a function + 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>( 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 - J: IntoIterator, - Self: Sized,

Create an iterator which iterates over both this and the specified +) -> 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 + 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 - F: FnMut(&mut Self) -> Option<B>, - Self: Sized,

A “meta iterator adaptor”. Its closure receives a reference to the + 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 - Self: Sized, - F: FnMut(&Self::Item) -> K, - K: PartialEq<K>,

Return an iterable that can group iterator elements. + Self: Sized, + F: FnMut(&Self::Item) -> K, + K: PartialEq,
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 - Self: Sized + Iterator<Item = <T as TupleCollect>::Item>, +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 + <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 - 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 + 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 - Self: Sized + Iterator<Item = <T as TupleCollect>::Item>, + 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 - 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 - Self: Sized,

👎Deprecated since 0.8.0: Use std .step_by() instead
Return an iterator adaptor that steps n elements in the base iterator + 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 + 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 - 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: 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, 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
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 + Self: Iterator<Item = Result<T, E>> + Sized, + F: FnMut(T) -> U,
👎Deprecated since 0.10.0: Use .map_ok() instead
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 - Self: Iterator<Item = Result<T, E>> + Sized, - F: FnMut(&T) -> bool,

Return an iterator adaptor that filters every Result::Ok + 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 - Self: Iterator<Item = Result<T, E>> + Sized, - F: FnMut(T) -> Option<U>,

Return an iterator adaptor that filters and transforms every + 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 - 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 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 + 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 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 - Self: Sized, - Self::Item: PartialOrd<Self::Item>, - J: IntoIterator<Item = Self::Item>,

Return an iterator adaptor that merges the two base iterators in +) -> MergeBy<Self, <J as IntoIterator>::IntoIter, MergeLte>where + Self: Sized, + Self::Item: PartialOrd, + 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>( self, other: J, is_first: F -) -> MergeBy<Self, <J as IntoIterator>::IntoIter, F>where - Self: 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. +) -> MergeBy<Self, <J as IntoIterator>::IntoIter, F>where + Self: 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, T>( self, other: J, cmp_fn: F -) -> MergeBy<Self, <J as IntoIterator>::IntoIter, MergeFuncLR<F, <F as FuncLR<Self::Item, <<J as IntoIterator>::IntoIter as Iterator>::Item>>::T>>where - J: IntoIterator, - F: FnMut(&Self::Item, &<J as IntoIterator>::Item) -> T, - 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 - 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 +) -> MergeBy<Self, <J as IntoIterator>::IntoIter, MergeFuncLR<F, <F as FuncLR<Self::Item, <<J as IntoIterator>::IntoIter as Iterator>::Item>>::T>>where + J: IntoIterator, + F: FnMut(&Self::Item, &<J as IntoIterator>::Item) -> T, + 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 + Self: Sized, + Self::Item: IntoIterator, + <Self::Item as IntoIterator>::Item: PartialOrd,

Return an iterator adaptor that flattens an iterator of iterators by 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 +) -> 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>( self, other: J -) -> Product<Self, <J as IntoIterator>::IntoIter>where - Self: Sized, - Self::Item: Clone, - J: IntoIterator, - <J as IntoIterator>::IntoIter: Clone,

Return an iterator adaptor that iterates over the cartesian product of +) -> Product<Self, <J as IntoIterator>::IntoIter>where + Self: Sized, + Self::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( 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 - 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 - Self: Sized, - Self::Item: PartialEq<Self::Item>,

Remove duplicates from sections of consecutive identical elements. +) -> 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 + 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 + Self: Sized, + Self::Item: PartialEq,

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>( 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, +) -> 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( self -) -> CoalesceBy<Self, DedupPredWithCount2CoalescePred<DedupEq>, (usize, Self::Item)>where - Self: Sized,

Remove duplicates from sections of consecutive identical elements, while keeping a count of +) -> 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>( self, cmp: Cmp -) -> CoalesceBy<Self, DedupPredWithCount2CoalescePred<Cmp>, (usize, Self::Item)>where - Self: Sized, - Cmp: FnMut(&Self::Item, &Self::Item) -> bool,

Remove duplicates from sections of consecutive identical elements, while keeping a count of +) -> CoalesceBy<Self, DedupPredWithCount2CoalescePred<Cmp>, (usize, Self::Item)>where + Self: Sized, + Cmp: 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 - Self: Sized, - Self::Item: Eq + Hash,

Return an iterator adaptor that produces elements that appear more than once during the +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 - Self: Sized, - V: Eq + Hash, - F: FnMut(&Self::Item) -> V,

Return an iterator adaptor that produces elements that appear more than once during the + 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 - Self: Sized, - Self::Item: Clone + Eq + Hash,

Return an iterator adaptor that filters out elements that have + 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 - Self: Sized, - V: Eq + Hash, - F: FnMut(&Self::Item) -> V,

Return an iterator adaptor that filters out elements that have + 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 - Self: Sized + PeekingNext, - F: FnMut(&Self::Item) -> bool,

Return an iterator adaptor that borrows from this iterator and + 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 - Self: Clone, - F: FnMut(&Self::Item) -> bool,

Return an iterator adaptor that borrows from a Clone-able iterator + 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 take_while_inclusive<F>(self, accept: F) -> TakeWhileInclusive<Self, F>where - Self: Sized, - F: FnMut(&Self::Item) -> bool,

Returns an iterator adaptor that consumes elements while the given + 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 + 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 - Self: Sized + Clone, - Self::Item: Clone, + 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 - Self: Sized, - Self::Item: Clone,

Return an iterator adaptor that iterates over the k-length combinations of +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( self, - k: usize + 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 - Self: Sized, - Self::Item: Clone,

Return an iterator adaptor that iterates over all k-permutations of the + 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 + 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 - 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 - Self: Sized, - F: FnMut(usize) -> Self::Item,

Return an iterator adaptor that pads the sequence to a minimum length of + 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 + 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 combines each element with a Position to + 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 + 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 - 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 - Self: Sized + Iterator<Item = <T as TupleCollect>::Item>, + 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 + 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 - Self: Sized + Iterator<Item = <T as TupleCollect>::Item>, +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 - 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 - 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 - 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 - Self: Sized, - Self::Item: PartialEq<Self::Item>,

Check whether all elements compare equal. Read more
source§

fn all_equal_value( +(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 + 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 + Self: Sized, + Self::Item: Borrow<Q>, + Q: PartialEq,

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,

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: PartialEq<Self::Item>,

If there are elements and they are all equal, return a single copy of that element. +) -> Result<Self::Item, Option<(Self::Item, Self::Item)>>where + Self: Sized, + Self::Item: PartialEq,
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 - Self: Sized + DoubleEndedIterator,

Consume the last n elements from the iterator eagerly, +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 + 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 - 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, - 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 - 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 + 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, + 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>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 + 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 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 - 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 - Self: Iterator<Item = Result<A, E>>, - F: FnMut(B, A) -> B,

👎Deprecated since 0.10.0: Use .fold_ok() instead
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 - 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(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 - 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, - 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 - 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 - 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: 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 - 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 - 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: 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 - 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 - 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 - 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: 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 - 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 - 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>( - 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 + 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 + 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 + Self: Iterator<Item = Result<A, E>>, + F: FnMut(B, A) -> B,

👎Deprecated since 0.10.0: Use .fold_ok() instead
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 + 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(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 + 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, + 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 + 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>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>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>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>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>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>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>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>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: 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 + 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>>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>(self, f: F) -> HashMap<K, Vec<V>>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 - Self: Iterator<Item = (K, V)> + Sized, - K: Hash + Eq,

Constructs a GroupingMap to be used later with one of the efficient + 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>( 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 - 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: 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 - 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 - 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: 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 - Self: Sized, - K: Ord, - 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: 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 - 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 - 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: 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 - 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 - 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: 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 - 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 - 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 - 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 - 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 - Self: Sized,

If the iterator yields exactly one element, that element will be returned, otherwise + 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>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>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>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>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>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>where + Self: Sized, + K: Ord, + 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,

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, + 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 + 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 + 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: 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 + 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 + 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: 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 + 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 + Self: Sized, + Self::Item: PartialOrd,

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 + Self: Sized, + K: PartialOrd, + 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 + 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 + 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 - Self: Sized,

If the iterator yields no elements, Ok(None) will be returned. If the iterator yields +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 - 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 - Self: Sized, - Self::Item: Eq + Hash,

Collect the items in this iterator and return a HashMap which + 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>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 - Self: Sized, - K: Eq + Hash, - F: FnMut(Self::Item) -> K,

Collect the items in this iterator and return a HashMap which +of times it appears. Read more
source§

fn counts_by<K, F>(self, f: F) -> HashMap<K, usize>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 - Self: Sized + MultiUnzip<FromI>,

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

fn try_len(&self) -> Result<usize, (usize, Option<usize>)>

Returns the length of the iterator if one exists. -Otherwise return self.size_hint(). Read more
source§

impl<T, U> TryFrom<U> for Twhere - U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
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.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
\ No newline at end of file + Self: Sized + MultiUnzip<FromI>,
Converts an iterator of tuples into a tuple of containers. Read more
source§

fn try_len(&self) -> Result<usize, (usize, Option<usize>)>

Returns the length of the iterator if one exists. +Otherwise return self.size_hint(). Read more
source§

impl<T, U> TryFrom<U> for Twhere + U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
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.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
\ No newline at end of file diff --git a/rust/sudachi/analysis/node/struct.ResultNode.html b/rust/sudachi/analysis/node/struct.ResultNode.html index dd472c2c..be601731 100644 --- a/rust/sudachi/analysis/node/struct.ResultNode.html +++ b/rust/sudachi/analysis/node/struct.ResultNode.html @@ -1,16 +1,16 @@ -ResultNode in sudachi::analysis::node - Rust
pub struct ResultNode { /* private fields */ }
Expand description

Full lattice node, as the result of analysis. +ResultNode in sudachi::analysis::node - Rust

pub struct ResultNode { /* private fields */ }
Expand description

Full lattice node, as the result of analysis. All indices (including inner) are in the modified sentence space Indices are converted to original sentence space when user request them.

Implementations§

source§

impl ResultNode

source

pub fn new( inner: Node, - total_cost: i32, - begin_bytes: u16, - end_bytes: u16, + total_cost: i32, + begin_bytes: u16, + end_bytes: u16, word_info: WordInfo -) -> ResultNode

source§

impl ResultNode

source

pub fn word_info(&self) -> &WordInfo

source

pub fn begin_bytes(&self) -> usize

Returns begin offset in bytes of node surface in a sentence

-
source

pub fn end_bytes(&self) -> usize

Returns end offset in bytes of node surface in a sentence

-
source

pub fn bytes_range(&self) -> Range<usize>

Returns range in bytes (for easy string slicing)

-
source

pub fn set_bytes_range(&mut self, begin: u16, end: u16)

source

pub fn set_char_range(&mut self, begin: u16, end: u16)

source

pub fn num_splits(&self, mode: Mode) -> usize

Returns number of splits in a specified mode

+) -> ResultNode
source§

impl ResultNode

source

pub fn word_info(&self) -> &WordInfo

source

pub fn begin_bytes(&self) -> usize

Returns begin offset in bytes of node surface in a sentence

+
source

pub fn end_bytes(&self) -> usize

Returns end offset in bytes of node surface in a sentence

+
source

pub fn bytes_range(&self) -> Range<usize>

Returns range in bytes (for easy string slicing)

+
source

pub fn set_bytes_range(&mut self, begin: u16, end: u16)

source

pub fn set_char_range(&mut self, begin: u16, end: u16)

source

pub fn num_splits(&self, mode: Mode) -> usize

Returns number of splits in a specified mode

source

pub fn split<'a>( &'a self, mode: Mode, @@ -18,18 +18,18 @@ subset: InfoSubset, text: &'a InputBuffer ) -> NodeSplitIterator<'a>

Split the node with a specified mode using the dictionary data

-

Trait Implementations§

source§

impl Clone for ResultNode

source§

fn clone(&self) -> ResultNode

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 Display for ResultNode

source§

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

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

impl LatticeNode for ResultNode

source§

fn begin(&self) -> usize

source§

fn end(&self) -> usize

source§

fn cost(&self) -> i16

source§

fn word_id(&self) -> WordId

source§

fn left_id(&self) -> u16

source§

fn is_oov(&self) -> bool

Is true when the word does not come from the dictionary. -BOS and EOS are also treated as OOV.
source§

fn is_special_node(&self) -> bool

If a node is a special system node like BOS or EOS. -Java name isSystem (which is similar to a regular node coming from the system dictionary)
source§

fn num_codepts(&self) -> usize

Returns number of codepoints in the current node
source§

fn char_range(&self) -> Range<usize>

Utility method for extracting [begin, end) codepoint range.
source§

impl PathCost for ResultNode

source§

impl RightId for ResultNode

source§

fn right_id(&self) -> u16

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,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

source§

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

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

-
source§

impl<T, U> Into<U> for Twhere - U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

+

Trait Implementations§

source§

impl Clone for ResultNode

source§

fn clone(&self) -> ResultNode

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 Display for ResultNode

source§

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

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

impl LatticeNode for ResultNode

source§

fn begin(&self) -> usize

source§

fn end(&self) -> usize

source§

fn cost(&self) -> i16

source§

fn word_id(&self) -> WordId

source§

fn left_id(&self) -> u16

source§

fn is_oov(&self) -> bool

Is true when the word does not come from the dictionary. +BOS and EOS are also treated as OOV.
source§

fn is_special_node(&self) -> bool

If a node is a special system node like BOS or EOS. +Java name isSystem (which is similar to a regular node coming from the system dictionary)
source§

fn num_codepts(&self) -> usize

Returns number of codepoints in the current node
source§

fn char_range(&self) -> Range<usize>

Utility method for extracting [begin, end) codepoint range.
source§

impl PathCost for ResultNode

source§

impl RightId for ResultNode

source§

fn right_id(&self) -> u16

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,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

source§

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

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

+
source§

impl<T, U> Into<U> for Twhere + U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of -From<T> for U chooses to do.

-
source§

impl<T> ToOwned for Twhere - T: Clone,

§

type Owned = T

The resulting type after obtaining ownership.
source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
source§

impl<T> ToString for Twhere - T: Display + ?Sized,

source§

default fn to_string(&self) -> String

Converts the given value to a String. Read more
source§

impl<T, U> TryFrom<U> for Twhere - U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
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.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
\ No newline at end of file +From<T> for U chooses to do.

+
source§

impl<T> ToOwned for Twhere + T: Clone,

§

type Owned = T

The resulting type after obtaining ownership.
source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
source§

impl<T> ToString for Twhere + T: Display + ?Sized,

source§

default fn to_string(&self) -> String

Converts the given value to a String. Read more
source§

impl<T, U> TryFrom<U> for Twhere + U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
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.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
\ No newline at end of file diff --git a/rust/sudachi/analysis/node/trait.LatticeNode.html b/rust/sudachi/analysis/node/trait.LatticeNode.html index 861e0816..5b478dd5 100644 --- a/rust/sudachi/analysis/node/trait.LatticeNode.html +++ b/rust/sudachi/analysis/node/trait.LatticeNode.html @@ -1,20 +1,20 @@ -LatticeNode in sudachi::analysis::node - Rust
pub trait LatticeNode: RightId {
+LatticeNode in sudachi::analysis::node - Rust
pub trait LatticeNode: RightId {
     // Required methods
-    fn begin(&self) -> usize;
-    fn end(&self) -> usize;
-    fn cost(&self) -> i16;
+    fn begin(&self) -> usize;
+    fn end(&self) -> usize;
+    fn cost(&self) -> i16;
     fn word_id(&self) -> WordId;
-    fn left_id(&self) -> u16;
+    fn left_id(&self) -> u16;
 
     // Provided methods
-    fn is_oov(&self) -> bool { ... }
-    fn is_special_node(&self) -> bool { ... }
-    fn num_codepts(&self) -> usize { ... }
-    fn char_range(&self) -> Range<usize> { ... }
-}

Required Methods§

source

fn begin(&self) -> usize

source

fn end(&self) -> usize

source

fn cost(&self) -> i16

source

fn word_id(&self) -> WordId

source

fn left_id(&self) -> u16

Provided Methods§

source

fn is_oov(&self) -> bool

Is true when the word does not come from the dictionary. + fn is_oov(&self) -> bool { ... } + fn is_special_node(&self) -> bool { ... } + fn num_codepts(&self) -> usize { ... } + fn char_range(&self) -> Range<usize> { ... } +}

Required Methods§

source

fn begin(&self) -> usize

source

fn end(&self) -> usize

source

fn cost(&self) -> i16

source

fn word_id(&self) -> WordId

source

fn left_id(&self) -> u16

Provided Methods§

source

fn is_oov(&self) -> bool

Is true when the word does not come from the dictionary. BOS and EOS are also treated as OOV.

-
source

fn is_special_node(&self) -> bool

If a node is a special system node like BOS or EOS. +

source

fn is_special_node(&self) -> bool

If a node is a special system node like BOS or EOS. Java name isSystem (which is similar to a regular node coming from the system dictionary)

-
source

fn num_codepts(&self) -> usize

Returns number of codepoints in the current node

-
source

fn char_range(&self) -> Range<usize>

Utility method for extracting [begin, end) codepoint range.

-

Implementors§

\ No newline at end of file +
source

fn num_codepts(&self) -> usize

Returns number of codepoints in the current node

+
source

fn char_range(&self) -> Range<usize>

Utility method for extracting [begin, end) codepoint range.

+

Implementors§

\ No newline at end of file diff --git a/rust/sudachi/analysis/node/trait.PathCost.html b/rust/sudachi/analysis/node/trait.PathCost.html index 5a90ec2e..af84e7bb 100644 --- a/rust/sudachi/analysis/node/trait.PathCost.html +++ b/rust/sudachi/analysis/node/trait.PathCost.html @@ -1,8 +1,8 @@ -PathCost in sudachi::analysis::node - Rust
pub trait PathCost {
+PathCost in sudachi::analysis::node - Rust
pub trait PathCost {
     // Required method
-    fn total_cost(&self) -> i32;
+    fn total_cost(&self) -> i32;
 
     // Provided method
-    fn is_connected_to_bos(&self) -> bool { ... }
+    fn is_connected_to_bos(&self) -> bool { ... }
 }
Expand description

Accessor trait for the full path cost

-

Required Methods§

source

fn total_cost(&self) -> i32

Provided Methods§

Implementors§

\ No newline at end of file +

Required Methods§

source

fn total_cost(&self) -> i32

Provided Methods§

Implementors§

\ No newline at end of file diff --git a/rust/sudachi/analysis/node/trait.RightId.html b/rust/sudachi/analysis/node/trait.RightId.html index e7d23e49..0008e774 100644 --- a/rust/sudachi/analysis/node/trait.RightId.html +++ b/rust/sudachi/analysis/node/trait.RightId.html @@ -1,5 +1,5 @@ -RightId in sudachi::analysis::node - Rust
pub trait RightId {
+RightId in sudachi::analysis::node - Rust
pub trait RightId {
     // Required method
-    fn right_id(&self) -> u16;
+    fn right_id(&self) -> u16;
 }
Expand description

Accessor trait for right connection id

-

Required Methods§

source

fn right_id(&self) -> u16

Implementors§

\ No newline at end of file +

Required Methods§

source

fn right_id(&self) -> u16

Implementors§

\ No newline at end of file diff --git a/rust/sudachi/analysis/stateful_tokenizer/index.html b/rust/sudachi/analysis/stateful_tokenizer/index.html index 918a8ecb..a276eaba 100644 --- a/rust/sudachi/analysis/stateful_tokenizer/index.html +++ b/rust/sudachi/analysis/stateful_tokenizer/index.html @@ -1 +1 @@ -sudachi::analysis::stateful_tokenizer - Rust
\ No newline at end of file +sudachi::analysis::stateful_tokenizer - Rust
\ No newline at end of file diff --git a/rust/sudachi/analysis/stateful_tokenizer/struct.StatefulTokenizer.html b/rust/sudachi/analysis/stateful_tokenizer/struct.StatefulTokenizer.html index fc0098e2..3df55e5e 100644 --- a/rust/sudachi/analysis/stateful_tokenizer/struct.StatefulTokenizer.html +++ b/rust/sudachi/analysis/stateful_tokenizer/struct.StatefulTokenizer.html @@ -1,34 +1,34 @@ -StatefulTokenizer in sudachi::analysis::stateful_tokenizer - Rust
pub struct StatefulTokenizer<D> { /* private fields */ }

Implementations§

source§

impl<D: DictionaryAccess + Clone> StatefulTokenizer<D>

source

pub fn dict_clone(&self) -> D

Get a clone of current dictionary

+StatefulTokenizer in sudachi::analysis::stateful_tokenizer - Rust
pub struct StatefulTokenizer<D> { /* private fields */ }

Implementations§

source§

impl<D: DictionaryAccess + Clone> StatefulTokenizer<D>

source

pub fn dict_clone(&self) -> D

Get a clone of current dictionary

source§

impl<D: DictionaryAccess> StatefulTokenizer<D>

source

pub fn new(dic: D, mode: Mode) -> Self

Create a new non-debug stateful tokenizer

-
source

pub fn create(dic: D, debug: bool, mode: Mode) -> Self

Create a new debug stateful tokenizer with the following options

-
source

pub fn set_debug(&mut self, debug: bool) -> bool

Set debug flag and returns the current one

+
source

pub fn create(dic: D, debug: bool, mode: Mode) -> Self

Create a new debug stateful tokenizer with the following options

+
source

pub fn set_debug(&mut self, debug: bool) -> bool

Set debug flag and returns the current one

source

pub fn set_mode(&mut self, mode: Mode) -> Mode

Set the analysis mode and returns the current one

source

pub fn set_subset(&mut self, subset: InfoSubset) -> InfoSubset

Analyzer will read only following [WordInfo] field subset

-
source

pub fn reset(&mut self) -> &mut String

Prepare StatefulTokenizer for the next data. +

source

pub fn reset(&mut self) -> &mut String

Prepare StatefulTokenizer for the next data. Data must be written in the returned reference.

-
source

pub fn dict(&self) -> &D

Borrow current dictionary

-
source

pub fn do_tokenize(&mut self) -> SudachiResult<()>

Perform the actual tokenization so the analysis result will be available +

source

pub fn dict(&self) -> &D

Borrow current dictionary

+
source

pub fn do_tokenize(&mut self) -> SudachiResult<()>

Perform the actual tokenization so the analysis result will be available for consumption

source

pub fn swap_result( &mut self, input: &mut InputBuffer, - result: &mut Vec<ResultNode>, + result: &mut Vec<ResultNode>, subset: &mut InfoSubset )

Swap result data with the current analyzer

source

pub fn into_morpheme_list(self) -> SudachiResult<MorphemeList<D>>

Consume the Tokenizer and produce MorphemeList

-

Auto Trait Implementations§

§

impl<D> RefUnwindSafe for StatefulTokenizer<D>where - D: RefUnwindSafe,

§

impl<D> Send for StatefulTokenizer<D>where - D: Send,

§

impl<D> Sync for StatefulTokenizer<D>where - D: Sync,

§

impl<D> Unpin for StatefulTokenizer<D>where - D: Unpin,

§

impl<D> UnwindSafe for StatefulTokenizer<D>where - D: UnwindSafe,

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,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

source§

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

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

-
source§

impl<T, U> Into<U> for Twhere - U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

+

Auto Trait Implementations§

§

impl<D> RefUnwindSafe for StatefulTokenizer<D>where + D: RefUnwindSafe,

§

impl<D> Send for StatefulTokenizer<D>where + D: Send,

§

impl<D> Sync for StatefulTokenizer<D>where + D: Sync,

§

impl<D> Unpin for StatefulTokenizer<D>where + D: Unpin,

§

impl<D> UnwindSafe for StatefulTokenizer<D>where + D: UnwindSafe,

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,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

source§

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

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

+
source§

impl<T, U> Into<U> for Twhere + U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of -From<T> for U chooses to do.

-
source§

impl<T, U> TryFrom<U> for Twhere - U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
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.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
\ No newline at end of file +From<T> for U chooses to do.

+
source§

impl<T, U> TryFrom<U> for Twhere + U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
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.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
\ No newline at end of file diff --git a/rust/sudachi/analysis/stateless_tokenizer/index.html b/rust/sudachi/analysis/stateless_tokenizer/index.html index 3087db1c..443ce047 100644 --- a/rust/sudachi/analysis/stateless_tokenizer/index.html +++ b/rust/sudachi/analysis/stateless_tokenizer/index.html @@ -1 +1 @@ -sudachi::analysis::stateless_tokenizer - Rust

Structs

Traits

\ No newline at end of file +sudachi::analysis::stateless_tokenizer - Rust

Structs

Traits

\ No newline at end of file diff --git a/rust/sudachi/analysis/stateless_tokenizer/struct.StatelessTokenizer.html b/rust/sudachi/analysis/stateless_tokenizer/struct.StatelessTokenizer.html index 4180e030..4322085d 100644 --- a/rust/sudachi/analysis/stateless_tokenizer/struct.StatelessTokenizer.html +++ b/rust/sudachi/analysis/stateless_tokenizer/struct.StatelessTokenizer.html @@ -1,27 +1,27 @@ -StatelessTokenizer in sudachi::analysis::stateless_tokenizer - Rust
pub struct StatelessTokenizer<T> { /* private fields */ }
Expand description

Implementation of a Tokenizer which does not have tokenization state.

+StatelessTokenizer in sudachi::analysis::stateless_tokenizer - Rust
pub struct StatelessTokenizer<T> { /* private fields */ }
Expand description

Implementation of a Tokenizer which does not have tokenization state.

This is a wrapper which is generic over dictionary pointers. Usable where dictionary is a struct itself, &, &mut, Rc<.>, Arc<.>.

Implementations§

source§

impl<T: DictionaryAccess> StatelessTokenizer<T>

source

pub fn new(dict: T) -> StatelessTokenizer<T>

source§

impl<T> StatelessTokenizer<T>where - T: Deref, - <T as Deref>::Target: DictionaryAccess,

source

pub fn as_dict(&self) -> &<T as Deref>::Target

Trait Implementations§

source§

impl<T> Tokenize for StatelessTokenizer<T>where - T: DictionaryAccess + Clone,

§

type Dictionary = T

source§

fn tokenize<'a>( + T: Deref, + <T as Deref>::Target: DictionaryAccess,

source

pub fn as_dict(&self) -> &<T as Deref>::Target

Trait Implementations§

source§

impl<T> Tokenize for StatelessTokenizer<T>where + T: DictionaryAccess + Clone,

§

type Dictionary = T

source§

fn tokenize<'a>( &'a self, - input: &'a str, + input: &'a str, mode: Mode, - enable_debug: bool -) -> SudachiResult<MorphemeList<Self::Dictionary>>

Break text into Morphemes

Auto Trait Implementations§

§

impl<T> RefUnwindSafe for StatelessTokenizer<T>where - T: RefUnwindSafe,

§

impl<T> Send for StatelessTokenizer<T>where - T: Send,

§

impl<T> Sync for StatelessTokenizer<T>where - T: Sync,

§

impl<T> Unpin for StatelessTokenizer<T>where - T: Unpin,

§

impl<T> UnwindSafe for StatelessTokenizer<T>where - T: UnwindSafe,

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,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

source§

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

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

-
source§

impl<T, U> Into<U> for Twhere - U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

+ enable_debug: bool +) -> SudachiResult<MorphemeList<Self::Dictionary>>
Break text into Morphemes

Auto Trait Implementations§

§

impl<T> RefUnwindSafe for StatelessTokenizer<T>where + T: RefUnwindSafe,

§

impl<T> Send for StatelessTokenizer<T>where + T: Send,

§

impl<T> Sync for StatelessTokenizer<T>where + T: Sync,

§

impl<T> Unpin for StatelessTokenizer<T>where + T: Unpin,

§

impl<T> UnwindSafe for StatelessTokenizer<T>where + T: UnwindSafe,

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,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

source§

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

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

+
source§

impl<T, U> Into<U> for Twhere + U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of -From<T> for U chooses to do.

-
source§

impl<T, U> TryFrom<U> for Twhere - U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
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.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
\ No newline at end of file +From<T> for U chooses to do.

+
source§

impl<T, U> TryFrom<U> for Twhere + U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
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.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
\ No newline at end of file diff --git a/rust/sudachi/analysis/stateless_tokenizer/trait.DictionaryAccess.html b/rust/sudachi/analysis/stateless_tokenizer/trait.DictionaryAccess.html index fa39ba7a..87d4c66b 100644 --- a/rust/sudachi/analysis/stateless_tokenizer/trait.DictionaryAccess.html +++ b/rust/sudachi/analysis/stateless_tokenizer/trait.DictionaryAccess.html @@ -1,15 +1,15 @@ -DictionaryAccess in sudachi::analysis::stateless_tokenizer - Rust
pub trait DictionaryAccess {
+DictionaryAccess in sudachi::analysis::stateless_tokenizer - Rust
pub trait DictionaryAccess {
     // Required methods
     fn grammar(&self) -> &Grammar<'_>;
     fn lexicon(&self) -> &LexiconSet<'_>;
-    fn input_text_plugins(&self) -> &[Box<dyn InputTextPlugin + Sync + Send>];
+    fn input_text_plugins(&self) -> &[Box<dyn InputTextPlugin + Sync + Send>];
     fn oov_provider_plugins(
         &self
-    ) -> &[Box<dyn OovProviderPlugin + Sync + Send>];
+    ) -> &[Box<dyn OovProviderPlugin + Sync + Send>];
     fn path_rewrite_plugins(
         &self
-    ) -> &[Box<dyn PathRewritePlugin + Sync + Send>];
+    ) -> &[Box<dyn PathRewritePlugin + Sync + Send>];
 }
Expand description

Provides access to dictionary data

-

Required Methods§

Implementors§

\ No newline at end of file +

Required Methods§

Implementors§

\ No newline at end of file diff --git a/rust/sudachi/analysis/struct.Node.html b/rust/sudachi/analysis/struct.Node.html index c68d2bfd..7c4c4262 100644 --- a/rust/sudachi/analysis/struct.Node.html +++ b/rust/sudachi/analysis/struct.Node.html @@ -1,21 +1,21 @@ -Node in sudachi::analysis - Rust

Struct sudachi::analysis::Node

source ·
pub struct Node { /* private fields */ }

Implementations§

source§

impl Node

source

pub fn new( - begin: u16, - end: u16, - left_id: u16, - right_id: u16, - cost: i16, +Node in sudachi::analysis - Rust

Struct sudachi::analysis::Node

source ·
pub struct Node { /* private fields */ }

Implementations§

source§

impl Node

source

pub fn new( + begin: u16, + end: u16, + left_id: u16, + right_id: u16, + cost: i16, word_id: WordId -) -> Node

source

pub fn set_range(&mut self, begin: u16, end: u16)

Trait Implementations§

source§

impl Clone for Node

source§

fn clone(&self) -> Node

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 Node

source§

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

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

impl LatticeNode for Node

source§

fn begin(&self) -> usize

source§

fn end(&self) -> usize

source§

fn cost(&self) -> i16

source§

fn word_id(&self) -> WordId

source§

fn left_id(&self) -> u16

source§

fn is_oov(&self) -> bool

Is true when the word does not come from the dictionary. -BOS and EOS are also treated as OOV.
source§

fn is_special_node(&self) -> bool

If a node is a special system node like BOS or EOS. -Java name isSystem (which is similar to a regular node coming from the system dictionary)
source§

fn num_codepts(&self) -> usize

Returns number of codepoints in the current node
source§

fn char_range(&self) -> Range<usize>

Utility method for extracting [begin, end) codepoint range.
source§

impl RightId for Node

source§

fn right_id(&self) -> u16

Auto Trait Implementations§

§

impl RefUnwindSafe for Node

§

impl Send for Node

§

impl Sync for Node

§

impl Unpin for Node

§

impl UnwindSafe for Node

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,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

source§

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

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

-
source§

impl<T, U> Into<U> for Twhere - U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

+) -> Node

source

pub fn set_range(&mut self, begin: u16, end: u16)

Trait Implementations§

source§

impl Clone for Node

source§

fn clone(&self) -> Node

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 Node

source§

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

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

impl LatticeNode for Node

source§

fn begin(&self) -> usize

source§

fn end(&self) -> usize

source§

fn cost(&self) -> i16

source§

fn word_id(&self) -> WordId

source§

fn left_id(&self) -> u16

source§

fn is_oov(&self) -> bool

Is true when the word does not come from the dictionary. +BOS and EOS are also treated as OOV.
source§

fn is_special_node(&self) -> bool

If a node is a special system node like BOS or EOS. +Java name isSystem (which is similar to a regular node coming from the system dictionary)
source§

fn num_codepts(&self) -> usize

Returns number of codepoints in the current node
source§

fn char_range(&self) -> Range<usize>

Utility method for extracting [begin, end) codepoint range.
source§

impl RightId for Node

source§

fn right_id(&self) -> u16

Auto Trait Implementations§

§

impl RefUnwindSafe for Node

§

impl Send for Node

§

impl Sync for Node

§

impl Unpin for Node

§

impl UnwindSafe for Node

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,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

source§

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

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

+
source§

impl<T, U> Into<U> for Twhere + U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of -From<T> for U chooses to do.

-
source§

impl<T> ToOwned for Twhere - T: Clone,

§

type Owned = T

The resulting type after obtaining ownership.
source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
source§

impl<T, U> TryFrom<U> for Twhere - U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
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.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
\ No newline at end of file +From<T> for U chooses to do.

+
source§

impl<T> ToOwned for Twhere + T: Clone,

§

type Owned = T

The resulting type after obtaining ownership.
source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
source§

impl<T, U> TryFrom<U> for Twhere + U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
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.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
\ No newline at end of file diff --git a/rust/sudachi/analysis/trait.Tokenize.html b/rust/sudachi/analysis/trait.Tokenize.html index 75017a9e..5cc83573 100644 --- a/rust/sudachi/analysis/trait.Tokenize.html +++ b/rust/sudachi/analysis/trait.Tokenize.html @@ -1,19 +1,19 @@ -Tokenize in sudachi::analysis - Rust
pub trait Tokenize {
+Tokenize in sudachi::analysis - Rust
pub trait Tokenize {
     type Dictionary;
 
     // Required method
     fn tokenize(
         &self,
-        input: &str,
+        input: &str,
         mode: Mode,
-        enable_debug: bool
+        enable_debug: bool
     ) -> SudachiResult<MorphemeList<Self::Dictionary>>;
 }
Expand description

Able to tokenize Japanese text

Required Associated Types§

Required Methods§

source

fn tokenize( &self, - input: &str, + input: &str, mode: Mode, - enable_debug: bool + enable_debug: bool ) -> SudachiResult<MorphemeList<Self::Dictionary>>

Break text into Morphemes

Implementors§

\ No newline at end of file + T: DictionaryAccess + Clone,
§

type Dictionary = T

\ No newline at end of file diff --git a/rust/sudachi/config/enum.ConfigError.html b/rust/sudachi/config/enum.ConfigError.html index 27accf0f..243f1811 100644 --- a/rust/sudachi/config/enum.ConfigError.html +++ b/rust/sudachi/config/enum.ConfigError.html @@ -1,20 +1,20 @@ -ConfigError in sudachi::config - Rust
pub enum ConfigError {
-    Io(Error),
+ConfigError in sudachi::config - Rust
pub enum ConfigError {
+    Io(Error),
     SerdeError(Error),
-    FileNotFound(String),
-    InvalidFormat(String),
-    MissingArgument(String),
-    PathResolution(String, Vec<String>),
+    FileNotFound(String),
+    InvalidFormat(String),
+    MissingArgument(String),
+    PathResolution(String, Vec<String>),
 }
Expand description

Sudachi Error

-

Variants§

§

Io(Error)

§

SerdeError(Error)

§

FileNotFound(String)

§

InvalidFormat(String)

§

MissingArgument(String)

§

PathResolution(String, Vec<String>)

Trait Implementations§

source§

impl Debug for ConfigError

source§

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

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

impl Display for ConfigError

source§

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

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

impl Error for ConfigError

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()
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, request: &mut Request<'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<ConfigError> for SudachiError

source§

fn from(source: ConfigError) -> Self

Converts to this type from the input type.
source§

impl From<Error> for ConfigError

source§

fn from(source: Error) -> Self

Converts to this type from the input type.
source§

impl From<Error> for ConfigError

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,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

source§

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

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

-
source§

impl<T, U> Into<U> for Twhere - U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

+

Variants§

§

Io(Error)

§

SerdeError(Error)

§

FileNotFound(String)

§

InvalidFormat(String)

§

MissingArgument(String)

§

PathResolution(String, Vec<String>)

Trait Implementations§

source§

impl Debug for ConfigError

source§

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

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

impl Display for ConfigError

source§

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

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

impl Error for ConfigError

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()
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, request: &mut Request<'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<ConfigError> for SudachiError

source§

fn from(source: ConfigError) -> Self

Converts to this type from the input type.
source§

impl From<Error> for ConfigError

source§

fn from(source: Error) -> Self

Converts to this type from the input type.
source§

impl From<Error> for ConfigError

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,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

source§

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

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

+
source§

impl<T, U> Into<U> for Twhere + U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of -From<T> for U chooses to do.

-
source§

impl<T> ToString for Twhere - T: Display + ?Sized,

source§

default fn to_string(&self) -> String

Converts the given value to a String. Read more
source§

impl<T, U> TryFrom<U> for Twhere - U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
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.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
\ No newline at end of file +From<T> for U chooses to do.

+
source§

impl<T> ToString for Twhere + T: Display + ?Sized,

source§

default fn to_string(&self) -> String

Converts the given value to a String. Read more
source§

impl<T, U> TryFrom<U> for Twhere + U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
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.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
\ No newline at end of file diff --git a/rust/sudachi/config/enum.SurfaceProjection.html b/rust/sudachi/config/enum.SurfaceProjection.html index 679d07d8..37802a2e 100644 --- a/rust/sudachi/config/enum.SurfaceProjection.html +++ b/rust/sudachi/config/enum.SurfaceProjection.html @@ -1,4 +1,4 @@ -SurfaceProjection in sudachi::config - Rust
pub enum SurfaceProjection {
+SurfaceProjection in sudachi::config - Rust
pub enum SurfaceProjection {
     Surface,
     Normalized,
     Reading,
@@ -7,23 +7,23 @@
     NormalizedAndSurface,
     NormalizedNouns,
 }

Variants§

§

Surface

§

Normalized

§

Reading

§

Dictionary

§

DictionaryAndSurface

§

NormalizedAndSurface

§

NormalizedNouns

Implementations§

source§

impl SurfaceProjection

source

pub fn required_subset(&self) -> InfoSubset

Return required InfoSubset for the current projection type

-

Trait Implementations§

source§

impl Clone for SurfaceProjection

source§

fn clone(&self) -> SurfaceProjection

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 SurfaceProjection

source§

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

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

impl Default for SurfaceProjection

source§

fn default() -> Self

Returns the “default value” for a type. Read more
source§

impl<'de> Deserialize<'de> for SurfaceProjection

source§

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where - __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer. Read more
source§

impl PartialEq<SurfaceProjection> for SurfaceProjection

source§

fn eq(&self, other: &SurfaceProjection) -> 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 TryFrom<&str> for SurfaceProjection

§

type Error = SudachiError

The type returned in the event of a conversion error.
source§

fn try_from(value: &str) -> Result<Self, Self::Error>

Performs the conversion.
source§

impl Copy for SurfaceProjection

source§

impl Eq for SurfaceProjection

source§

impl StructuralEq for SurfaceProjection

source§

impl StructuralPartialEq for SurfaceProjection

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,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

source§

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

Mutably borrows from an owned value. Read more
§

impl<Q, K> Equivalent<K> for Qwhere - Q: Eq + ?Sized, - K: Borrow<Q> + ?Sized,

§

fn equivalent(&self, key: &K) -> bool

Checks if this value is equivalent to the given key. Read more
§

impl<Q, K> Equivalent<K> for Qwhere - Q: Eq + ?Sized, - K: Borrow<Q> + ?Sized,

§

fn equivalent(&self, key: &K) -> bool

Compare self to key and return true if they are equal.
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

-
source§

impl<T, U> Into<U> for Twhere - U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

+

Trait Implementations§

source§

impl Clone for SurfaceProjection

source§

fn clone(&self) -> SurfaceProjection

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 SurfaceProjection

source§

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

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

impl Default for SurfaceProjection

source§

fn default() -> Self

Returns the “default value” for a type. Read more
source§

impl<'de> Deserialize<'de> for SurfaceProjection

source§

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where + __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer. Read more
source§

impl PartialEq for SurfaceProjection

source§

fn eq(&self, other: &SurfaceProjection) -> 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 TryFrom<&str> for SurfaceProjection

§

type Error = SudachiError

The type returned in the event of a conversion error.
source§

fn try_from(value: &str) -> Result<Self, Self::Error>

Performs the conversion.
source§

impl Copy for SurfaceProjection

source§

impl Eq for SurfaceProjection

source§

impl StructuralEq for SurfaceProjection

source§

impl StructuralPartialEq for SurfaceProjection

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,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

source§

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

Mutably borrows from an owned value. Read more
§

impl<Q, K> Equivalent<K> for Qwhere + Q: Eq + ?Sized, + K: Borrow<Q> + ?Sized,

§

fn equivalent(&self, key: &K) -> bool

Checks if this value is equivalent to the given key. Read more
§

impl<Q, K> Equivalent<K> for Qwhere + Q: Eq + ?Sized, + K: Borrow<Q> + ?Sized,

§

fn equivalent(&self, key: &K) -> bool

Compare self to key and return true if they are equal.
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

+
source§

impl<T, U> Into<U> for Twhere + U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of -From<T> for U chooses to do.

-
source§

impl<T> ToOwned for Twhere - T: Clone,

§

type Owned = T

The resulting type after obtaining ownership.
source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
source§

impl<T, U> TryFrom<U> for Twhere - U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
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.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
source§

impl<T> DeserializeOwned for Twhere +From<T> for U chooses to do.

+

source§

impl<T> ToOwned for Twhere + T: Clone,

§

type Owned = T

The resulting type after obtaining ownership.
source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
source§

impl<T, U> TryFrom<U> for Twhere + U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
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.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
source§

impl<T> DeserializeOwned for Twhere T: for<'de> Deserialize<'de>,

\ No newline at end of file diff --git a/rust/sudachi/config/fn.default_config_location.html b/rust/sudachi/config/fn.default_config_location.html index 835aaa8c..eeb22d01 100644 --- a/rust/sudachi/config/fn.default_config_location.html +++ b/rust/sudachi/config/fn.default_config_location.html @@ -1 +1 @@ -default_config_location in sudachi::config - Rust
pub fn default_config_location() -> PathBuf
\ No newline at end of file +default_config_location in sudachi::config - Rust
pub fn default_config_location() -> PathBuf
\ No newline at end of file diff --git a/rust/sudachi/config/fn.default_resource_dir.html b/rust/sudachi/config/fn.default_resource_dir.html index c62b20b3..320abddd 100644 --- a/rust/sudachi/config/fn.default_resource_dir.html +++ b/rust/sudachi/config/fn.default_resource_dir.html @@ -1 +1 @@ -default_resource_dir in sudachi::config - Rust
pub fn default_resource_dir() -> PathBuf
\ No newline at end of file +default_resource_dir in sudachi::config - Rust
pub fn default_resource_dir() -> PathBuf
\ No newline at end of file diff --git a/rust/sudachi/config/index.html b/rust/sudachi/config/index.html index 448e501b..eeafe7ac 100644 --- a/rust/sudachi/config/index.html +++ b/rust/sudachi/config/index.html @@ -1,3 +1,3 @@ -sudachi::config - Rust

Module sudachi::config

source ·

Structs

\ No newline at end of file +From<T> for U chooses to do.

+
source§

impl<T> ToOwned for Twhere + T: Clone,

§

type Owned = T

The resulting type after obtaining ownership.
source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
source§

impl<T, U> TryFrom<U> for Twhere + U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
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.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
\ No newline at end of file diff --git a/rust/sudachi/config/struct.ConfigBuilder.html b/rust/sudachi/config/struct.ConfigBuilder.html index ef02add4..08e0e383 100644 --- a/rust/sudachi/config/struct.ConfigBuilder.html +++ b/rust/sudachi/config/struct.ConfigBuilder.html @@ -1,17 +1,17 @@ -ConfigBuilder in sudachi::config - Rust
pub struct ConfigBuilder { /* private fields */ }
Expand description

Struct corresponds with raw config json file. +ConfigBuilder in sudachi::config - Rust

pub struct ConfigBuilder { /* private fields */ }
Expand description

Struct corresponds with raw config json file. You must use filed names defined here as json object key. For plugins, refer to each plugin.

-

Implementations§

source§

impl ConfigBuilder

source

pub fn from_opt_file(config_file: Option<&Path>) -> Result<Self, ConfigError>

source

pub fn from_file(config_file: &Path) -> Result<Self, ConfigError>

source

pub fn from_bytes(data: &[u8]) -> Result<Self, ConfigError>

source

pub fn empty() -> Self

source

pub fn system_dict(self, dict: impl Into<PathBuf>) -> Self

source

pub fn user_dict(self, dict: impl Into<PathBuf>) -> Self

source

pub fn resource_path(self, path: impl Into<PathBuf>) -> Self

source

pub fn root_directory(self, path: impl Into<PathBuf>) -> Self

source

pub fn build(self) -> Config

source

pub fn fallback(self, other: &ConfigBuilder) -> ConfigBuilder

Trait Implementations§

source§

impl Clone for ConfigBuilder

source§

fn clone(&self) -> ConfigBuilder

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 ConfigBuilder

source§

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

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

impl<'de> Deserialize<'de> for ConfigBuilder

source§

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where - __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer. 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,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

source§

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

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

-
source§

impl<T, U> Into<U> for Twhere - U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

+

Implementations§

source§

impl ConfigBuilder

source

pub fn from_opt_file(config_file: Option<&Path>) -> Result<Self, ConfigError>

source

pub fn from_file(config_file: &Path) -> Result<Self, ConfigError>

source

pub fn from_bytes(data: &[u8]) -> Result<Self, ConfigError>

source

pub fn empty() -> Self

source

pub fn system_dict(self, dict: impl Into<PathBuf>) -> Self

source

pub fn user_dict(self, dict: impl Into<PathBuf>) -> Self

source

pub fn resource_path(self, path: impl Into<PathBuf>) -> Self

source

pub fn root_directory(self, path: impl Into<PathBuf>) -> Self

source

pub fn build(self) -> Config

source

pub fn fallback(self, other: &ConfigBuilder) -> ConfigBuilder

Trait Implementations§

source§

impl Clone for ConfigBuilder

source§

fn clone(&self) -> ConfigBuilder

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 ConfigBuilder

source§

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

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

impl<'de> Deserialize<'de> for ConfigBuilder

source§

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where + __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer. 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,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

source§

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

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

+
source§

impl<T, U> Into<U> for Twhere + U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of -From<T> for U chooses to do.

-
source§

impl<T> ToOwned for Twhere - T: Clone,

§

type Owned = T

The resulting type after obtaining ownership.
source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
source§

impl<T, U> TryFrom<U> for Twhere - U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
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.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
source§

impl<T> DeserializeOwned for Twhere +From<T> for U chooses to do.

+

source§

impl<T> ToOwned for Twhere + T: Clone,

§

type Owned = T

The resulting type after obtaining ownership.
source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
source§

impl<T, U> TryFrom<U> for Twhere + U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
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.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
source§

impl<T> DeserializeOwned for Twhere T: for<'de> Deserialize<'de>,

\ No newline at end of file diff --git a/rust/sudachi/dic/build/enum.DataSource.html b/rust/sudachi/dic/build/enum.DataSource.html index 69474ab9..5f0921e2 100644 --- a/rust/sudachi/dic/build/enum.DataSource.html +++ b/rust/sudachi/dic/build/enum.DataSource.html @@ -1,14 +1,14 @@ -DataSource in sudachi::dic::build - Rust
pub enum DataSource<'a> {
-    File(&'a Path),
-    Data(&'a [u8]),
-}

Variants§

§

File(&'a Path)

§

Data(&'a [u8])

Trait Implementations§

source§

impl<'a> AsDataSource<'a> for DataSource<'a>

source§

fn convert(self) -> DataSource<'a>

source§

fn name(&self) -> String

Auto Trait Implementations§

§

impl<'a> RefUnwindSafe for DataSource<'a>

§

impl<'a> Send for DataSource<'a>

§

impl<'a> Sync for DataSource<'a>

§

impl<'a> Unpin for DataSource<'a>

§

impl<'a> UnwindSafe for DataSource<'a>

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,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

source§

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

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

-
source§

impl<T, U> Into<U> for Twhere - U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

+DataSource in sudachi::dic::build - Rust
pub enum DataSource<'a> {
+    File(&'a Path),
+    Data(&'a [u8]),
+}

Variants§

§

File(&'a Path)

§

Data(&'a [u8])

Trait Implementations§

source§

impl<'a> AsDataSource<'a> for DataSource<'a>

source§

fn convert(self) -> DataSource<'a>

source§

fn name(&self) -> String

Auto Trait Implementations§

§

impl<'a> RefUnwindSafe for DataSource<'a>

§

impl<'a> Send for DataSource<'a>

§

impl<'a> Sync for DataSource<'a>

§

impl<'a> Unpin for DataSource<'a>

§

impl<'a> UnwindSafe for DataSource<'a>

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,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

source§

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

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

+
source§

impl<T, U> Into<U> for Twhere + U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of -From<T> for U chooses to do.

-
source§

impl<T, U> TryFrom<U> for Twhere - U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
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.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
\ No newline at end of file +From<T> for U chooses to do.

+
source§

impl<T, U> TryFrom<U> for Twhere + U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
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.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
\ No newline at end of file diff --git a/rust/sudachi/dic/build/enum.NoDic.html b/rust/sudachi/dic/build/enum.NoDic.html index 361f4d8f..61397f36 100644 --- a/rust/sudachi/dic/build/enum.NoDic.html +++ b/rust/sudachi/dic/build/enum.NoDic.html @@ -1,11 +1,11 @@ -NoDic in sudachi::dic::build - Rust

Enum sudachi::dic::build::NoDic

source ·
pub enum NoDic {}

Trait Implementations§

Auto Trait Implementations§

§

impl RefUnwindSafe for NoDic

§

impl Send for NoDic

§

impl Sync for NoDic

§

impl Unpin for NoDic

§

impl UnwindSafe for NoDic

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,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

source§

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

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

-
source§

impl<T, U> Into<U> for Twhere - U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

+NoDic in sudachi::dic::build - Rust

Enum sudachi::dic::build::NoDic

source ·
pub enum NoDic {}

Trait Implementations§

Auto Trait Implementations§

§

impl RefUnwindSafe for NoDic

§

impl Send for NoDic

§

impl Sync for NoDic

§

impl Unpin for NoDic

§

impl UnwindSafe for NoDic

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,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

source§

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

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

+
source§

impl<T, U> Into<U> for Twhere + U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of -From<T> for U chooses to do.

-
source§

impl<T, U> TryFrom<U> for Twhere - U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
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.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
\ No newline at end of file +From<T> for U chooses to do.

+
source§

impl<T, U> TryFrom<U> for Twhere + U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
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.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
\ No newline at end of file diff --git a/rust/sudachi/dic/build/error/enum.BuildFailure.html b/rust/sudachi/dic/build/error/enum.BuildFailure.html index d0062efc..fef25f4f 100644 --- a/rust/sudachi/dic/build/error/enum.BuildFailure.html +++ b/rust/sudachi/dic/build/error/enum.BuildFailure.html @@ -1,42 +1,42 @@ -BuildFailure in sudachi::dic::build::error - Rust
#[non_exhaustive]
pub enum BuildFailure { +BuildFailure in sudachi::dic::build::error - Rust
#[non_exhaustive]
pub enum BuildFailure {
Show 18 variants InvalidSize { - actual: usize, - expected: usize, + actual: usize, + expected: usize, }, InvalidFieldSize { - actual: usize, - expected: usize, - field: &'static str, + actual: usize, + expected: usize, + field: &'static str, }, - Io(Error), - NoRawField(&'static str), + Io(Error), + NoRawField(&'static str), CsvError(Error), - InvalidCharLiteral(String), - InvalidI16Literal(String), - InvalidU32Literal(String), - InvalidWordId(String), - InvalidSplit(String), + InvalidCharLiteral(String), + InvalidI16Literal(String), + InvalidU32Literal(String), + InvalidWordId(String), + InvalidSplit(String), SplitFormatError { - field: &'static str, - original: String, + field: &'static str, + original: String, }, EmptySurface, - PosLimitExceeded(String), - InvalidSplitWordReference(String), + PosLimitExceeded(String), + InvalidSplitWordReference(String), UnresolvedSplits, - InvalidConnSize(&'static str, i16), + InvalidConnSize(&'static str, i16), WordIdTableNotBuilt, TrieBuildFailure,
}
Expand description

Actual specific errors for dictionary compilation

-

Variants (Non-exhaustive)§

This enum is marked as non-exhaustive
Non-exhaustive enums could have additional variants added in future. Therefore, when matching against variants of non-exhaustive enums, an extra wildcard arm must be added to account for any future variants.
§

InvalidSize

Fields

§actual: usize
§expected: usize
§

InvalidFieldSize

Fields

§actual: usize
§expected: usize
§field: &'static str
§

Io(Error)

§

NoRawField(&'static str)

§

CsvError(Error)

§

InvalidCharLiteral(String)

§

InvalidI16Literal(String)

§

InvalidU32Literal(String)

§

InvalidWordId(String)

§

InvalidSplit(String)

§

SplitFormatError

Fields

§field: &'static str
§original: String
§

EmptySurface

§

PosLimitExceeded(String)

§

InvalidSplitWordReference(String)

§

UnresolvedSplits

§

InvalidConnSize(&'static str, i16)

§

WordIdTableNotBuilt

§

TrieBuildFailure

Trait Implementations§

source§

impl Debug for BuildFailure

source§

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

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

impl Display for BuildFailure

source§

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

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

impl Error for BuildFailure

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()
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, request: &mut Request<'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<Error> for BuildFailure

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,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

source§

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

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

-
source§

impl<T, U> Into<U> for Twhere - U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

+

Variants (Non-exhaustive)§

This enum is marked as non-exhaustive
Non-exhaustive enums could have additional variants added in future. Therefore, when matching against variants of non-exhaustive enums, an extra wildcard arm must be added to account for any future variants.
§

InvalidSize

Fields

§actual: usize
§expected: usize
§

InvalidFieldSize

Fields

§actual: usize
§expected: usize
§field: &'static str
§

Io(Error)

§

NoRawField(&'static str)

§

CsvError(Error)

§

InvalidCharLiteral(String)

§

InvalidI16Literal(String)

§

InvalidU32Literal(String)

§

InvalidWordId(String)

§

InvalidSplit(String)

§

SplitFormatError

Fields

§field: &'static str
§original: String
§

EmptySurface

§

PosLimitExceeded(String)

§

InvalidSplitWordReference(String)

§

UnresolvedSplits

§

InvalidConnSize(&'static str, i16)

§

WordIdTableNotBuilt

§

TrieBuildFailure

Trait Implementations§

source§

impl Debug for BuildFailure

source§

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

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

impl Display for BuildFailure

source§

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

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

impl Error for BuildFailure

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()
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, request: &mut Request<'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<Error> for BuildFailure

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,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

source§

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

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

+
source§

impl<T, U> Into<U> for Twhere + U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of -From<T> for U chooses to do.

-
source§

impl<T> ToString for Twhere - T: Display + ?Sized,

source§

default fn to_string(&self) -> String

Converts the given value to a String. Read more
source§

impl<T, U> TryFrom<U> for Twhere - U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
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.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
\ No newline at end of file +From<T> for U chooses to do.

+
source§

impl<T> ToString for Twhere + T: Display + ?Sized,

source§

default fn to_string(&self) -> String

Converts the given value to a String. Read more
source§

impl<T, U> TryFrom<U> for Twhere + U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
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.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
\ No newline at end of file diff --git a/rust/sudachi/dic/build/error/index.html b/rust/sudachi/dic/build/error/index.html index 1321be99..a46b76d2 100644 --- a/rust/sudachi/dic/build/error/index.html +++ b/rust/sudachi/dic/build/error/index.html @@ -1,2 +1,2 @@ -sudachi::dic::build::error - Rust

Module sudachi::dic::build::error

source ·

Structs

\ No newline at end of file diff --git a/rust/sudachi/dic/build/error/type.DicWriteResult.html b/rust/sudachi/dic/build/error/type.DicWriteResult.html index ce2eb99c..cc5b9c00 100644 --- a/rust/sudachi/dic/build/error/type.DicWriteResult.html +++ b/rust/sudachi/dic/build/error/type.DicWriteResult.html @@ -1,6 +1,6 @@ -DicWriteResult in sudachi::dic::build::error - Rust

Type Alias sudachi::dic::build::error::DicWriteResult

source ·
pub type DicWriteResult<T> = Result<T, BuildFailure>;

Aliased Type§

enum DicWriteResult<T> {
+DicWriteResult in sudachi::dic::build::error - Rust

Type Alias sudachi::dic::build::error::DicWriteResult

source ·
pub type DicWriteResult<T> = Result<T, BuildFailure>;

Aliased Type§

enum DicWriteResult<T> {
     Ok(T),
     Err(BuildFailure),
 }

Variants§

§1.0.0

Ok(T)

Contains the success value

§1.0.0

Err(BuildFailure)

Contains the error value

-
\ No newline at end of file +
\ No newline at end of file diff --git a/rust/sudachi/dic/build/index.html b/rust/sudachi/dic/build/index.html index d17ea207..ef42acac 100644 --- a/rust/sudachi/dic/build/index.html +++ b/rust/sudachi/dic/build/index.html @@ -1 +1 @@ -sudachi::dic::build - Rust

Module sudachi::dic::build

source ·

Modules

Structs

  • Builds a binary dictionary from csv lexicon and connection matrix (optional)

Enums

Traits

\ No newline at end of file +sudachi::dic::build - Rust

Module sudachi::dic::build

source ·

Modules

Structs

  • Builds a binary dictionary from csv lexicon and connection matrix (optional)

Enums

Traits

\ No newline at end of file diff --git a/rust/sudachi/dic/build/report/index.html b/rust/sudachi/dic/build/report/index.html index 0c0deeef..b6366ed1 100644 --- a/rust/sudachi/dic/build/report/index.html +++ b/rust/sudachi/dic/build/report/index.html @@ -1 +1 @@ -sudachi::dic::build::report - Rust
\ No newline at end of file +sudachi::dic::build::report - Rust
\ No newline at end of file diff --git a/rust/sudachi/dic/build/report/struct.DictPartReport.html b/rust/sudachi/dic/build/report/struct.DictPartReport.html index 655e5190..af0d7038 100644 --- a/rust/sudachi/dic/build/report/struct.DictPartReport.html +++ b/rust/sudachi/dic/build/report/struct.DictPartReport.html @@ -1,11 +1,11 @@ -DictPartReport in sudachi::dic::build::report - Rust
pub struct DictPartReport { /* private fields */ }

Implementations§

source§

impl DictPartReport

source

pub fn part(&self) -> &str

source

pub fn time(&self) -> Duration

source

pub fn size(&self) -> usize

source

pub fn is_write(&self) -> bool

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,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

source§

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

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

-
source§

impl<T, U> Into<U> for Twhere - U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

+DictPartReport in sudachi::dic::build::report - Rust
pub struct DictPartReport { /* private fields */ }

Implementations§

source§

impl DictPartReport

source

pub fn part(&self) -> &str

source

pub fn time(&self) -> Duration

source

pub fn size(&self) -> usize

source

pub fn is_write(&self) -> bool

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,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

source§

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

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

+
source§

impl<T, U> Into<U> for Twhere + U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of -From<T> for U chooses to do.

-
source§

impl<T, U> TryFrom<U> for Twhere - U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
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.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
\ No newline at end of file +From<T> for U chooses to do.

+
source§

impl<T, U> TryFrom<U> for Twhere + U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
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.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
\ No newline at end of file diff --git a/rust/sudachi/dic/build/struct.DictBuilder.html b/rust/sudachi/dic/build/struct.DictBuilder.html index 3e07a345..b0d2c6a4 100644 --- a/rust/sudachi/dic/build/struct.DictBuilder.html +++ b/rust/sudachi/dic/build/struct.DictBuilder.html @@ -1,34 +1,34 @@ -DictBuilder in sudachi::dic::build - Rust

Struct sudachi::dic::build::DictBuilder

source ·
pub struct DictBuilder<D> { /* private fields */ }
Expand description

Builds a binary dictionary from csv lexicon and connection matrix (optional)

+DictBuilder in sudachi::dic::build - Rust

Struct sudachi::dic::build::DictBuilder

source ·
pub struct DictBuilder<D> { /* private fields */ }
Expand description

Builds a binary dictionary from csv lexicon and connection matrix (optional)

Implementations§

source§

impl DictBuilder<NoDic>

source

pub fn new_system() -> Self

Creates a new builder for system dictionary

source§

impl<D: DictionaryAccess> DictBuilder<D>

source

pub fn new_user(system: D) -> Self

Creates a new builder for user dictionary

-
source

pub fn set_compile_time<T: Into<SystemTime>>(&mut self, time: T) -> SystemTime

Set the dictionary compile time to the specified time +

source

pub fn set_compile_time<T: Into<SystemTime>>(&mut self, time: T) -> SystemTime

Set the dictionary compile time to the specified time instead of current time

-
source

pub fn set_description<T: Into<String>>(&mut self, description: T)

Set the dictionary description

+
source

pub fn set_description<T: Into<String>>(&mut self, description: T)

Set the dictionary description

source

pub fn read_lexicon<'a, T: AsDataSource<'a> + 'a>( &mut self, data: T -) -> SudachiResult<usize>

Read the csv lexicon from either a file or an in-memory buffer

+) -> SudachiResult<usize>

Read the csv lexicon from either a file or an in-memory buffer

source

pub fn read_conn<'a, T: AsDataSource<'a> + 'a>( &mut self, data: T -) -> SudachiResult<()>

Read the connection matrix from either a file or an in-memory buffer

-
source

pub fn compile<W: Write>(&mut self, w: &mut W) -> SudachiResult<()>

Compile the binary dictionary and write it to the specified sink

-
source

pub fn resolve(&mut self) -> SudachiResult<usize>

Resolve the dictionary references.

+) -> SudachiResult<()>

Read the connection matrix from either a file or an in-memory buffer

+
source

pub fn compile<W: Write>(&mut self, w: &mut W) -> SudachiResult<()>

Compile the binary dictionary and write it to the specified sink

+
source

pub fn resolve(&mut self) -> SudachiResult<usize>

Resolve the dictionary references.

Returns the number of resolved entries

source

pub fn report(&self) -> &[DictPartReport]

Return dictionary build report

-

Auto Trait Implementations§

§

impl<D> RefUnwindSafe for DictBuilder<D>where - D: RefUnwindSafe,

§

impl<D> Send for DictBuilder<D>where - D: Send,

§

impl<D> Sync for DictBuilder<D>where - D: Sync,

§

impl<D> Unpin for DictBuilder<D>where - D: Unpin,

§

impl<D> UnwindSafe for DictBuilder<D>where - D: UnwindSafe,

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,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

source§

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

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

-
source§

impl<T, U> Into<U> for Twhere - U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

+

Auto Trait Implementations§

§

impl<D> RefUnwindSafe for DictBuilder<D>where + D: RefUnwindSafe,

§

impl<D> Send for DictBuilder<D>where + D: Send,

§

impl<D> Sync for DictBuilder<D>where + D: Sync,

§

impl<D> Unpin for DictBuilder<D>where + D: Unpin,

§

impl<D> UnwindSafe for DictBuilder<D>where + D: UnwindSafe,

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,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

source§

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

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

+
source§

impl<T, U> Into<U> for Twhere + U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of -From<T> for U chooses to do.

-
source§

impl<T, U> TryFrom<U> for Twhere - U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
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.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
\ No newline at end of file +From<T> for U chooses to do.

+
source§

impl<T, U> TryFrom<U> for Twhere + U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
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.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
\ No newline at end of file diff --git a/rust/sudachi/dic/build/trait.AsDataSource.html b/rust/sudachi/dic/build/trait.AsDataSource.html index 50084a91..8bfa97db 100644 --- a/rust/sudachi/dic/build/trait.AsDataSource.html +++ b/rust/sudachi/dic/build/trait.AsDataSource.html @@ -1,5 +1,5 @@ -AsDataSource in sudachi::dic::build - Rust
pub trait AsDataSource<'a> {
+AsDataSource in sudachi::dic::build - Rust
pub trait AsDataSource<'a> {
     // Required methods
     fn convert(self) -> DataSource<'a>;
-    fn name(&self) -> String;
-}

Required Methods§

source

fn convert(self) -> DataSource<'a>

source

fn name(&self) -> String

Implementations on Foreign Types§

source§

impl<'a, const N: usize> AsDataSource<'a> for &'a [u8; N]

source§

fn convert(self) -> DataSource<'a>

source§

fn name(&self) -> String

source§

impl<'a> AsDataSource<'a> for &'a [u8]

source§

fn convert(self) -> DataSource<'a>

source§

fn name(&self) -> String

source§

impl<'a> AsDataSource<'a> for &'a Path

source§

fn convert(self) -> DataSource<'a>

source§

fn name(&self) -> String

Implementors§

source§

impl<'a> AsDataSource<'a> for DataSource<'a>

\ No newline at end of file + fn name(&self) -> String; +}

Required Methods§

source

fn convert(self) -> DataSource<'a>

source

fn name(&self) -> String

Implementations on Foreign Types§

source§

impl<'a> AsDataSource<'a> for &'a Path

source§

fn convert(self) -> DataSource<'a>

source§

fn name(&self) -> String

source§

impl<'a> AsDataSource<'a> for &'a [u8]

source§

fn convert(self) -> DataSource<'a>

source§

fn name(&self) -> String

source§

impl<'a, const N: usize> AsDataSource<'a> for &'a [u8; N]

source§

fn convert(self) -> DataSource<'a>

source§

fn name(&self) -> String

Implementors§

source§

impl<'a> AsDataSource<'a> for DataSource<'a>

\ No newline at end of file diff --git a/rust/sudachi/dic/category_type/index.html b/rust/sudachi/dic/category_type/index.html index d105d125..cf9ce1b6 100644 --- a/rust/sudachi/dic/category_type/index.html +++ b/rust/sudachi/dic/category_type/index.html @@ -1 +1 @@ -sudachi::dic::category_type - Rust

Module sudachi::dic::category_type

source ·

Structs

\ No newline at end of file +sudachi::dic::category_type - Rust

Module sudachi::dic::category_type

source ·

Structs

\ No newline at end of file diff --git a/rust/sudachi/dic/category_type/struct.CategoryType.html b/rust/sudachi/dic/category_type/struct.CategoryType.html index 144ea2a6..1763ac65 100644 --- a/rust/sudachi/dic/category_type/struct.CategoryType.html +++ b/rust/sudachi/dic/category_type/struct.CategoryType.html @@ -1,4 +1,4 @@ -CategoryType in sudachi::dic::category_type - Rust
#[repr(transparent)]
pub struct CategoryType(/* private fields */);
Expand description

A set of categories for a character

+CategoryType in sudachi::dic::category_type - Rust
pub struct CategoryType(/* private fields */);
Expand description

A set of categories for a character

Implemented as a bitset with fixed size

Implementations§

source§

impl CategoryType

source

pub const DEFAULT: Self = _

The fall back category.

source

pub const SPACE: Self = _

White spaces.

@@ -20,25 +20,25 @@
source

pub const ALL: Self = _

All categories at once except NOOOVBOW/2

source§

impl CategoryType

source

pub const fn empty() -> Self

Get a flags value with all bits unset.

source

pub const fn all() -> Self

Get a flags value with all known bits set.

-
source

pub const fn bits(&self) -> u32

Get the underlying bits value.

+
source

pub const fn bits(&self) -> u32

Get the underlying bits value.

The returned value is exactly the bits set in this flags value.

-
source

pub const fn from_bits(bits: u32) -> Option<Self>

Convert from a bits value.

+
source

pub const fn from_bits(bits: u32) -> Option<Self>

Convert from a bits value.

This method will return None if any unknown bits are set.

-
source

pub const fn from_bits_truncate(bits: u32) -> Self

Convert from a bits value, unsetting any unknown bits.

-
source

pub const fn from_bits_retain(bits: u32) -> Self

Convert from a bits value exactly.

-
source

pub fn from_name(name: &str) -> Option<Self>

Get a flags value with the bits of a flag with the given name set.

+
source

pub const fn from_bits_truncate(bits: u32) -> Self

Convert from a bits value, unsetting any unknown bits.

+
source

pub const fn from_bits_retain(bits: u32) -> Self

Convert from a bits value exactly.

+
source

pub fn from_name(name: &str) -> Option<Self>

Get a flags value with the bits of a flag with the given name set.

This method will return None if name is empty or doesn’t correspond to any named flag.

-
source

pub const fn is_empty(&self) -> bool

Whether all bits in this flags value are unset.

-
source

pub const fn is_all(&self) -> bool

Whether all known bits in this flags value are set.

-
source

pub const fn intersects(&self, other: Self) -> bool

Whether any set bits in a source flags value are also set in a target flags value.

-
source

pub const fn contains(&self, other: Self) -> bool

Whether all set bits in a source flags value are also set in a target flags value.

+
source

pub const fn is_empty(&self) -> bool

Whether all bits in this flags value are unset.

+
source

pub const fn is_all(&self) -> bool

Whether all known bits in this flags value are set.

+
source

pub const fn intersects(&self, other: Self) -> bool

Whether any set bits in a source flags value are also set in a target flags value.

+
source

pub const fn contains(&self, other: Self) -> bool

Whether all set bits in a source flags value are also set in a target flags value.

source

pub fn insert(&mut self, other: Self)

The bitwise or (|) of the bits in two flags values.

source

pub fn remove(&mut self, other: Self)

The intersection of a source flags value with the complement of a target flags value (&!).

This method is not equivalent to self & !other when other has unknown bits set. remove won’t truncate other, but the ! operator will.

source

pub fn toggle(&mut self, other: Self)

The bitwise exclusive-or (^) of the bits in two flags values.

-
source

pub fn set(&mut self, other: Self, value: bool)

Call insert when value is true or remove when value is false.

+
source

pub fn set(&mut self, other: Self, value: bool)

Call insert when value is true or remove when value is false.

source

pub const fn intersection(self, other: Self) -> Self

The bitwise and (&) of the bits in two flags values.

source

pub const fn union(self, other: Self) -> Self

The bitwise or (|) of the bits in two flags values.

source

pub const fn difference(self, other: Self) -> Self

The intersection of a source flags value with the complement of a target flags value (&!).

@@ -52,44 +52,44 @@
source

pub const fn iter_names(&self) -> IterNames<CategoryType>

Yield a set of contained named flags values.

This method is like iter, except only yields bits in contained named flags. Any unknown bits, or bits not corresponding to a contained flag will not be yielded.

-
source§

impl CategoryType

source

pub fn count(self) -> u32

Trait Implementations§

source§

impl Binary for CategoryType

source§

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

Formats the value using the given formatter.
source§

impl BitAnd<CategoryType> for CategoryType

source§

fn bitand(self, other: Self) -> Self

The bitwise and (&) of the bits in two flags values.

-
§

type Output = CategoryType

The resulting type after applying the & operator.
source§

impl BitAndAssign<CategoryType> for CategoryType

source§

fn bitand_assign(&mut self, other: Self)

The bitwise and (&) of the bits in two flags values.

-
source§

impl BitOr<CategoryType> for CategoryType

source§

fn bitor(self, other: CategoryType) -> Self

The bitwise or (|) of the bits in two flags values.

-
§

type Output = CategoryType

The resulting type after applying the | operator.
source§

impl BitOrAssign<CategoryType> for CategoryType

source§

fn bitor_assign(&mut self, other: Self)

The bitwise or (|) of the bits in two flags values.

-
source§

impl BitXor<CategoryType> for CategoryType

source§

fn bitxor(self, other: Self) -> Self

The bitwise exclusive-or (^) of the bits in two flags values.

-
§

type Output = CategoryType

The resulting type after applying the ^ operator.
source§

impl BitXorAssign<CategoryType> for CategoryType

source§

fn bitxor_assign(&mut self, other: Self)

The bitwise exclusive-or (^) of the bits in two flags values.

-
source§

impl Clone for CategoryType

source§

fn clone(&self) -> CategoryType

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 CategoryType

source§

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

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

impl Default for CategoryType

source§

fn default() -> Self

Returns the “default value” for a type. Read more
source§

impl Extend<CategoryType> for CategoryType

source§

fn extend<T: IntoIterator<Item = Self>>(&mut self, iterator: T)

The bitwise or (|) of the bits in each flags value.

-
source§

fn extend_one(&mut self, item: A)

🔬This is a nightly-only experimental API. (extend_one)
Extends a collection with exactly one element.
source§

fn extend_reserve(&mut self, additional: usize)

🔬This is a nightly-only experimental API. (extend_one)
Reserves capacity in a collection for the given number of additional elements. Read more
source§

impl Flags for CategoryType

source§

const FLAGS: &'static [Flag<CategoryType>] = _

The set of defined flags.
§

type Bits = u32

The underlying bits type.
source§

fn bits(&self) -> u32

Get the underlying bits value. Read more
source§

fn from_bits_retain(bits: u32) -> CategoryType

Convert from a bits value exactly.
§

fn empty() -> Self

Get a flags value with all bits unset.
§

fn all() -> Self

Get a flags value with all known bits set.
§

fn from_bits(bits: Self::Bits) -> Option<Self>

Convert from a bits value. Read more
§

fn from_bits_truncate(bits: Self::Bits) -> Self

Convert from a bits value, unsetting any unknown bits.
§

fn from_name(name: &str) -> Option<Self>

Get a flags value with the bits of a flag with the given name set. Read more
§

fn iter(&self) -> Iter<Self>

Yield a set of contained flags values. Read more
§

fn iter_names(&self) -> IterNames<Self>

Yield a set of contained named flags values. Read more
§

fn is_empty(&self) -> bool

Whether all bits in this flags value are unset.
§

fn is_all(&self) -> bool

Whether all known bits in this flags value are set.
§

fn intersects(&self, other: Self) -> boolwhere - Self: Sized,

Whether any set bits in a source flags value are also set in a target flags value.
§

fn contains(&self, other: Self) -> boolwhere - Self: Sized,

Whether all set bits in a source flags value are also set in a target flags value.
§

fn insert(&mut self, other: Self)where - Self: Sized,

The bitwise or (|) of the bits in two flags values.
§

fn remove(&mut self, other: Self)where - Self: Sized,

The intersection of a source flags value with the complement of a target flags value (&!). Read more
§

fn toggle(&mut self, other: Self)where - Self: Sized,

The bitwise exclusive-or (^) of the bits in two flags values.
§

fn set(&mut self, other: Self, value: bool)where - Self: Sized,

Call [Flags::insert] when value is true or [Flags::remove] when value is false.
§

fn intersection(self, other: Self) -> Self

The bitwise and (&) of the bits in two flags values.
§

fn union(self, other: Self) -> Self

The bitwise or (|) of the bits in two flags values.
§

fn difference(self, other: Self) -> Self

The intersection of a source flags value with the complement of a target flags value (&!). Read more
§

fn symmetric_difference(self, other: Self) -> Self

The bitwise exclusive-or (^) of the bits in two flags values.
§

fn complement(self) -> Self

The bitwise negation (!) of the bits in a flags value, truncating the result.
source§

impl FromIterator<CategoryType> for CategoryType

source§

fn from_iter<T: IntoIterator<Item = Self>>(iterator: T) -> Self

The bitwise or (|) of the bits in each flags value.

-
source§

impl FromStr for CategoryType

§

type Err = SudachiError

The associated error which can be returned from parsing.
source§

fn from_str(s: &str) -> Result<Self, Self::Err>

Parses a string s to return a value of this type. Read more
source§

impl Hash for CategoryType

source§

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher. Read more
1.3.0 · source§

fn hash_slice<H>(data: &[Self], state: &mut H)where - H: Hasher, - Self: Sized,

Feeds a slice of this type into the given Hasher. Read more
source§

impl IntoIterator for CategoryType

§

type Item = CategoryType

The type of the elements being iterated over.
§

type IntoIter = Iter<CategoryType>

Which kind of iterator are we turning this into?
source§

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value. Read more
source§

impl LowerHex for CategoryType

source§

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

Formats the value using the given formatter.
source§

impl Not for CategoryType

source§

fn not(self) -> Self

The bitwise negation (!) of the bits in a flags value, truncating the result.

-
§

type Output = CategoryType

The resulting type after applying the ! operator.
source§

impl Octal for CategoryType

source§

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

Formats the value using the given formatter.
source§

impl PartialEq<CategoryType> for CategoryType

source§

fn eq(&self, other: &CategoryType) -> 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 PublicFlags for CategoryType

§

type Primitive = u32

The type of the underlying storage.
§

type Internal = InternalBitFlags

The type of the internal field on the generated flags type.
source§

impl Sub<CategoryType> for CategoryType

source§

fn sub(self, other: Self) -> Self

The intersection of a source flags value with the complement of a target flags value (&!).

+
source§

impl CategoryType

source

pub fn count(self) -> u32

Trait Implementations§

source§

impl Binary for CategoryType

source§

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

Formats the value using the given formatter.
source§

impl BitAnd for CategoryType

source§

fn bitand(self, other: Self) -> Self

The bitwise and (&) of the bits in two flags values.

+
§

type Output = CategoryType

The resulting type after applying the & operator.
source§

impl BitAndAssign for CategoryType

source§

fn bitand_assign(&mut self, other: Self)

The bitwise and (&) of the bits in two flags values.

+
source§

impl BitOr for CategoryType

source§

fn bitor(self, other: CategoryType) -> Self

The bitwise or (|) of the bits in two flags values.

+
§

type Output = CategoryType

The resulting type after applying the | operator.
source§

impl BitOrAssign for CategoryType

source§

fn bitor_assign(&mut self, other: Self)

The bitwise or (|) of the bits in two flags values.

+
source§

impl BitXor for CategoryType

source§

fn bitxor(self, other: Self) -> Self

The bitwise exclusive-or (^) of the bits in two flags values.

+
§

type Output = CategoryType

The resulting type after applying the ^ operator.
source§

impl BitXorAssign for CategoryType

source§

fn bitxor_assign(&mut self, other: Self)

The bitwise exclusive-or (^) of the bits in two flags values.

+
source§

impl Clone for CategoryType

source§

fn clone(&self) -> CategoryType

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 CategoryType

source§

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

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

impl Default for CategoryType

source§

fn default() -> Self

Returns the “default value” for a type. Read more
source§

impl Extend<CategoryType> for CategoryType

source§

fn extend<T: IntoIterator<Item = Self>>(&mut self, iterator: T)

The bitwise or (|) of the bits in each flags value.

+
source§

fn extend_one(&mut self, item: A)

🔬This is a nightly-only experimental API. (extend_one)
Extends a collection with exactly one element.
source§

fn extend_reserve(&mut self, additional: usize)

🔬This is a nightly-only experimental API. (extend_one)
Reserves capacity in a collection for the given number of additional elements. Read more
source§

impl Flags for CategoryType

source§

const FLAGS: &'static [Flag<CategoryType>] = _

The set of defined flags.
§

type Bits = u32

The underlying bits type.
source§

fn bits(&self) -> u32

Get the underlying bits value. Read more
source§

fn from_bits_retain(bits: u32) -> CategoryType

Convert from a bits value exactly.
§

fn empty() -> Self

Get a flags value with all bits unset.
§

fn all() -> Self

Get a flags value with all known bits set.
§

fn from_bits(bits: Self::Bits) -> Option<Self>

Convert from a bits value. Read more
§

fn from_bits_truncate(bits: Self::Bits) -> Self

Convert from a bits value, unsetting any unknown bits.
§

fn from_name(name: &str) -> Option<Self>

Get a flags value with the bits of a flag with the given name set. Read more
§

fn iter(&self) -> Iter<Self>

Yield a set of contained flags values. Read more
§

fn iter_names(&self) -> IterNames<Self>

Yield a set of contained named flags values. Read more
§

fn is_empty(&self) -> bool

Whether all bits in this flags value are unset.
§

fn is_all(&self) -> bool

Whether all known bits in this flags value are set.
§

fn intersects(&self, other: Self) -> boolwhere + Self: Sized,

Whether any set bits in a source flags value are also set in a target flags value.
§

fn contains(&self, other: Self) -> boolwhere + Self: Sized,

Whether all set bits in a source flags value are also set in a target flags value.
§

fn insert(&mut self, other: Self)where + Self: Sized,

The bitwise or (|) of the bits in two flags values.
§

fn remove(&mut self, other: Self)where + Self: Sized,

The intersection of a source flags value with the complement of a target flags value (&!). Read more
§

fn toggle(&mut self, other: Self)where + Self: Sized,

The bitwise exclusive-or (^) of the bits in two flags values.
§

fn set(&mut self, other: Self, value: bool)where + Self: Sized,

Call [Flags::insert] when value is true or [Flags::remove] when value is false.
§

fn intersection(self, other: Self) -> Self

The bitwise and (&) of the bits in two flags values.
§

fn union(self, other: Self) -> Self

The bitwise or (|) of the bits in two flags values.
§

fn difference(self, other: Self) -> Self

The intersection of a source flags value with the complement of a target flags value (&!). Read more
§

fn symmetric_difference(self, other: Self) -> Self

The bitwise exclusive-or (^) of the bits in two flags values.
§

fn complement(self) -> Self

The bitwise negation (!) of the bits in a flags value, truncating the result.
source§

impl FromIterator<CategoryType> for CategoryType

source§

fn from_iter<T: IntoIterator<Item = Self>>(iterator: T) -> Self

The bitwise or (|) of the bits in each flags value.

+
source§

impl FromStr for CategoryType

§

type Err = SudachiError

The associated error which can be returned from parsing.
source§

fn from_str(s: &str) -> Result<Self, Self::Err>

Parses a string s to return a value of this type. Read more
source§

impl Hash for CategoryType

source§

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher. Read more
1.3.0 · source§

fn hash_slice<H>(data: &[Self], state: &mut H)where + H: Hasher, + Self: Sized,

Feeds a slice of this type into the given Hasher. Read more
source§

impl IntoIterator for CategoryType

§

type Item = CategoryType

The type of the elements being iterated over.
§

type IntoIter = Iter<CategoryType>

Which kind of iterator are we turning this into?
source§

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value. Read more
source§

impl LowerHex for CategoryType

source§

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

Formats the value using the given formatter.
source§

impl Not for CategoryType

source§

fn not(self) -> Self

The bitwise negation (!) of the bits in a flags value, truncating the result.

+
§

type Output = CategoryType

The resulting type after applying the ! operator.
source§

impl Octal for CategoryType

source§

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

Formats the value using the given formatter.
source§

impl PartialEq for CategoryType

source§

fn eq(&self, other: &CategoryType) -> 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 PublicFlags for CategoryType

§

type Primitive = u32

The type of the underlying storage.
§

type Internal = InternalBitFlags

The type of the internal field on the generated flags type.
source§

impl Sub for CategoryType

source§

fn sub(self, other: Self) -> Self

The intersection of a source flags value with the complement of a target flags value (&!).

This method is not equivalent to self & !other when other has unknown bits set. difference won’t truncate other, but the ! operator will.

-
§

type Output = CategoryType

The resulting type after applying the - operator.
source§

impl SubAssign<CategoryType> for CategoryType

source§

fn sub_assign(&mut self, other: Self)

The intersection of a source flags value with the complement of a target flags value (&!).

+
§

type Output = CategoryType

The resulting type after applying the - operator.
source§

impl SubAssign for CategoryType

source§

fn sub_assign(&mut self, other: Self)

The intersection of a source flags value with the complement of a target flags value (&!).

This method is not equivalent to self & !other when other has unknown bits set. difference won’t truncate other, but the ! operator will.

-
source§

impl UpperHex for CategoryType

source§

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

Formats the value using the given formatter.
source§

impl Copy for CategoryType

source§

impl Eq for CategoryType

source§

impl StructuralEq for CategoryType

source§

impl StructuralPartialEq for CategoryType

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,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

source§

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

Mutably borrows from an owned value. Read more
§

impl<Q, K> Equivalent<K> for Qwhere - Q: Eq + ?Sized, - K: Borrow<Q> + ?Sized,

§

fn equivalent(&self, key: &K) -> bool

Checks if this value is equivalent to the given key. Read more
§

impl<Q, K> Equivalent<K> for Qwhere - Q: Eq + ?Sized, - K: Borrow<Q> + ?Sized,

§

fn equivalent(&self, key: &K) -> bool

Compare self to key and return true if they are equal.
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

-
source§

impl<T, U> Into<U> for Twhere - U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

+
source§

impl UpperHex for CategoryType

source§

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

Formats the value using the given formatter.
source§

impl Copy for CategoryType

source§

impl Eq for CategoryType

source§

impl StructuralEq for CategoryType

source§

impl StructuralPartialEq for CategoryType

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,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

source§

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

Mutably borrows from an owned value. Read more
§

impl<Q, K> Equivalent<K> for Qwhere + Q: Eq + ?Sized, + K: Borrow<Q> + ?Sized,

§

fn equivalent(&self, key: &K) -> bool

Checks if this value is equivalent to the given key. Read more
§

impl<Q, K> Equivalent<K> for Qwhere + Q: Eq + ?Sized, + K: Borrow<Q> + ?Sized,

§

fn equivalent(&self, key: &K) -> bool

Compare self to key and return true if they are equal.
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

+
source§

impl<T, U> Into<U> for Twhere + U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of -From<T> for U chooses to do.

-
source§

impl<T> ToOwned for Twhere - T: Clone,

§

type Owned = T

The resulting type after obtaining ownership.
source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
source§

impl<T, U> TryFrom<U> for Twhere - U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
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.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
\ No newline at end of file +From<T> for U chooses to do.

+
source§

impl<T> ToOwned for Twhere + T: Clone,

§

type Owned = T

The resulting type after obtaining ownership.
source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
source§

impl<T, U> TryFrom<U> for Twhere + U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
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.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
\ No newline at end of file diff --git a/rust/sudachi/dic/character_category/enum.Error.html b/rust/sudachi/dic/character_category/enum.Error.html index deaa1bb1..5c47e369 100644 --- a/rust/sudachi/dic/character_category/enum.Error.html +++ b/rust/sudachi/dic/character_category/enum.Error.html @@ -1,24 +1,24 @@ -Error in sudachi::dic::character_category - Rust
#[non_exhaustive]
pub enum Error { - InvalidFormat(usize), - InvalidCategoryType(usize, String), - MultipleTypeDefinition(usize, String), - InvalidChar(u32, usize), +Error in sudachi::dic::character_category - Rust
#[non_exhaustive]
pub enum Error { + InvalidFormat(usize), + InvalidCategoryType(usize, String), + MultipleTypeDefinition(usize, String), + InvalidChar(u32, usize), }
Expand description

Sudachi error

-

Variants (Non-exhaustive)§

This enum is marked as non-exhaustive
Non-exhaustive enums could have additional variants added in future. Therefore, when matching against variants of non-exhaustive enums, an extra wildcard arm must be added to account for any future variants.
§

InvalidFormat(usize)

§

InvalidCategoryType(usize, String)

§

MultipleTypeDefinition(usize, String)

§

InvalidChar(u32, usize)

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, __formatter: &mut Formatter<'_>) -> Result

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

impl Error for Error

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()
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, request: &mut Request<'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<Error> for SudachiError

source§

fn from(source: CharacterCategoryError) -> Self

Converts to this type from the input type.
source§

impl PartialEq<Error> for Error

source§

fn eq(&self, other: &Error) -> 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 Error

source§

impl StructuralEq for Error

source§

impl StructuralPartialEq for Error

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,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

source§

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

Mutably borrows from an owned value. Read more
§

impl<Q, K> Equivalent<K> for Qwhere - Q: Eq + ?Sized, - K: Borrow<Q> + ?Sized,

§

fn equivalent(&self, key: &K) -> bool

Checks if this value is equivalent to the given key. Read more
§

impl<Q, K> Equivalent<K> for Qwhere - Q: Eq + ?Sized, - K: Borrow<Q> + ?Sized,

§

fn equivalent(&self, key: &K) -> bool

Compare self to key and return true if they are equal.
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

-
source§

impl<T, U> Into<U> for Twhere - U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

+

Variants (Non-exhaustive)§

This enum is marked as non-exhaustive
Non-exhaustive enums could have additional variants added in future. Therefore, when matching against variants of non-exhaustive enums, an extra wildcard arm must be added to account for any future variants.
§

InvalidFormat(usize)

§

InvalidCategoryType(usize, String)

§

MultipleTypeDefinition(usize, String)

§

InvalidChar(u32, usize)

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, __formatter: &mut Formatter<'_>) -> Result

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

impl Error for Error

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()
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, request: &mut Request<'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<Error> for SudachiError

source§

fn from(source: CharacterCategoryError) -> Self

Converts to this type from the input type.
source§

impl PartialEq for Error

source§

fn eq(&self, other: &Error) -> 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 Error

source§

impl StructuralEq for Error

source§

impl StructuralPartialEq for Error

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,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

source§

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

Mutably borrows from an owned value. Read more
§

impl<Q, K> Equivalent<K> for Qwhere + Q: Eq + ?Sized, + K: Borrow<Q> + ?Sized,

§

fn equivalent(&self, key: &K) -> bool

Checks if this value is equivalent to the given key. Read more
§

impl<Q, K> Equivalent<K> for Qwhere + Q: Eq + ?Sized, + K: Borrow<Q> + ?Sized,

§

fn equivalent(&self, key: &K) -> bool

Compare self to key and return true if they are equal.
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

+
source§

impl<T, U> Into<U> for Twhere + U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of -From<T> for U chooses to do.

-
source§

impl<T> ToString for Twhere - T: Display + ?Sized,

source§

default fn to_string(&self) -> String

Converts the given value to a String. Read more
source§

impl<T, U> TryFrom<U> for Twhere - U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
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.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
\ No newline at end of file +From<T> for U chooses to do.

+
source§

impl<T> ToString for Twhere + T: Display + ?Sized,

source§

default fn to_string(&self) -> String

Converts the given value to a String. Read more
source§

impl<T, U> TryFrom<U> for Twhere + U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
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.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
\ No newline at end of file diff --git a/rust/sudachi/dic/character_category/index.html b/rust/sudachi/dic/character_category/index.html index 4cf48a64..98317e6e 100644 --- a/rust/sudachi/dic/character_category/index.html +++ b/rust/sudachi/dic/character_category/index.html @@ -1 +1 @@ -sudachi::dic::character_category - Rust

Structs

Enums

\ No newline at end of file +sudachi::dic::character_category - Rust

Structs

Enums

\ No newline at end of file diff --git a/rust/sudachi/dic/character_category/struct.CharCategoryIter.html b/rust/sudachi/dic/character_category/struct.CharCategoryIter.html index 82b45924..d3fbb4d8 100644 --- a/rust/sudachi/dic/character_category/struct.CharCategoryIter.html +++ b/rust/sudachi/dic/character_category/struct.CharCategoryIter.html @@ -1,594 +1,591 @@ -CharCategoryIter in sudachi::dic::character_category - Rust
pub struct CharCategoryIter<'a> { /* private fields */ }

Trait Implementations§

source§

impl Iterator for CharCategoryIter<'_>

§

type Item = (Range<char>, CategoryType)

The type of the elements being iterated over.
source§

fn next(&mut self) -> Option<Self::Item>

Advances the iterator and returns the next value. Read more
source§

fn next_chunk<const N: usize>( +CharCategoryIter in sudachi::dic::character_category - Rust
pub struct CharCategoryIter<'a> { /* private fields */ }

Trait Implementations§

source§

impl Iterator for CharCategoryIter<'_>

§

type Item = (Range<char>, CategoryType)

The type of the elements being iterated over.
source§

fn next(&mut self) -> Option<Self::Item>

Advances the iterator and returns the next value. Read more
source§

fn next_chunk<const N: usize>( &mut self -) -> Result<[Self::Item; N], IntoIter<Self::Item, N>>where - Self: Sized,

🔬This is a nightly-only experimental API. (iter_next_chunk)
Advances the iterator and returns an array containing the next N values. Read more
1.0.0 · source§

fn size_hint(&self) -> (usize, Option<usize>)

Returns the bounds on the remaining length of the iterator. Read more
1.0.0 · source§

fn count(self) -> usizewhere - Self: Sized,

Consumes the iterator, counting the number of iterations and returning it. Read more
1.0.0 · source§

fn last(self) -> Option<Self::Item>where - Self: Sized,

Consumes the iterator, returning the last element. Read more
source§

fn advance_by(&mut self, n: usize) -> Result<(), NonZeroUsize>

🔬This is a nightly-only experimental API. (iter_advance_by)
Advances the iterator by n elements. Read more
1.0.0 · source§

fn nth(&mut self, n: usize) -> Option<Self::Item>

Returns the nth element of the iterator. Read more
1.28.0 · source§

fn step_by(self, step: usize) -> StepBy<Self>where - Self: Sized,

Creates an iterator starting at the same point, but stepping by -the given amount at each iteration. Read more
1.0.0 · source§

fn chain<U>(self, other: U) -> Chain<Self, <U as IntoIterator>::IntoIter>where - Self: Sized, - U: IntoIterator<Item = Self::Item>,

Takes two iterators and creates a new iterator over both in sequence. Read more
1.0.0 · source§

fn zip<U>(self, other: U) -> Zip<Self, <U as IntoIterator>::IntoIter>where - Self: Sized, - U: IntoIterator,

‘Zips up’ two iterators into a single iterator of pairs. Read more
source§

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

🔬This is a nightly-only experimental API. (iter_intersperse)
Creates a new iterator which places an item generated by separator -between adjacent items of the original iterator. Read more
1.0.0 · source§

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

Takes a closure and creates an iterator which calls that closure on each -element. Read more
1.21.0 · source§

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

Calls a closure on each element of an iterator. Read more
1.0.0 · source§

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

Creates an iterator which uses a closure to determine if an element -should be yielded. Read more
1.0.0 · source§

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

Creates an iterator that both filters and maps. Read more
1.0.0 · source§

fn enumerate(self) -> Enumerate<Self>where - Self: Sized,

Creates an iterator which gives the current iteration count as well as -the next value. Read more
1.0.0 · source§

fn peekable(self) -> Peekable<Self>where - Self: Sized,

Creates an iterator which can use the peek and peek_mut methods +) -> Result<[Self::Item; N], IntoIter<Self::Item, N>>where + Self: Sized,

🔬This is a nightly-only experimental API. (iter_next_chunk)
Advances the iterator and returns an array containing the next N values. Read more
1.0.0 · source§

fn size_hint(&self) -> (usize, Option<usize>)

Returns the bounds on the remaining length of the iterator. Read more
1.0.0 · source§

fn count(self) -> usizewhere + Self: Sized,

Consumes the iterator, counting the number of iterations and returning it. Read more
1.0.0 · source§

fn last(self) -> Option<Self::Item>where + Self: Sized,

Consumes the iterator, returning the last element. Read more
source§

fn advance_by(&mut self, n: usize) -> Result<(), NonZeroUsize>

🔬This is a nightly-only experimental API. (iter_advance_by)
Advances the iterator by n elements. Read more
1.0.0 · source§

fn nth(&mut self, n: usize) -> Option<Self::Item>

Returns the nth element of the iterator. Read more
1.28.0 · source§

fn step_by(self, step: usize) -> StepBy<Self>where + Self: Sized,

Creates an iterator starting at the same point, but stepping by +the given amount at each iteration. Read more
1.0.0 · source§

fn chain<U>(self, other: U) -> Chain<Self, <U as IntoIterator>::IntoIter>where + Self: Sized, + U: IntoIterator<Item = Self::Item>,

Takes two iterators and creates a new iterator over both in sequence. Read more
1.0.0 · source§

fn zip<U>(self, other: U) -> Zip<Self, <U as IntoIterator>::IntoIter>where + Self: Sized, + U: IntoIterator,

‘Zips up’ two iterators into a single iterator of pairs. Read more
source§

fn intersperse_with<G>(self, separator: G) -> IntersperseWith<Self, G>where + Self: Sized, + G: FnMut() -> Self::Item,

🔬This is a nightly-only experimental API. (iter_intersperse)
Creates a new iterator which places an item generated by separator +between adjacent items of the original iterator. Read more
1.0.0 · source§

fn map<B, F>(self, f: F) -> Map<Self, F>where + Self: Sized, + F: FnMut(Self::Item) -> B,

Takes a closure and creates an iterator which calls that closure on each +element. Read more
1.21.0 · source§

fn for_each<F>(self, f: F)where + Self: Sized, + F: FnMut(Self::Item),

Calls a closure on each element of an iterator. Read more
1.0.0 · source§

fn filter<P>(self, predicate: P) -> Filter<Self, P>where + Self: Sized, + P: FnMut(&Self::Item) -> bool,

Creates an iterator which uses a closure to determine if an element +should be yielded. Read more
1.0.0 · source§

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F>where + Self: Sized, + F: FnMut(Self::Item) -> Option<B>,

Creates an iterator that both filters and maps. Read more
1.0.0 · source§

fn enumerate(self) -> Enumerate<Self>where + Self: Sized,

Creates an iterator which gives the current iteration count as well as +the next value. Read more
1.0.0 · source§

fn peekable(self) -> Peekable<Self>where + Self: Sized,

Creates an iterator which can use the peek and peek_mut methods to look at the next element of the iterator without consuming it. See -their documentation for more information. Read more
1.0.0 · source§

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

Creates an iterator that skips elements based on a predicate. Read more
1.0.0 · source§

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

Creates an iterator that yields elements based on a predicate. Read more
1.57.0 · source§

fn map_while<B, P>(self, predicate: P) -> MapWhile<Self, P>where - Self: Sized, - P: FnMut(Self::Item) -> Option<B>,

Creates an iterator that both yields elements based on a predicate and maps. Read more
1.0.0 · source§

fn skip(self, n: usize) -> Skip<Self>where - Self: Sized,

Creates an iterator that skips the first n elements. Read more
1.0.0 · source§

fn take(self, n: usize) -> Take<Self>where - Self: Sized,

Creates an iterator that yields the first n elements, or fewer -if the underlying iterator ends sooner. Read more
1.0.0 · source§

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F>where - Self: Sized, - F: FnMut(&mut St, Self::Item) -> Option<B>,

An iterator adapter which, like fold, holds internal state, but -unlike fold, produces a new iterator. Read more
1.0.0 · source§

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F>where - Self: Sized, - U: IntoIterator, - F: FnMut(Self::Item) -> U,

Creates an iterator that works like map, but flattens nested structure. Read more
source§

fn map_windows<F, R, const N: usize>(self, f: F) -> MapWindows<Self, F, N>where - Self: Sized, - F: FnMut(&[Self::Item; N]) -> R,

🔬This is a nightly-only experimental API. (iter_map_windows)
Calls the given function f for each contiguous window of size N over -self and returns an iterator over the outputs of f. Like slice::windows(), -the windows during mapping overlap as well. Read more
1.0.0 · source§

fn fuse(self) -> Fuse<Self>where - Self: Sized,

Creates an iterator which ends after the first None. Read more
1.0.0 · source§

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

Does something with each element of an iterator, passing the value on. Read more
1.0.0 · source§

fn by_ref(&mut self) -> &mut Selfwhere - Self: Sized,

Borrows an iterator, rather than consuming it. Read more
1.0.0 · source§

fn collect<B>(self) -> Bwhere - B: FromIterator<Self::Item>, - Self: Sized,

Transforms an iterator into a collection. Read more
source§

fn collect_into<E>(self, collection: &mut E) -> &mut Ewhere - E: Extend<Self::Item>, - Self: Sized,

🔬This is a nightly-only experimental API. (iter_collect_into)
Collects all the items from an iterator into a collection. Read more
1.0.0 · source§

fn partition<B, F>(self, f: F) -> (B, B)where - Self: Sized, - B: Default + Extend<Self::Item>, - F: FnMut(&Self::Item) -> bool,

Consumes an iterator, creating two collections from it. Read more
source§

fn is_partitioned<P>(self, predicate: P) -> boolwhere - Self: Sized, - P: FnMut(Self::Item) -> bool,

🔬This is a nightly-only experimental API. (iter_is_partitioned)
Checks if the elements of this iterator are partitioned according to the given predicate, -such that all those that return true precede all those that return false. Read more
1.27.0 · source§

fn try_fold<B, F, R>(&mut self, init: B, f: F) -> Rwhere - Self: Sized, - F: FnMut(B, Self::Item) -> R, - R: Try<Output = B>,

An iterator method that applies a function as long as it returns -successfully, producing a single, final value. Read more
1.27.0 · source§

fn try_for_each<F, R>(&mut self, f: F) -> Rwhere - Self: Sized, - F: FnMut(Self::Item) -> R, - R: Try<Output = ()>,

An iterator method that applies a fallible function to each item in the -iterator, stopping at the first error and returning that error. Read more
1.0.0 · source§

fn fold<B, F>(self, init: B, f: F) -> Bwhere - Self: Sized, - F: FnMut(B, Self::Item) -> B,

Folds every element into an accumulator by applying an operation, -returning the final result. Read more
1.51.0 · source§

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

Reduces the elements to a single one, by repeatedly applying a reducing -operation. Read more
source§

fn try_reduce<F, R>( +their documentation for more information. Read more

1.0.0 · source§

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P>where + Self: Sized, + P: FnMut(&Self::Item) -> bool,

Creates an iterator that skips elements based on a predicate. Read more
1.0.0 · source§

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P>where + Self: Sized, + P: FnMut(&Self::Item) -> bool,

Creates an iterator that yields elements based on a predicate. Read more
1.57.0 · source§

fn map_while<B, P>(self, predicate: P) -> MapWhile<Self, P>where + Self: Sized, + P: FnMut(Self::Item) -> Option<B>,

Creates an iterator that both yields elements based on a predicate and maps. Read more
1.0.0 · source§

fn skip(self, n: usize) -> Skip<Self>where + Self: Sized,

Creates an iterator that skips the first n elements. Read more
1.0.0 · source§

fn take(self, n: usize) -> Take<Self>where + Self: Sized,

Creates an iterator that yields the first n elements, or fewer +if the underlying iterator ends sooner. Read more
1.0.0 · source§

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F>where + Self: Sized, + F: FnMut(&mut St, Self::Item) -> Option<B>,

An iterator adapter which, like fold, holds internal state, but +unlike fold, produces a new iterator. Read more
1.0.0 · source§

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F>where + Self: Sized, + U: IntoIterator, + F: FnMut(Self::Item) -> U,

Creates an iterator that works like map, but flattens nested structure. Read more
source§

fn map_windows<F, R, const N: usize>(self, f: F) -> MapWindows<Self, F, N>where + Self: Sized, + F: FnMut(&[Self::Item; N]) -> R,

🔬This is a nightly-only experimental API. (iter_map_windows)
Calls the given function f for each contiguous window of size N over +self and returns an iterator over the outputs of f. Like slice::windows(), +the windows during mapping overlap as well. Read more
1.0.0 · source§

fn fuse(self) -> Fuse<Self>where + Self: Sized,

Creates an iterator which ends after the first None. Read more
1.0.0 · source§

fn inspect<F>(self, f: F) -> Inspect<Self, F>where + Self: Sized, + F: FnMut(&Self::Item),

Does something with each element of an iterator, passing the value on. Read more
1.0.0 · source§

fn by_ref(&mut self) -> &mut Selfwhere + Self: Sized,

Borrows an iterator, rather than consuming it. Read more
1.0.0 · source§

fn collect<B>(self) -> Bwhere + B: FromIterator<Self::Item>, + Self: Sized,

Transforms an iterator into a collection. Read more
source§

fn collect_into<E>(self, collection: &mut E) -> &mut Ewhere + E: Extend<Self::Item>, + Self: Sized,

🔬This is a nightly-only experimental API. (iter_collect_into)
Collects all the items from an iterator into a collection. Read more
1.0.0 · source§

fn partition<B, F>(self, f: F) -> (B, B)where + Self: Sized, + B: Default + Extend<Self::Item>, + F: FnMut(&Self::Item) -> bool,

Consumes an iterator, creating two collections from it. Read more
source§

fn is_partitioned<P>(self, predicate: P) -> boolwhere + Self: Sized, + P: FnMut(Self::Item) -> bool,

🔬This is a nightly-only experimental API. (iter_is_partitioned)
Checks if the elements of this iterator are partitioned according to the given predicate, +such that all those that return true precede all those that return false. Read more
1.27.0 · source§

fn try_fold<B, F, R>(&mut self, init: B, f: F) -> Rwhere + Self: Sized, + F: FnMut(B, Self::Item) -> R, + R: Try<Output = B>,

An iterator method that applies a function as long as it returns +successfully, producing a single, final value. Read more
1.27.0 · source§

fn try_for_each<F, R>(&mut self, f: F) -> Rwhere + Self: Sized, + F: FnMut(Self::Item) -> R, + R: Try<Output = ()>,

An iterator method that applies a fallible function to each item in the +iterator, stopping at the first error and returning that error. Read more
1.0.0 · source§

fn fold<B, F>(self, init: B, f: F) -> Bwhere + Self: Sized, + F: FnMut(B, Self::Item) -> B,

Folds every element into an accumulator by applying an operation, +returning the final result. Read more
1.51.0 · source§

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

Reduces the elements to a single one, by repeatedly applying a reducing +operation. Read more
source§

fn try_reduce<F, R>( &mut self, f: F -) -> <<R as Try>::Residual as Residual<Option<<R as Try>::Output>>>::TryTypewhere - Self: Sized, - F: FnMut(Self::Item, Self::Item) -> R, - R: Try<Output = Self::Item>, - <R as Try>::Residual: Residual<Option<Self::Item>>,

🔬This is a nightly-only experimental API. (iterator_try_reduce)
Reduces the elements to a single one by repeatedly applying a reducing operation. If the -closure returns a failure, the failure is propagated back to the caller immediately. Read more
1.0.0 · source§

fn all<F>(&mut self, f: F) -> boolwhere - Self: Sized, - F: FnMut(Self::Item) -> bool,

Tests if every element of the iterator matches a predicate. Read more
1.0.0 · source§

fn any<F>(&mut self, f: F) -> boolwhere - Self: Sized, - F: FnMut(Self::Item) -> bool,

Tests if any element of the iterator matches a predicate. Read more
1.0.0 · source§

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

Searches for an element of an iterator that satisfies a predicate. Read more
1.30.0 · source§

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

Applies function to the elements of iterator and returns -the first non-none result. Read more
source§

fn try_find<F, R>( +) -> <<R as Try>::Residual as Residual<Option<<R as Try>::Output>>>::TryTypewhere + Self: Sized, + F: FnMut(Self::Item, Self::Item) -> R, + R: Try<Output = Self::Item>, + <R as Try>::Residual: Residual<Option<Self::Item>>,

🔬This is a nightly-only experimental API. (iterator_try_reduce)
Reduces the elements to a single one by repeatedly applying a reducing operation. If the +closure returns a failure, the failure is propagated back to the caller immediately. Read more
1.0.0 · source§

fn all<F>(&mut self, f: F) -> boolwhere + Self: Sized, + F: FnMut(Self::Item) -> bool,

Tests if every element of the iterator matches a predicate. Read more
1.0.0 · source§

fn any<F>(&mut self, f: F) -> boolwhere + Self: Sized, + F: FnMut(Self::Item) -> bool,

Tests if any element of the iterator matches a predicate. Read more
1.0.0 · source§

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

Searches for an element of an iterator that satisfies a predicate. Read more
1.30.0 · source§

fn find_map<B, F>(&mut self, f: F) -> Option<B>where + Self: Sized, + F: FnMut(Self::Item) -> Option<B>,

Applies function to the elements of iterator and returns +the first non-none result. Read more
source§

fn try_find<F, R>( &mut self, f: F -) -> <<R as Try>::Residual as Residual<Option<Self::Item>>>::TryTypewhere - Self: Sized, - F: FnMut(&Self::Item) -> R, - R: Try<Output = bool>, - <R as Try>::Residual: Residual<Option<Self::Item>>,

🔬This is a nightly-only experimental API. (try_find)
Applies function to the elements of iterator and returns -the first true result or the first error. Read more
1.0.0 · source§

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

Searches for an element in an iterator, returning its index. Read more
1.6.0 · source§

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item>where - B: Ord, - Self: Sized, - F: FnMut(&Self::Item) -> B,

Returns the element that gives the maximum value from the -specified function. Read more
1.15.0 · source§

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

Returns the element that gives the maximum value with respect to the -specified comparison function. Read more
1.6.0 · source§

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item>where - B: Ord, - Self: Sized, - F: FnMut(&Self::Item) -> B,

Returns the element that gives the minimum value from the -specified function. Read more
1.15.0 · source§

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

Returns the element that gives the minimum value with respect to the -specified comparison function. Read more
1.0.0 · source§

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB)where - FromA: Default + Extend<A>, - FromB: Default + Extend<B>, - Self: Sized + Iterator<Item = (A, B)>,

Converts an iterator of pairs into a pair of containers. Read more
1.36.0 · source§

fn copied<'a, T>(self) -> Copied<Self>where - T: 'a + Copy, - Self: Sized + Iterator<Item = &'a T>,

Creates an iterator which copies all of its elements. Read more
1.0.0 · source§

fn cloned<'a, T>(self) -> Cloned<Self>where - T: 'a + Clone, - Self: Sized + Iterator<Item = &'a T>,

Creates an iterator which clones all of its elements. Read more
source§

fn array_chunks<const N: usize>(self) -> ArrayChunks<Self, N>where - Self: Sized,

🔬This is a nightly-only experimental API. (iter_array_chunks)
Returns an iterator over N elements of the iterator at a time. Read more
1.11.0 · source§

fn sum<S>(self) -> Swhere - Self: Sized, - S: Sum<Self::Item>,

Sums the elements of an iterator. Read more
1.11.0 · source§

fn product<P>(self) -> Pwhere - Self: Sized, - P: Product<Self::Item>,

Iterates over the entire iterator, multiplying all the elements Read more
source§

fn cmp_by<I, F>(self, other: I, cmp: F) -> Orderingwhere - Self: Sized, - I: IntoIterator, - F: FnMut(Self::Item, <I as IntoIterator>::Item) -> Ordering,

🔬This is a nightly-only experimental API. (iter_order_by)
Lexicographically compares the elements of this Iterator with those -of another with respect to the specified comparison function. Read more
1.5.0 · source§

fn partial_cmp<I>(self, other: I) -> Option<Ordering>where - I: IntoIterator, - Self::Item: PartialOrd<<I as IntoIterator>::Item>, - Self: Sized,

Lexicographically compares the PartialOrd elements of -this Iterator with those of another. The comparison works like short-circuit +) -> <<R as Try>::Residual as Residual<Option<Self::Item>>>::TryTypewhere + Self: Sized, + F: FnMut(&Self::Item) -> R, + R: Try<Output = bool>, + <R as Try>::Residual: Residual<Option<Self::Item>>,
🔬This is a nightly-only experimental API. (try_find)
Applies function to the elements of iterator and returns +the first true result or the first error. Read more
1.0.0 · source§

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

Searches for an element in an iterator, returning its index. Read more
1.6.0 · source§

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item>where + B: Ord, + Self: Sized, + F: FnMut(&Self::Item) -> B,

Returns the element that gives the maximum value from the +specified function. Read more
1.15.0 · source§

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

Returns the element that gives the maximum value with respect to the +specified comparison function. Read more
1.6.0 · source§

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item>where + B: Ord, + Self: Sized, + F: FnMut(&Self::Item) -> B,

Returns the element that gives the minimum value from the +specified function. Read more
1.15.0 · source§

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

Returns the element that gives the minimum value with respect to the +specified comparison function. Read more
1.0.0 · source§

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB)where + FromA: Default + Extend<A>, + FromB: Default + Extend<B>, + Self: Sized + Iterator<Item = (A, B)>,

Converts an iterator of pairs into a pair of containers. Read more
1.36.0 · source§

fn copied<'a, T>(self) -> Copied<Self>where + T: 'a + Copy, + Self: Sized + Iterator<Item = &'a T>,

Creates an iterator which copies all of its elements. Read more
1.0.0 · source§

fn cloned<'a, T>(self) -> Cloned<Self>where + T: 'a + Clone, + Self: Sized + Iterator<Item = &'a T>,

Creates an iterator which clones all of its elements. Read more
source§

fn array_chunks<const N: usize>(self) -> ArrayChunks<Self, N>where + Self: Sized,

🔬This is a nightly-only experimental API. (iter_array_chunks)
Returns an iterator over N elements of the iterator at a time. Read more
1.11.0 · source§

fn sum<S>(self) -> Swhere + Self: Sized, + S: Sum<Self::Item>,

Sums the elements of an iterator. Read more
1.11.0 · source§

fn product<P>(self) -> Pwhere + Self: Sized, + P: Product<Self::Item>,

Iterates over the entire iterator, multiplying all the elements Read more
source§

fn cmp_by<I, F>(self, other: I, cmp: F) -> Orderingwhere + Self: Sized, + I: IntoIterator, + F: FnMut(Self::Item, <I as IntoIterator>::Item) -> Ordering,

🔬This is a nightly-only experimental API. (iter_order_by)
Lexicographically compares the elements of this Iterator with those +of another with respect to the specified comparison function. Read more
1.5.0 · source§

fn partial_cmp<I>(self, other: I) -> Option<Ordering>where + I: IntoIterator, + Self::Item: PartialOrd<<I as IntoIterator>::Item>, + Self: Sized,

Lexicographically compares the PartialOrd elements of +this Iterator with those of another. The comparison works like short-circuit evaluation, returning a result without comparing the remaining elements. -As soon as an order can be determined, the evaluation stops and a result is returned. Read more
source§

fn partial_cmp_by<I, F>(self, other: I, partial_cmp: F) -> Option<Ordering>where - Self: Sized, - I: IntoIterator, - F: FnMut(Self::Item, <I as IntoIterator>::Item) -> Option<Ordering>,

🔬This is a nightly-only experimental API. (iter_order_by)
Lexicographically compares the elements of this Iterator with those -of another with respect to the specified comparison function. Read more
1.5.0 · source§

fn eq<I>(self, other: I) -> boolwhere - I: IntoIterator, - Self::Item: PartialEq<<I as IntoIterator>::Item>, - Self: Sized,

Determines if the elements of this Iterator are equal to those of -another. Read more
source§

fn eq_by<I, F>(self, other: I, eq: F) -> boolwhere - Self: Sized, - I: IntoIterator, - F: FnMut(Self::Item, <I as IntoIterator>::Item) -> bool,

🔬This is a nightly-only experimental API. (iter_order_by)
Determines if the elements of this Iterator are equal to those of -another with respect to the specified equality function. Read more
1.5.0 · source§

fn ne<I>(self, other: I) -> boolwhere - I: IntoIterator, - Self::Item: PartialEq<<I as IntoIterator>::Item>, - Self: Sized,

Determines if the elements of this Iterator are not equal to those of -another. Read more
1.5.0 · source§

fn lt<I>(self, other: I) -> boolwhere - I: IntoIterator, - Self::Item: PartialOrd<<I as IntoIterator>::Item>, - Self: Sized,

Determines if the elements of this Iterator are lexicographically -less than those of another. Read more
1.5.0 · source§

fn le<I>(self, other: I) -> boolwhere - I: IntoIterator, - Self::Item: PartialOrd<<I as IntoIterator>::Item>, - Self: Sized,

Determines if the elements of this Iterator are lexicographically -less or equal to those of another. Read more
1.5.0 · source§

fn gt<I>(self, other: I) -> boolwhere - I: IntoIterator, - Self::Item: PartialOrd<<I as IntoIterator>::Item>, - Self: Sized,

Determines if the elements of this Iterator are lexicographically -greater than those of another. Read more
1.5.0 · source§

fn ge<I>(self, other: I) -> boolwhere - I: IntoIterator, - Self::Item: PartialOrd<<I as IntoIterator>::Item>, - Self: Sized,

Determines if the elements of this Iterator are lexicographically -greater than or equal to those of another. Read more
source§

fn is_sorted_by<F>(self, compare: F) -> boolwhere - Self: Sized, - F: FnMut(&Self::Item, &Self::Item) -> Option<Ordering>,

🔬This is a nightly-only experimental API. (is_sorted)
Checks if the elements of this iterator are sorted using the given comparator function. Read more
source§

fn is_sorted_by_key<F, K>(self, f: F) -> boolwhere - Self: Sized, - F: FnMut(Self::Item) -> K, - K: PartialOrd<K>,

🔬This is a nightly-only experimental API. (is_sorted)
Checks if the elements of this iterator are sorted using the given key extraction -function. Read more
source§

impl FusedIterator for CharCategoryIter<'_>

Auto Trait Implementations§

§

impl<'a> RefUnwindSafe for CharCategoryIter<'a>

§

impl<'a> Send for CharCategoryIter<'a>

§

impl<'a> Sync for CharCategoryIter<'a>

§

impl<'a> Unpin for CharCategoryIter<'a>

§

impl<'a> UnwindSafe for CharCategoryIter<'a>

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,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

source§

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

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

-
source§

impl<T, U> Into<U> for Twhere - U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

+As soon as an order can be determined, the evaluation stops and a result is returned. Read more
source§

fn partial_cmp_by<I, F>(self, other: I, partial_cmp: F) -> Option<Ordering>where + Self: Sized, + I: IntoIterator, + F: FnMut(Self::Item, <I as IntoIterator>::Item) -> Option<Ordering>,

🔬This is a nightly-only experimental API. (iter_order_by)
Lexicographically compares the elements of this Iterator with those +of another with respect to the specified comparison function. Read more
1.5.0 · source§

fn eq<I>(self, other: I) -> boolwhere + I: IntoIterator, + Self::Item: PartialEq<<I as IntoIterator>::Item>, + Self: Sized,

Determines if the elements of this Iterator are equal to those of +another. Read more
source§

fn eq_by<I, F>(self, other: I, eq: F) -> boolwhere + Self: Sized, + I: IntoIterator, + F: FnMut(Self::Item, <I as IntoIterator>::Item) -> bool,

🔬This is a nightly-only experimental API. (iter_order_by)
Determines if the elements of this Iterator are equal to those of +another with respect to the specified equality function. Read more
1.5.0 · source§

fn ne<I>(self, other: I) -> boolwhere + I: IntoIterator, + Self::Item: PartialEq<<I as IntoIterator>::Item>, + Self: Sized,

Determines if the elements of this Iterator are not equal to those of +another. Read more
1.5.0 · source§

fn lt<I>(self, other: I) -> boolwhere + I: IntoIterator, + Self::Item: PartialOrd<<I as IntoIterator>::Item>, + Self: Sized,

Determines if the elements of this Iterator are lexicographically +less than those of another. Read more
1.5.0 · source§

fn le<I>(self, other: I) -> boolwhere + I: IntoIterator, + Self::Item: PartialOrd<<I as IntoIterator>::Item>, + Self: Sized,

Determines if the elements of this Iterator are lexicographically +less or equal to those of another. Read more
1.5.0 · source§

fn gt<I>(self, other: I) -> boolwhere + I: IntoIterator, + Self::Item: PartialOrd<<I as IntoIterator>::Item>, + Self: Sized,

Determines if the elements of this Iterator are lexicographically +greater than those of another. Read more
1.5.0 · source§

fn ge<I>(self, other: I) -> boolwhere + I: IntoIterator, + Self::Item: PartialOrd<<I as IntoIterator>::Item>, + Self: Sized,

Determines if the elements of this Iterator are lexicographically +greater than or equal to those of another. Read more
source§

fn is_sorted_by<F>(self, compare: F) -> boolwhere + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> Option<Ordering>,

🔬This is a nightly-only experimental API. (is_sorted)
Checks if the elements of this iterator are sorted using the given comparator function. Read more
source§

fn is_sorted_by_key<F, K>(self, f: F) -> boolwhere + Self: Sized, + F: FnMut(Self::Item) -> K, + K: PartialOrd,

🔬This is a nightly-only experimental API. (is_sorted)
Checks if the elements of this iterator are sorted using the given key extraction +function. Read more
source§

impl FusedIterator for CharCategoryIter<'_>

Auto Trait Implementations§

§

impl<'a> RefUnwindSafe for CharCategoryIter<'a>

§

impl<'a> Send for CharCategoryIter<'a>

§

impl<'a> Sync for CharCategoryIter<'a>

§

impl<'a> Unpin for CharCategoryIter<'a>

§

impl<'a> UnwindSafe for CharCategoryIter<'a>

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,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

source§

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

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

+
source§

impl<T, U> Into<U> for Twhere + U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of -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>( +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>( 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>( +) -> 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, 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 +) -> 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( self, - element: Self::Item -) -> IntersperseWith<Self, IntersperseElementSimple<Self::Item>>where - Self: Sized, - Self::Item: Clone,

An iterator adaptor to insert a particular value + 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 - Self: Sized, - F: FnMut() -> Self::Item,

An iterator adaptor to insert a particular value created by a function + 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>( 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 - J: IntoIterator, - Self: Sized,

Create an iterator which iterates over both this and the specified +) -> 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 + 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 - F: FnMut(&mut Self) -> Option<B>, - Self: Sized,

A “meta iterator adaptor”. Its closure receives a reference to the + 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 - Self: Sized, - F: FnMut(&Self::Item) -> K, - K: PartialEq<K>,

Return an iterable that can group iterator elements. + Self: Sized, + F: FnMut(&Self::Item) -> K, + K: PartialEq,
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 - Self: Sized + Iterator<Item = <T as TupleCollect>::Item>, +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 + <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 - 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 + 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 - Self: Sized + Iterator<Item = <T as TupleCollect>::Item>, + 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 - 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 - Self: Sized,

👎Deprecated since 0.8.0: Use std .step_by() instead
Return an iterator adaptor that steps n elements in the base iterator + 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 + 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 - 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: 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, 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
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 + Self: Iterator<Item = Result<T, E>> + Sized, + F: FnMut(T) -> U,
👎Deprecated since 0.10.0: Use .map_ok() instead
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 - Self: Iterator<Item = Result<T, E>> + Sized, - F: FnMut(&T) -> bool,

Return an iterator adaptor that filters every Result::Ok + 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 - Self: Iterator<Item = Result<T, E>> + Sized, - F: FnMut(T) -> Option<U>,

Return an iterator adaptor that filters and transforms every + 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 - 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 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 + 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 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 - Self: Sized, - Self::Item: PartialOrd<Self::Item>, - J: IntoIterator<Item = Self::Item>,

Return an iterator adaptor that merges the two base iterators in +) -> MergeBy<Self, <J as IntoIterator>::IntoIter, MergeLte>where + Self: Sized, + Self::Item: PartialOrd, + 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>( self, other: J, is_first: F -) -> MergeBy<Self, <J as IntoIterator>::IntoIter, F>where - Self: 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. +) -> MergeBy<Self, <J as IntoIterator>::IntoIter, F>where + Self: 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, T>( self, other: J, cmp_fn: F -) -> MergeBy<Self, <J as IntoIterator>::IntoIter, MergeFuncLR<F, <F as FuncLR<Self::Item, <<J as IntoIterator>::IntoIter as Iterator>::Item>>::T>>where - J: IntoIterator, - F: FnMut(&Self::Item, &<J as IntoIterator>::Item) -> T, - 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 - 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 +) -> MergeBy<Self, <J as IntoIterator>::IntoIter, MergeFuncLR<F, <F as FuncLR<Self::Item, <<J as IntoIterator>::IntoIter as Iterator>::Item>>::T>>where + J: IntoIterator, + F: FnMut(&Self::Item, &<J as IntoIterator>::Item) -> T, + 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 + Self: Sized, + Self::Item: IntoIterator, + <Self::Item as IntoIterator>::Item: PartialOrd,

Return an iterator adaptor that flattens an iterator of iterators by 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 +) -> 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>( self, other: J -) -> Product<Self, <J as IntoIterator>::IntoIter>where - Self: Sized, - Self::Item: Clone, - J: IntoIterator, - <J as IntoIterator>::IntoIter: Clone,

Return an iterator adaptor that iterates over the cartesian product of +) -> Product<Self, <J as IntoIterator>::IntoIter>where + Self: Sized, + Self::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( 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 - 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 - Self: Sized, - Self::Item: PartialEq<Self::Item>,

Remove duplicates from sections of consecutive identical elements. +) -> 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 + 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 + Self: Sized, + Self::Item: PartialEq,

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>( 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, +) -> 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( self -) -> CoalesceBy<Self, DedupPredWithCount2CoalescePred<DedupEq>, (usize, Self::Item)>where - Self: Sized,

Remove duplicates from sections of consecutive identical elements, while keeping a count of +) -> 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>( self, cmp: Cmp -) -> CoalesceBy<Self, DedupPredWithCount2CoalescePred<Cmp>, (usize, Self::Item)>where - Self: Sized, - Cmp: FnMut(&Self::Item, &Self::Item) -> bool,

Remove duplicates from sections of consecutive identical elements, while keeping a count of +) -> CoalesceBy<Self, DedupPredWithCount2CoalescePred<Cmp>, (usize, Self::Item)>where + Self: Sized, + Cmp: 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 - Self: Sized, - Self::Item: Eq + Hash,

Return an iterator adaptor that produces elements that appear more than once during the +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 - Self: Sized, - V: Eq + Hash, - F: FnMut(&Self::Item) -> V,

Return an iterator adaptor that produces elements that appear more than once during the + 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 - Self: Sized, - Self::Item: Clone + Eq + Hash,

Return an iterator adaptor that filters out elements that have + 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 - Self: Sized, - V: Eq + Hash, - F: FnMut(&Self::Item) -> V,

Return an iterator adaptor that filters out elements that have + 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 - Self: Sized + PeekingNext, - F: FnMut(&Self::Item) -> bool,

Return an iterator adaptor that borrows from this iterator and + 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 - Self: Clone, - F: FnMut(&Self::Item) -> bool,

Return an iterator adaptor that borrows from a Clone-able iterator + 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 take_while_inclusive<F>(self, accept: F) -> TakeWhileInclusive<Self, F>where - Self: Sized, - F: FnMut(&Self::Item) -> bool,

Returns an iterator adaptor that consumes elements while the given + 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 + 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 - Self: Sized + Clone, - Self::Item: Clone, + 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 - Self: Sized, - Self::Item: Clone,

Return an iterator adaptor that iterates over the k-length combinations of +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( self, - k: usize + 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 - Self: Sized, - Self::Item: Clone,

Return an iterator adaptor that iterates over all k-permutations of the + 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 + 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 - 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 - Self: Sized, - F: FnMut(usize) -> Self::Item,

Return an iterator adaptor that pads the sequence to a minimum length of + 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 + 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 combines each element with a Position to + 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 + 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 - 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 - Self: Sized + Iterator<Item = <T as TupleCollect>::Item>, + 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 + 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 - Self: Sized + Iterator<Item = <T as TupleCollect>::Item>, +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 - 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 - 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 - 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 - Self: Sized, - Self::Item: PartialEq<Self::Item>,

Check whether all elements compare equal. Read more
source§

fn all_equal_value( +(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 + 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 + Self: Sized, + Self::Item: Borrow<Q>, + Q: PartialEq,

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,

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: PartialEq<Self::Item>,

If there are elements and they are all equal, return a single copy of that element. +) -> Result<Self::Item, Option<(Self::Item, Self::Item)>>where + Self: Sized, + Self::Item: PartialEq,
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 - Self: Sized + DoubleEndedIterator,

Consume the last n elements from the iterator eagerly, +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 + 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 - 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, - 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 - 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 + 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, + 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>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 + 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 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 - 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 - Self: Iterator<Item = Result<A, E>>, - F: FnMut(B, A) -> B,

👎Deprecated since 0.10.0: Use .fold_ok() instead
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 - 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(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 - 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, - 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 - 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 - 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: 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 - 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 - 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: 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 - 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 - 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 - 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: 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 - 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 - 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>( - 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 + 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 + 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 + Self: Iterator<Item = Result<A, E>>, + F: FnMut(B, A) -> B,

👎Deprecated since 0.10.0: Use .fold_ok() instead
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 + 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(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 + 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, + 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 + 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>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>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>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>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>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>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>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>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: 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 + 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>>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>(self, f: F) -> HashMap<K, Vec<V>>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 - Self: Iterator<Item = (K, V)> + Sized, - K: Hash + Eq,

Constructs a GroupingMap to be used later with one of the efficient + 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>( 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 - 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: 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 - 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 - 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: 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 - Self: Sized, - K: Ord, - 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: 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 - 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 - 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: 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 - 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 - 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: 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 - 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 - 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 - 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 - 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 - Self: Sized,

If the iterator yields exactly one element, that element will be returned, otherwise + 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>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>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>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>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>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>where + Self: Sized, + K: Ord, + 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,

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, + 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 + 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 + 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: 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 + 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 + 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: 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 + 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 + Self: Sized, + Self::Item: PartialOrd,

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 + Self: Sized, + K: PartialOrd, + 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 + 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 + 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 - Self: Sized,

If the iterator yields no elements, Ok(None) will be returned. If the iterator yields +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 - 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 - Self: Sized, - Self::Item: Eq + Hash,

Collect the items in this iterator and return a HashMap which + 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>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 - Self: Sized, - K: Eq + Hash, - F: FnMut(Self::Item) -> K,

Collect the items in this iterator and return a HashMap which +of times it appears. Read more
source§

fn counts_by<K, F>(self, f: F) -> HashMap<K, usize>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 - Self: Sized + MultiUnzip<FromI>,

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

fn try_len(&self) -> Result<usize, (usize, Option<usize>)>

Returns the length of the iterator if one exists. -Otherwise return self.size_hint(). Read more
source§

impl<IT, A, FromA, B, FromB> MultiUnzip<(FromA, FromB)> for ITwhere - IT: Iterator<Item = (A, B)>, - FromA: Default + Extend<A>, - FromB: Default + Extend<B>,

source§

fn multiunzip(self) -> (FromA, FromB)

Unzip this iterator into multiple collections.
source§

impl<T, U> TryFrom<U> for Twhere - U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
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.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
\ No newline at end of file +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§

fn try_len(&self) -> Result<usize, (usize, Option<usize>)>

Returns the length of the iterator if one exists. +Otherwise return self.size_hint(). Read more
source§

impl<IT, A, FromA, B, FromB> MultiUnzip<(FromA, FromB)> for ITwhere + IT: Iterator<Item = (A, B)>, + FromA: Default + Extend<A>, + FromB: Default + Extend<B>,

source§

fn multiunzip(self) -> (FromA, FromB)

Unzip this iterator into multiple collections.
source§

impl<T, U> TryFrom<U> for Twhere + U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
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.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
\ No newline at end of file diff --git a/rust/sudachi/dic/character_category/struct.CharacterCategory.html b/rust/sudachi/dic/character_category/struct.CharacterCategory.html index 4b24ab48..6c068b36 100644 --- a/rust/sudachi/dic/character_category/struct.CharacterCategory.html +++ b/rust/sudachi/dic/character_category/struct.CharacterCategory.html @@ -1,15 +1,15 @@ -CharacterCategory in sudachi::dic::character_category - Rust
pub struct CharacterCategory { /* private fields */ }
Expand description

CharacterCategory holds mapping from character to character category type

-

Implementations§

source§

impl CharacterCategory

source

pub fn from_file(path: &Path) -> SudachiResult<CharacterCategory>

Creates a character category from file

-
source

pub fn from_reader<T: BufRead>(data: T) -> SudachiResult<CharacterCategory>

source

pub fn get_category_types(&self, c: char) -> CategoryType

Returns a set of category types which given char has

-
source

pub fn iter(&self) -> CharCategoryIter<'_>

Trait Implementations§

source§

impl Clone for CharacterCategory

source§

fn clone(&self) -> CharacterCategory

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 CharacterCategory

source§

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

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

impl Default for CharacterCategory

source§

fn default() -> Self

Returns the “default value” for a type. 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,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

source§

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

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

-
source§

impl<T, U> Into<U> for Twhere - U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

+CharacterCategory in sudachi::dic::character_category - Rust
pub struct CharacterCategory { /* private fields */ }
Expand description

CharacterCategory holds mapping from character to character category type

+

Implementations§

source§

impl CharacterCategory

source

pub fn from_file(path: &Path) -> SudachiResult<CharacterCategory>

Creates a character category from file

+
source

pub fn from_reader<T: BufRead>(data: T) -> SudachiResult<CharacterCategory>

source

pub fn get_category_types(&self, c: char) -> CategoryType

Returns a set of category types which given char has

+
source

pub fn iter(&self) -> CharCategoryIter<'_>

Trait Implementations§

source§

impl Clone for CharacterCategory

source§

fn clone(&self) -> CharacterCategory

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 CharacterCategory

source§

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

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

impl Default for CharacterCategory

source§

fn default() -> Self

Returns the “default value” for a type. 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,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

source§

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

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

+
source§

impl<T, U> Into<U> for Twhere + U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of -From<T> for U chooses to do.

-
source§

impl<T> ToOwned for Twhere - T: Clone,

§

type Owned = T

The resulting type after obtaining ownership.
source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
source§

impl<T, U> TryFrom<U> for Twhere - U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
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.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
\ No newline at end of file +From<T> for U chooses to do.

+
source§

impl<T> ToOwned for Twhere + T: Clone,

§

type Owned = T

The resulting type after obtaining ownership.
source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
source§

impl<T, U> TryFrom<U> for Twhere + U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
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.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
\ No newline at end of file diff --git a/rust/sudachi/dic/connect/index.html b/rust/sudachi/dic/connect/index.html index a6527442..ceb73c23 100644 --- a/rust/sudachi/dic/connect/index.html +++ b/rust/sudachi/dic/connect/index.html @@ -1 +1 @@ -sudachi::dic::connect - Rust
\ No newline at end of file +sudachi::dic::connect - Rust
\ No newline at end of file diff --git a/rust/sudachi/dic/connect/struct.ConnectionMatrix.html b/rust/sudachi/dic/connect/struct.ConnectionMatrix.html index 2726d2e1..fdd09ba0 100644 --- a/rust/sudachi/dic/connect/struct.ConnectionMatrix.html +++ b/rust/sudachi/dic/connect/struct.ConnectionMatrix.html @@ -1,9 +1,9 @@ -ConnectionMatrix in sudachi::dic::connect - Rust
pub struct ConnectionMatrix<'a> { /* private fields */ }

Implementations§

source§

impl<'a> ConnectionMatrix<'a>

source

pub fn from_offset_size( - data: &'a [u8], - offset: usize, - num_left: usize, - num_right: usize -) -> SudachiResult<ConnectionMatrix<'a>>

source

pub fn cost(&self, left: u16, right: u16) -> i16

Gets the value of the connection matrix

+ConnectionMatrix in sudachi::dic::connect - Rust
pub struct ConnectionMatrix<'a> { /* private fields */ }

Implementations§

source§

impl<'a> ConnectionMatrix<'a>

source

pub fn from_offset_size( + data: &'a [u8], + offset: usize, + num_left: usize, + num_right: usize +) -> SudachiResult<ConnectionMatrix<'a>>

source

pub fn cost(&self, left: u16, right: u16) -> i16

Gets the value of the connection matrix

It is performance critical that this function

  1. Has no branches
  2. @@ -12,16 +12,16 @@

    This is UB if index is out of bounds, but that can’t happen except in the case if the binary dictionary was tampered with. It is OK to make usage of tampered binary dictionaries UB.

    -
source

pub fn update(&mut self, left: u16, right: u16, value: i16)

source

pub fn num_left(&self) -> usize

Returns maximum number of left connection ID

-
source

pub fn num_right(&self) -> usize

Returns maximum number of right connection ID

-

Auto Trait Implementations§

§

impl<'a> RefUnwindSafe for ConnectionMatrix<'a>

§

impl<'a> Send for ConnectionMatrix<'a>

§

impl<'a> Sync for ConnectionMatrix<'a>

§

impl<'a> Unpin for ConnectionMatrix<'a>

§

impl<'a> UnwindSafe for ConnectionMatrix<'a>

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,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

source§

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

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

-
source§

impl<T, U> Into<U> for Twhere - U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

+
source

pub fn update(&mut self, left: u16, right: u16, value: i16)

source

pub fn num_left(&self) -> usize

Returns maximum number of left connection ID

+
source

pub fn num_right(&self) -> usize

Returns maximum number of right connection ID

+

Auto Trait Implementations§

§

impl<'a> RefUnwindSafe for ConnectionMatrix<'a>

§

impl<'a> Send for ConnectionMatrix<'a>

§

impl<'a> Sync for ConnectionMatrix<'a>

§

impl<'a> Unpin for ConnectionMatrix<'a>

§

impl<'a> UnwindSafe for ConnectionMatrix<'a>

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,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

source§

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

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

+
source§

impl<T, U> Into<U> for Twhere + U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of -From<T> for U chooses to do.

-
source§

impl<T, U> TryFrom<U> for Twhere - U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
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.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
\ No newline at end of file +From<T> for U chooses to do.

+
source§

impl<T, U> TryFrom<U> for Twhere + U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
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.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
\ No newline at end of file diff --git a/rust/sudachi/dic/dictionary/index.html b/rust/sudachi/dic/dictionary/index.html index 792796ee..9721d2ab 100644 --- a/rust/sudachi/dic/dictionary/index.html +++ b/rust/sudachi/dic/dictionary/index.html @@ -1 +1 @@ -sudachi::dic::dictionary - Rust
\ No newline at end of file +sudachi::dic::dictionary - Rust
\ No newline at end of file diff --git a/rust/sudachi/dic/dictionary/struct.JapaneseDictionary.html b/rust/sudachi/dic/dictionary/struct.JapaneseDictionary.html index fb55dc6f..c353427a 100644 --- a/rust/sudachi/dic/dictionary/struct.JapaneseDictionary.html +++ b/rust/sudachi/dic/dictionary/struct.JapaneseDictionary.html @@ -1,4 +1,4 @@ -JapaneseDictionary in sudachi::dic::dictionary - Rust
pub struct JapaneseDictionary { /* private fields */ }

Implementations§

source§

impl JapaneseDictionary

source

pub fn from_cfg(cfg: &Config) -> SudachiResult<JapaneseDictionary>

Creates a dictionary from the specified configuration +JapaneseDictionary in sudachi::dic::dictionary - Rust

pub struct JapaneseDictionary { /* private fields */ }

Implementations§

source§

impl JapaneseDictionary

source

pub fn from_cfg(cfg: &Config) -> SudachiResult<JapaneseDictionary>

Creates a dictionary from the specified configuration Dictionaries will be read from disk

source

pub fn from_cfg_storage( cfg: &Config, @@ -6,14 +6,14 @@ ) -> SudachiResult<JapaneseDictionary>

Creats a dictionary from the specified configuration and storage

source

pub fn grammar<'a>(&'a self) -> &Grammar<'a>

Returns grammar with the correct lifetime

source

pub fn lexicon<'a>(&'a self) -> &LexiconSet<'a>

Returns lexicon with the correct lifetime

-

Trait Implementations§

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,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

source§

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

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

-
source§

impl<T, U> Into<U> for Twhere - U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

+

Trait Implementations§

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,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

source§

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

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

+
source§

impl<T, U> Into<U> for Twhere + U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of -From<T> for U chooses to do.

-
source§

impl<T, U> TryFrom<U> for Twhere - U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
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.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
\ No newline at end of file +From<T> for U chooses to do.

+
source§

impl<T, U> TryFrom<U> for Twhere + U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
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.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
\ No newline at end of file diff --git a/rust/sudachi/dic/grammar/index.html b/rust/sudachi/dic/grammar/index.html index 860eba31..073d22d6 100644 --- a/rust/sudachi/dic/grammar/index.html +++ b/rust/sudachi/dic/grammar/index.html @@ -1 +1 @@ -sudachi::dic::grammar - Rust

Module sudachi::dic::grammar

source ·

Structs

\ No newline at end of file +sudachi::dic::grammar - Rust

Module sudachi::dic::grammar

source ·

Structs

\ No newline at end of file diff --git a/rust/sudachi/dic/grammar/struct.Grammar.html b/rust/sudachi/dic/grammar/struct.Grammar.html index fed49218..500646a5 100644 --- a/rust/sudachi/dic/grammar/struct.Grammar.html +++ b/rust/sudachi/dic/grammar/struct.Grammar.html @@ -1,39 +1,39 @@ -Grammar in sudachi::dic::grammar - Rust

Struct sudachi::dic::grammar::Grammar

source ·
pub struct Grammar<'a> {
-    pub pos_list: Vec<Vec<String>>,
-    pub storage_size: usize,
+Grammar in sudachi::dic::grammar - Rust

Struct sudachi::dic::grammar::Grammar

source ·
pub struct Grammar<'a> {
+    pub pos_list: Vec<Vec<String>>,
+    pub storage_size: usize,
     pub character_category: CharacterCategory,
     /* private fields */
 }
Expand description

Dictionary grammar

Contains part_of_speech list and connection cost map. It also holds character category.

-

Fields§

§pos_list: Vec<Vec<String>>§storage_size: usize§character_category: CharacterCategory

The mapping from character to character_category_type

-

Implementations§

source§

impl<'a> Grammar<'a>

source

pub const INHIBITED_CONNECTION: i16 = 32_767i16

source

pub const BOS_PARAMETER: (i16, i16, i16) = _

source

pub const EOS_PARAMETER: (i16, i16, i16) = _

source

pub fn parse(buf: &[u8], offset: usize) -> SudachiResult<Grammar<'_>>

Creates a Grammar from dictionary bytes

+

Fields§

§pos_list: Vec<Vec<String>>§storage_size: usize§character_category: CharacterCategory

The mapping from character to character_category_type

+

Implementations§

source§

impl<'a> Grammar<'a>

source

pub const INHIBITED_CONNECTION: i16 = 32_767i16

source

pub const BOS_PARAMETER: (i16, i16, i16) = _

source

pub const EOS_PARAMETER: (i16, i16, i16) = _

source

pub fn parse(buf: &[u8], offset: usize) -> SudachiResult<Grammar<'_>>

Creates a Grammar from dictionary bytes

buf: reference to the dictionary bytes offset: offset to the grammar section in the buf

-
source

pub fn connect_cost(&self, left_id: i16, right_id: i16) -> i16

Returns connection cost of nodes

+
source

pub fn connect_cost(&self, left_id: i16, right_id: i16) -> i16

Returns connection cost of nodes

left_id: right_id of left node right_id: left_if of right node

source

pub fn conn_matrix(&self) -> &ConnectionMatrix<'_>

source

pub fn set_character_category(&mut self, character_category: CharacterCategory)

Sets character category

This is the only way to set character category. Character category will be a empty map by default.

-
source

pub fn set_connect_cost(&mut self, left_id: i16, right_id: i16, cost: i16)

Sets connect cost for a specific pair of ids

+
source

pub fn set_connect_cost(&mut self, left_id: i16, right_id: i16, cost: i16)

Sets connect cost for a specific pair of ids

left_id: right_id of left node right_id: left_if of right node

-
source

pub fn get_part_of_speech_id<S>(&self, pos1: &[S]) -> Option<u16>where - S: AsRef<str>,

Returns a pos_id of given pos in the grammar

-
source

pub fn register_pos<S>(&mut self, pos: &[S]) -> SudachiResult<u16>where - S: AsRef<str> + ToString,

source

pub fn pos_components(&self, pos_id: u16) -> &[String]

Gets POS components for POS ID. +

source

pub fn get_part_of_speech_id<S>(&self, pos1: &[S]) -> Option<u16>where + S: AsRef<str>,

Returns a pos_id of given pos in the grammar

+
source

pub fn register_pos<S>(&mut self, pos: &[S]) -> SudachiResult<u16>where + S: AsRef<str> + ToString,

source

pub fn pos_components(&self, pos_id: u16) -> &[String]

Gets POS components for POS ID. Panics if out of bounds.

source

pub fn merge(&mut self, other: Grammar<'_>)

Merge a another grammar into this grammar

Only pos_list is merged

-

Auto Trait Implementations§

§

impl<'a> RefUnwindSafe for Grammar<'a>

§

impl<'a> Send for Grammar<'a>

§

impl<'a> Sync for Grammar<'a>

§

impl<'a> Unpin for Grammar<'a>

§

impl<'a> UnwindSafe for Grammar<'a>

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,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

source§

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

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

-
source§

impl<T, U> Into<U> for Twhere - U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

+

Auto Trait Implementations§

§

impl<'a> RefUnwindSafe for Grammar<'a>

§

impl<'a> Send for Grammar<'a>

§

impl<'a> Sync for Grammar<'a>

§

impl<'a> Unpin for Grammar<'a>

§

impl<'a> UnwindSafe for Grammar<'a>

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,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

source§

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

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

+
source§

impl<T, U> Into<U> for Twhere + U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of -From<T> for U chooses to do.

-
source§

impl<T, U> TryFrom<U> for Twhere - U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
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.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
\ No newline at end of file +From<T> for U chooses to do.

+
source§

impl<T, U> TryFrom<U> for Twhere + U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
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.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
\ No newline at end of file diff --git a/rust/sudachi/dic/header/enum.HeaderError.html b/rust/sudachi/dic/header/enum.HeaderError.html index 5d8eb853..188bc6f9 100644 --- a/rust/sudachi/dic/header/enum.HeaderError.html +++ b/rust/sudachi/dic/header/enum.HeaderError.html @@ -1,24 +1,24 @@ -HeaderError in sudachi::dic::header - Rust
#[non_exhaustive]
pub enum HeaderError { +HeaderError in sudachi::dic::header - Rust
#[non_exhaustive]
pub enum HeaderError { InvalidVersion, InvalidSystemDictVersion, InvalidUserDictVersion, CannotParse, }
Expand description

Sudachi error

-

Variants (Non-exhaustive)§

This enum is marked as non-exhaustive
Non-exhaustive enums could have additional variants added in future. Therefore, when matching against variants of non-exhaustive enums, an extra wildcard arm must be added to account for any future variants.
§

InvalidVersion

§

InvalidSystemDictVersion

§

InvalidUserDictVersion

§

CannotParse

Trait Implementations§

source§

impl Debug for HeaderError

source§

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

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

impl Display for HeaderError

source§

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

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

impl Error for HeaderError

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()
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, request: &mut Request<'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<HeaderError> for SudachiError

source§

fn from(source: HeaderError) -> Self

Converts to this type from the input type.
source§

impl PartialEq<HeaderError> for HeaderError

source§

fn eq(&self, other: &HeaderError) -> 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 HeaderError

source§

impl StructuralEq for HeaderError

source§

impl StructuralPartialEq for HeaderError

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,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

source§

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

Mutably borrows from an owned value. Read more
§

impl<Q, K> Equivalent<K> for Qwhere - Q: Eq + ?Sized, - K: Borrow<Q> + ?Sized,

§

fn equivalent(&self, key: &K) -> bool

Checks if this value is equivalent to the given key. Read more
§

impl<Q, K> Equivalent<K> for Qwhere - Q: Eq + ?Sized, - K: Borrow<Q> + ?Sized,

§

fn equivalent(&self, key: &K) -> bool

Compare self to key and return true if they are equal.
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

-
source§

impl<T, U> Into<U> for Twhere - U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

+

Variants (Non-exhaustive)§

This enum is marked as non-exhaustive
Non-exhaustive enums could have additional variants added in future. Therefore, when matching against variants of non-exhaustive enums, an extra wildcard arm must be added to account for any future variants.
§

InvalidVersion

§

InvalidSystemDictVersion

§

InvalidUserDictVersion

§

CannotParse

Trait Implementations§

source§

impl Debug for HeaderError

source§

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

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

impl Display for HeaderError

source§

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

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

impl Error for HeaderError

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()
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, request: &mut Request<'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<HeaderError> for SudachiError

source§

fn from(source: HeaderError) -> Self

Converts to this type from the input type.
source§

impl PartialEq for HeaderError

source§

fn eq(&self, other: &HeaderError) -> 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 HeaderError

source§

impl StructuralEq for HeaderError

source§

impl StructuralPartialEq for HeaderError

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,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

source§

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

Mutably borrows from an owned value. Read more
§

impl<Q, K> Equivalent<K> for Qwhere + Q: Eq + ?Sized, + K: Borrow<Q> + ?Sized,

§

fn equivalent(&self, key: &K) -> bool

Checks if this value is equivalent to the given key. Read more
§

impl<Q, K> Equivalent<K> for Qwhere + Q: Eq + ?Sized, + K: Borrow<Q> + ?Sized,

§

fn equivalent(&self, key: &K) -> bool

Compare self to key and return true if they are equal.
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

+
source§

impl<T, U> Into<U> for Twhere + U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of -From<T> for U chooses to do.

-
source§

impl<T> ToString for Twhere - T: Display + ?Sized,

source§

default fn to_string(&self) -> String

Converts the given value to a String. Read more
source§

impl<T, U> TryFrom<U> for Twhere - U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
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.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
\ No newline at end of file +From<T> for U chooses to do.

+
source§

impl<T> ToString for Twhere + T: Display + ?Sized,

source§

default fn to_string(&self) -> String

Converts the given value to a String. Read more
source§

impl<T, U> TryFrom<U> for Twhere + U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
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.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
\ No newline at end of file diff --git a/rust/sudachi/dic/header/enum.HeaderVersion.html b/rust/sudachi/dic/header/enum.HeaderVersion.html index 90ef86d8..99094749 100644 --- a/rust/sudachi/dic/header/enum.HeaderVersion.html +++ b/rust/sudachi/dic/header/enum.HeaderVersion.html @@ -1,22 +1,22 @@ -HeaderVersion in sudachi::dic::header - Rust
pub enum HeaderVersion {
+HeaderVersion in sudachi::dic::header - Rust
pub enum HeaderVersion {
     SystemDict(SystemDictVersion),
     UserDict(UserDictVersion),
 }
Expand description

Header version

-

Variants§

Implementations§

Trait Implementations§

source§

impl Clone for HeaderVersion

source§

fn clone(&self) -> HeaderVersion

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 HeaderVersion

source§

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

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

impl PartialEq<HeaderVersion> for HeaderVersion

source§

fn eq(&self, other: &HeaderVersion) -> 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 HeaderVersion

source§

impl StructuralEq for HeaderVersion

source§

impl StructuralPartialEq for HeaderVersion

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,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

source§

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

Mutably borrows from an owned value. Read more
§

impl<Q, K> Equivalent<K> for Qwhere - Q: Eq + ?Sized, - K: Borrow<Q> + ?Sized,

§

fn equivalent(&self, key: &K) -> bool

Checks if this value is equivalent to the given key. Read more
§

impl<Q, K> Equivalent<K> for Qwhere - Q: Eq + ?Sized, - K: Borrow<Q> + ?Sized,

§

fn equivalent(&self, key: &K) -> bool

Compare self to key and return true if they are equal.
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

-
source§

impl<T, U> Into<U> for Twhere - U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

+

Variants§

Implementations§

Trait Implementations§

source§

impl Clone for HeaderVersion

source§

fn clone(&self) -> HeaderVersion

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 HeaderVersion

source§

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

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

impl PartialEq for HeaderVersion

source§

fn eq(&self, other: &HeaderVersion) -> 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 HeaderVersion

source§

impl StructuralEq for HeaderVersion

source§

impl StructuralPartialEq for HeaderVersion

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,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

source§

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

Mutably borrows from an owned value. Read more
§

impl<Q, K> Equivalent<K> for Qwhere + Q: Eq + ?Sized, + K: Borrow<Q> + ?Sized,

§

fn equivalent(&self, key: &K) -> bool

Checks if this value is equivalent to the given key. Read more
§

impl<Q, K> Equivalent<K> for Qwhere + Q: Eq + ?Sized, + K: Borrow<Q> + ?Sized,

§

fn equivalent(&self, key: &K) -> bool

Compare self to key and return true if they are equal.
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

+
source§

impl<T, U> Into<U> for Twhere + U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of -From<T> for U chooses to do.

-
source§

impl<T> ToOwned for Twhere - T: Clone,

§

type Owned = T

The resulting type after obtaining ownership.
source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
source§

impl<T, U> TryFrom<U> for Twhere - U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
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.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
\ No newline at end of file +From<T> for U chooses to do.

+
source§

impl<T> ToOwned for Twhere + T: Clone,

§

type Owned = T

The resulting type after obtaining ownership.
source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
source§

impl<T, U> TryFrom<U> for Twhere + U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
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.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
\ No newline at end of file diff --git a/rust/sudachi/dic/header/enum.SystemDictVersion.html b/rust/sudachi/dic/header/enum.SystemDictVersion.html index 333ab235..d162c32d 100644 --- a/rust/sudachi/dic/header/enum.SystemDictVersion.html +++ b/rust/sudachi/dic/header/enum.SystemDictVersion.html @@ -1,21 +1,21 @@ -SystemDictVersion in sudachi::dic::header - Rust
pub enum SystemDictVersion {
+SystemDictVersion in sudachi::dic::header - Rust
pub enum SystemDictVersion {
     Version1,
     Version2,
-}

Variants§

§

Version1

§

Version2

Trait Implementations§

source§

impl Clone for SystemDictVersion

source§

fn clone(&self) -> SystemDictVersion

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 SystemDictVersion

source§

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

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

impl PartialEq<SystemDictVersion> for SystemDictVersion

source§

fn eq(&self, other: &SystemDictVersion) -> 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 SystemDictVersion

source§

impl StructuralEq for SystemDictVersion

source§

impl StructuralPartialEq for SystemDictVersion

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,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

source§

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

Mutably borrows from an owned value. Read more
§

impl<Q, K> Equivalent<K> for Qwhere - Q: Eq + ?Sized, - K: Borrow<Q> + ?Sized,

§

fn equivalent(&self, key: &K) -> bool

Checks if this value is equivalent to the given key. Read more
§

impl<Q, K> Equivalent<K> for Qwhere - Q: Eq + ?Sized, - K: Borrow<Q> + ?Sized,

§

fn equivalent(&self, key: &K) -> bool

Compare self to key and return true if they are equal.
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

-
source§

impl<T, U> Into<U> for Twhere - U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

+}

Variants§

§

Version1

§

Version2

Trait Implementations§

source§

impl Clone for SystemDictVersion

source§

fn clone(&self) -> SystemDictVersion

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 SystemDictVersion

source§

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

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

impl PartialEq for SystemDictVersion

source§

fn eq(&self, other: &SystemDictVersion) -> 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 SystemDictVersion

source§

impl StructuralEq for SystemDictVersion

source§

impl StructuralPartialEq for SystemDictVersion

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,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

source§

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

Mutably borrows from an owned value. Read more
§

impl<Q, K> Equivalent<K> for Qwhere + Q: Eq + ?Sized, + K: Borrow<Q> + ?Sized,

§

fn equivalent(&self, key: &K) -> bool

Checks if this value is equivalent to the given key. Read more
§

impl<Q, K> Equivalent<K> for Qwhere + Q: Eq + ?Sized, + K: Borrow<Q> + ?Sized,

§

fn equivalent(&self, key: &K) -> bool

Compare self to key and return true if they are equal.
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

+
source§

impl<T, U> Into<U> for Twhere + U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of -From<T> for U chooses to do.

-
source§

impl<T> ToOwned for Twhere - T: Clone,

§

type Owned = T

The resulting type after obtaining ownership.
source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
source§

impl<T, U> TryFrom<U> for Twhere - U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
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.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
\ No newline at end of file +From<T> for U chooses to do.

+
source§

impl<T> ToOwned for Twhere + T: Clone,

§

type Owned = T

The resulting type after obtaining ownership.
source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
source§

impl<T, U> TryFrom<U> for Twhere + U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
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.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
\ No newline at end of file diff --git a/rust/sudachi/dic/header/enum.UserDictVersion.html b/rust/sudachi/dic/header/enum.UserDictVersion.html index 66279610..7ae8fa66 100644 --- a/rust/sudachi/dic/header/enum.UserDictVersion.html +++ b/rust/sudachi/dic/header/enum.UserDictVersion.html @@ -1,22 +1,22 @@ -UserDictVersion in sudachi::dic::header - Rust
pub enum UserDictVersion {
+UserDictVersion in sudachi::dic::header - Rust
pub enum UserDictVersion {
     Version1,
     Version2,
     Version3,
-}

Variants§

§

Version1

§

Version2

§

Version3

Trait Implementations§

source§

impl Clone for UserDictVersion

source§

fn clone(&self) -> UserDictVersion

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 UserDictVersion

source§

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

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

impl PartialEq<UserDictVersion> for UserDictVersion

source§

fn eq(&self, other: &UserDictVersion) -> 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 UserDictVersion

source§

impl StructuralEq for UserDictVersion

source§

impl StructuralPartialEq for UserDictVersion

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,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

source§

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

Mutably borrows from an owned value. Read more
§

impl<Q, K> Equivalent<K> for Qwhere - Q: Eq + ?Sized, - K: Borrow<Q> + ?Sized,

§

fn equivalent(&self, key: &K) -> bool

Checks if this value is equivalent to the given key. Read more
§

impl<Q, K> Equivalent<K> for Qwhere - Q: Eq + ?Sized, - K: Borrow<Q> + ?Sized,

§

fn equivalent(&self, key: &K) -> bool

Compare self to key and return true if they are equal.
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

-
source§

impl<T, U> Into<U> for Twhere - U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

+}

Variants§

§

Version1

§

Version2

§

Version3

Trait Implementations§

source§

impl Clone for UserDictVersion

source§

fn clone(&self) -> UserDictVersion

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 UserDictVersion

source§

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

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

impl PartialEq for UserDictVersion

source§

fn eq(&self, other: &UserDictVersion) -> 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 UserDictVersion

source§

impl StructuralEq for UserDictVersion

source§

impl StructuralPartialEq for UserDictVersion

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,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

source§

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

Mutably borrows from an owned value. Read more
§

impl<Q, K> Equivalent<K> for Qwhere + Q: Eq + ?Sized, + K: Borrow<Q> + ?Sized,

§

fn equivalent(&self, key: &K) -> bool

Checks if this value is equivalent to the given key. Read more
§

impl<Q, K> Equivalent<K> for Qwhere + Q: Eq + ?Sized, + K: Borrow<Q> + ?Sized,

§

fn equivalent(&self, key: &K) -> bool

Compare self to key and return true if they are equal.
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

+
source§

impl<T, U> Into<U> for Twhere + U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of -From<T> for U chooses to do.

-
source§

impl<T> ToOwned for Twhere - T: Clone,

§

type Owned = T

The resulting type after obtaining ownership.
source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
source§

impl<T, U> TryFrom<U> for Twhere - U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
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.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
\ No newline at end of file +From<T> for U chooses to do.

+
source§

impl<T> ToOwned for Twhere + T: Clone,

§

type Owned = T

The resulting type after obtaining ownership.
source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
source§

impl<T, U> TryFrom<U> for Twhere + U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
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.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
\ No newline at end of file diff --git a/rust/sudachi/dic/header/index.html b/rust/sudachi/dic/header/index.html index e9c2f32e..0dfbd07f 100644 --- a/rust/sudachi/dic/header/index.html +++ b/rust/sudachi/dic/header/index.html @@ -1 +1 @@ -sudachi::dic::header - Rust
\ No newline at end of file +sudachi::dic::header - Rust
\ No newline at end of file diff --git a/rust/sudachi/dic/header/struct.Header.html b/rust/sudachi/dic/header/struct.Header.html index 36fbb199..2e1873b1 100644 --- a/rust/sudachi/dic/header/struct.Header.html +++ b/rust/sudachi/dic/header/struct.Header.html @@ -1,30 +1,30 @@ -Header in sudachi::dic::header - Rust

Struct sudachi::dic::header::Header

source ·
pub struct Header {
+Header in sudachi::dic::header - Rust

Struct sudachi::dic::header::Header

source ·
pub struct Header {
     pub version: HeaderVersion,
-    pub create_time: u64,
-    pub description: String,
+    pub create_time: u64,
+    pub description: String,
 }
Expand description

Dictionary header

Contains version, create_time, and description

-

Fields§

§version: HeaderVersion§create_time: u64§description: String

Implementations§

source§

impl Header

source

pub const STORAGE_SIZE: usize = 272usize

source

pub fn new() -> Self

Creates new system dictionary header +

Fields§

§version: HeaderVersion§create_time: u64§description: String

Implementations§

source§

impl Header

source

pub const STORAGE_SIZE: usize = 272usize

source

pub fn new() -> Self

Creates new system dictionary header Its version field should be modified to create user dictionary header

-
source

pub fn set_time(&mut self, time: SystemTime) -> SystemTime

Set creation time

-
source

pub fn parse(bytes: &[u8]) -> Result<Header, HeaderError>

Creates a new header from a dictionary bytes

-
source

pub fn has_grammar(&self) -> bool

Returns if this header version has grammar

-
source

pub fn has_synonym_group_ids(&self) -> bool

Returns if this header version has synonym group ids

-
source

pub fn write_to<W: Write>(&self, w: &mut W) -> SudachiResult<usize>

Trait Implementations§

source§

impl Clone for Header

source§

fn clone(&self) -> Header

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 Header

source§

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

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

impl PartialEq<Header> for Header

source§

fn eq(&self, other: &Header) -> 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 Header

source§

impl StructuralEq for Header

source§

impl StructuralPartialEq for Header

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,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

source§

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

Mutably borrows from an owned value. Read more
§

impl<Q, K> Equivalent<K> for Qwhere - Q: Eq + ?Sized, - K: Borrow<Q> + ?Sized,

§

fn equivalent(&self, key: &K) -> bool

Checks if this value is equivalent to the given key. Read more
§

impl<Q, K> Equivalent<K> for Qwhere - Q: Eq + ?Sized, - K: Borrow<Q> + ?Sized,

§

fn equivalent(&self, key: &K) -> bool

Compare self to key and return true if they are equal.
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

-
source§

impl<T, U> Into<U> for Twhere - U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

+
source

pub fn set_time(&mut self, time: SystemTime) -> SystemTime

Set creation time

+
source

pub fn parse(bytes: &[u8]) -> Result<Header, HeaderError>

Creates a new header from a dictionary bytes

+
source

pub fn has_grammar(&self) -> bool

Returns if this header version has grammar

+
source

pub fn has_synonym_group_ids(&self) -> bool

Returns if this header version has synonym group ids

+
source

pub fn write_to<W: Write>(&self, w: &mut W) -> SudachiResult<usize>

Trait Implementations§

source§

impl Clone for Header

source§

fn clone(&self) -> Header

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 Header

source§

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

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

impl PartialEq for Header

source§

fn eq(&self, other: &Header) -> 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 Header

source§

impl StructuralEq for Header

source§

impl StructuralPartialEq for Header

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,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

source§

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

Mutably borrows from an owned value. Read more
§

impl<Q, K> Equivalent<K> for Qwhere + Q: Eq + ?Sized, + K: Borrow<Q> + ?Sized,

§

fn equivalent(&self, key: &K) -> bool

Checks if this value is equivalent to the given key. Read more
§

impl<Q, K> Equivalent<K> for Qwhere + Q: Eq + ?Sized, + K: Borrow<Q> + ?Sized,

§

fn equivalent(&self, key: &K) -> bool

Compare self to key and return true if they are equal.
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

+
source§

impl<T, U> Into<U> for Twhere + U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of -From<T> for U chooses to do.

-
source§

impl<T> ToOwned for Twhere - T: Clone,

§

type Owned = T

The resulting type after obtaining ownership.
source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
source§

impl<T, U> TryFrom<U> for Twhere - U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
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.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
\ No newline at end of file +From<T> for U chooses to do.

+
source§

impl<T> ToOwned for Twhere + T: Clone,

§

type Owned = T

The resulting type after obtaining ownership.
source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
source§

impl<T, U> TryFrom<U> for Twhere + U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
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.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
\ No newline at end of file diff --git a/rust/sudachi/dic/index.html b/rust/sudachi/dic/index.html index e5ae49e4..fb9704f7 100644 --- a/rust/sudachi/dic/index.html +++ b/rust/sudachi/dic/index.html @@ -1 +1 @@ -sudachi::dic - Rust

Module sudachi::dic

source ·

Modules

Structs

\ No newline at end of file +sudachi::dic - Rust

Module sudachi::dic

source ·

Modules

Structs

\ No newline at end of file diff --git a/rust/sudachi/dic/lexicon/constant.MAX_DICTIONARIES.html b/rust/sudachi/dic/lexicon/constant.MAX_DICTIONARIES.html index b09bf1fa..f93ada18 100644 --- a/rust/sudachi/dic/lexicon/constant.MAX_DICTIONARIES.html +++ b/rust/sudachi/dic/lexicon/constant.MAX_DICTIONARIES.html @@ -1,4 +1,4 @@ -MAX_DICTIONARIES in sudachi::dic::lexicon - Rust
pub const MAX_DICTIONARIES: usize = 15;
Expand description

The first 4 bits of word_id are used to indicate that from which lexicon +MAX_DICTIONARIES in sudachi::dic::lexicon - Rust

pub const MAX_DICTIONARIES: usize = 15;
Expand description

The first 4 bits of word_id are used to indicate that from which lexicon the word comes, thus we can only hold 15 lexicons in the same time. 16th is reserved for marking OOVs.

\ No newline at end of file diff --git a/rust/sudachi/dic/lexicon/index.html b/rust/sudachi/dic/lexicon/index.html index 8d832f26..d2d0ecc2 100644 --- a/rust/sudachi/dic/lexicon/index.html +++ b/rust/sudachi/dic/lexicon/index.html @@ -1,3 +1,3 @@ -sudachi::dic::lexicon - Rust

Module sudachi::dic::lexicon

source ·

Modules

Structs

Constants

source

pub fn get_word_info( &self, - word_id: u32, + word_id: u32, subset: InfoSubset ) -> SudachiResult<WordInfo>

Returns WordInfo for given word_id

WordInfo will contain only fields included in InfoSubset

-
source

pub fn get_word_param(&self, word_id: u32) -> (i16, i16, i16)

Returns word_param for given word_id. +

source

pub fn get_word_param(&self, word_id: u32) -> (i16, i16, i16)

Returns word_param for given word_id. Params are (left_id, right_id, cost).

source

pub fn update_cost<D: DictionaryAccess>( &mut self, - dict: &D -) -> SudachiResult<()>

update word_param cost based on current tokenizer

-
source

pub fn size(&self) -> u32

Auto Trait Implementations§

§

impl<'a> RefUnwindSafe for Lexicon<'a>

§

impl<'a> Send for Lexicon<'a>

§

impl<'a> Sync for Lexicon<'a>

§

impl<'a> Unpin for Lexicon<'a>

§

impl<'a> UnwindSafe for Lexicon<'a>

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,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

source§

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

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

-
source§

impl<T, U> Into<U> for Twhere - U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

+ dict: &D +) -> SudachiResult<()>

update word_param cost based on current tokenizer

+
source

pub fn size(&self) -> u32

Auto Trait Implementations§

§

impl<'a> RefUnwindSafe for Lexicon<'a>

§

impl<'a> Send for Lexicon<'a>

§

impl<'a> Sync for Lexicon<'a>

§

impl<'a> Unpin for Lexicon<'a>

§

impl<'a> UnwindSafe for Lexicon<'a>

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,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

source§

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

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

+
source§

impl<T, U> Into<U> for Twhere + U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of -From<T> for U chooses to do.

-
source§

impl<T, U> TryFrom<U> for Twhere - U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
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.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
\ No newline at end of file +From<T> for U chooses to do.

+
source§

impl<T, U> TryFrom<U> for Twhere + U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
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.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
\ No newline at end of file diff --git a/rust/sudachi/dic/lexicon/struct.LexiconEntry.html b/rust/sudachi/dic/lexicon/struct.LexiconEntry.html index f8bbcc12..ca50340c 100644 --- a/rust/sudachi/dic/lexicon/struct.LexiconEntry.html +++ b/rust/sudachi/dic/lexicon/struct.LexiconEntry.html @@ -1,23 +1,23 @@ -LexiconEntry in sudachi::dic::lexicon - Rust
pub struct LexiconEntry {
+LexiconEntry in sudachi::dic::lexicon - Rust
pub struct LexiconEntry {
     pub word_id: WordId,
-    pub end: usize,
+    pub end: usize,
 }
Expand description

Result of the Lexicon lookup

Fields§

§word_id: WordId

Id of the returned word

-
§end: usize

Byte index of the word end

-

Implementations§

Trait Implementations§

source§

impl Debug for LexiconEntry

source§

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

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

impl PartialEq<LexiconEntry> for LexiconEntry

source§

fn eq(&self, other: &LexiconEntry) -> 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 LexiconEntry

source§

impl StructuralEq for LexiconEntry

source§

impl StructuralPartialEq for LexiconEntry

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,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

source§

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

Mutably borrows from an owned value. Read more
§

impl<Q, K> Equivalent<K> for Qwhere - Q: Eq + ?Sized, - K: Borrow<Q> + ?Sized,

§

fn equivalent(&self, key: &K) -> bool

Checks if this value is equivalent to the given key. Read more
§

impl<Q, K> Equivalent<K> for Qwhere - Q: Eq + ?Sized, - K: Borrow<Q> + ?Sized,

§

fn equivalent(&self, key: &K) -> bool

Compare self to key and return true if they are equal.
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

-
source§

impl<T, U> Into<U> for Twhere - U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

+
§end: usize

Byte index of the word end

+

Implementations§

Trait Implementations§

source§

impl Debug for LexiconEntry

source§

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

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

impl PartialEq for LexiconEntry

source§

fn eq(&self, other: &LexiconEntry) -> 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 LexiconEntry

source§

impl StructuralEq for LexiconEntry

source§

impl StructuralPartialEq for LexiconEntry

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,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

source§

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

Mutably borrows from an owned value. Read more
§

impl<Q, K> Equivalent<K> for Qwhere + Q: Eq + ?Sized, + K: Borrow<Q> + ?Sized,

§

fn equivalent(&self, key: &K) -> bool

Checks if this value is equivalent to the given key. Read more
§

impl<Q, K> Equivalent<K> for Qwhere + Q: Eq + ?Sized, + K: Borrow<Q> + ?Sized,

§

fn equivalent(&self, key: &K) -> bool

Compare self to key and return true if they are equal.
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

+
source§

impl<T, U> Into<U> for Twhere + U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of -From<T> for U chooses to do.

-
source§

impl<T, U> TryFrom<U> for Twhere - U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
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.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
\ No newline at end of file +From<T> for U chooses to do.

+
source§

impl<T, U> TryFrom<U> for Twhere + U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
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.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
\ No newline at end of file diff --git a/rust/sudachi/dic/lexicon/trie/index.html b/rust/sudachi/dic/lexicon/trie/index.html index b23e35bc..4633d596 100644 --- a/rust/sudachi/dic/lexicon/trie/index.html +++ b/rust/sudachi/dic/lexicon/trie/index.html @@ -1 +1 @@ -sudachi::dic::lexicon::trie - Rust
\ No newline at end of file +sudachi::dic::lexicon::trie - Rust
\ No newline at end of file diff --git a/rust/sudachi/dic/lexicon/trie/struct.Trie.html b/rust/sudachi/dic/lexicon/trie/struct.Trie.html index ec9b2bc2..4109cdcd 100644 --- a/rust/sudachi/dic/lexicon/trie/struct.Trie.html +++ b/rust/sudachi/dic/lexicon/trie/struct.Trie.html @@ -1,16 +1,16 @@ -Trie in sudachi::dic::lexicon::trie - Rust

Struct sudachi::dic::lexicon::trie::Trie

source ·
pub struct Trie<'a> { /* private fields */ }

Implementations§

source§

impl<'a> Trie<'a>

source

pub fn new(data: &'a [u8], size: usize) -> Trie<'a>

source

pub fn new_owned(data: Vec<u32>) -> Trie<'a>

source

pub fn total_size(&self) -> usize

source

pub fn common_prefix_iterator<'b>( +Trie in sudachi::dic::lexicon::trie - Rust

Struct sudachi::dic::lexicon::trie::Trie

source ·
pub struct Trie<'a> { /* private fields */ }

Implementations§

source§

impl<'a> Trie<'a>

source

pub fn new(data: &'a [u8], size: usize) -> Trie<'a>

source

pub fn new_owned(data: Vec<u32>) -> Trie<'a>

source

pub fn total_size(&self) -> usize

source

pub fn common_prefix_iterator<'b>( &'a self, - input: &'b [u8], - offset: usize + input: &'b [u8], + offset: usize ) -> TrieEntryIter<'b> where - 'a: 'b,

Auto Trait Implementations§

§

impl<'a> RefUnwindSafe for Trie<'a>

§

impl<'a> Send for Trie<'a>

§

impl<'a> Sync for Trie<'a>

§

impl<'a> Unpin for Trie<'a>

§

impl<'a> UnwindSafe for Trie<'a>

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,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

source§

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

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

-
source§

impl<T, U> Into<U> for Twhere - U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

+ 'a: 'b,

Auto Trait Implementations§

§

impl<'a> RefUnwindSafe for Trie<'a>

§

impl<'a> Send for Trie<'a>

§

impl<'a> Sync for Trie<'a>

§

impl<'a> Unpin for Trie<'a>

§

impl<'a> UnwindSafe for Trie<'a>

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,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

source§

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

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

+
source§

impl<T, U> Into<U> for Twhere + U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of -From<T> for U chooses to do.

-
source§

impl<T, U> TryFrom<U> for Twhere - U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
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.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
\ No newline at end of file +From<T> for U chooses to do.

+
source§

impl<T, U> TryFrom<U> for Twhere + U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
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.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
\ No newline at end of file diff --git a/rust/sudachi/dic/lexicon/trie/struct.TrieEntry.html b/rust/sudachi/dic/lexicon/trie/struct.TrieEntry.html index 0c02932c..2dc4bead 100644 --- a/rust/sudachi/dic/lexicon/trie/struct.TrieEntry.html +++ b/rust/sudachi/dic/lexicon/trie/struct.TrieEntry.html @@ -1,23 +1,23 @@ -TrieEntry in sudachi::dic::lexicon::trie - Rust

Struct sudachi::dic::lexicon::trie::TrieEntry

source ·
pub struct TrieEntry {
-    pub value: u32,
-    pub end: usize,
-}

Fields§

§value: u32

Value of Trie, this is not the pointer to WordId, but the offset in WordId table

-
§end: usize

Offset of word end

-

Implementations§

source§

impl TrieEntry

source

pub fn new(value: u32, offset: usize) -> TrieEntry

Trait Implementations§

source§

impl Clone for TrieEntry

source§

fn clone(&self) -> TrieEntry

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 TrieEntry

source§

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

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

impl PartialEq<TrieEntry> for TrieEntry

source§

fn eq(&self, other: &TrieEntry) -> 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 TrieEntry

source§

impl StructuralEq for TrieEntry

source§

impl StructuralPartialEq for TrieEntry

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,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

source§

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

Mutably borrows from an owned value. Read more
§

impl<Q, K> Equivalent<K> for Qwhere - Q: Eq + ?Sized, - K: Borrow<Q> + ?Sized,

§

fn equivalent(&self, key: &K) -> bool

Checks if this value is equivalent to the given key. Read more
§

impl<Q, K> Equivalent<K> for Qwhere - Q: Eq + ?Sized, - K: Borrow<Q> + ?Sized,

§

fn equivalent(&self, key: &K) -> bool

Compare self to key and return true if they are equal.
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

-
source§

impl<T, U> Into<U> for Twhere - U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

+TrieEntry in sudachi::dic::lexicon::trie - Rust

Struct sudachi::dic::lexicon::trie::TrieEntry

source ·
pub struct TrieEntry {
+    pub value: u32,
+    pub end: usize,
+}

Fields§

§value: u32

Value of Trie, this is not the pointer to WordId, but the offset in WordId table

+
§end: usize

Offset of word end

+

Implementations§

source§

impl TrieEntry

source

pub fn new(value: u32, offset: usize) -> TrieEntry

Trait Implementations§

source§

impl Clone for TrieEntry

source§

fn clone(&self) -> TrieEntry

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 TrieEntry

source§

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

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

impl PartialEq for TrieEntry

source§

fn eq(&self, other: &TrieEntry) -> 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 TrieEntry

source§

impl StructuralEq for TrieEntry

source§

impl StructuralPartialEq for TrieEntry

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,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

source§

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

Mutably borrows from an owned value. Read more
§

impl<Q, K> Equivalent<K> for Qwhere + Q: Eq + ?Sized, + K: Borrow<Q> + ?Sized,

§

fn equivalent(&self, key: &K) -> bool

Checks if this value is equivalent to the given key. Read more
§

impl<Q, K> Equivalent<K> for Qwhere + Q: Eq + ?Sized, + K: Borrow<Q> + ?Sized,

§

fn equivalent(&self, key: &K) -> bool

Compare self to key and return true if they are equal.
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

+
source§

impl<T, U> Into<U> for Twhere + U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of -From<T> for U chooses to do.

-
source§

impl<T> ToOwned for Twhere - T: Clone,

§

type Owned = T

The resulting type after obtaining ownership.
source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
source§

impl<T, U> TryFrom<U> for Twhere - U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
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.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
\ No newline at end of file +From<T> for U chooses to do.

+
source§

impl<T> ToOwned for Twhere + T: Clone,

§

type Owned = T

The resulting type after obtaining ownership.
source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
source§

impl<T, U> TryFrom<U> for Twhere + U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
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.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
\ No newline at end of file diff --git a/rust/sudachi/dic/lexicon/trie/struct.TrieEntryIter.html b/rust/sudachi/dic/lexicon/trie/struct.TrieEntryIter.html index dc6fe03f..dfc03bbc 100644 --- a/rust/sudachi/dic/lexicon/trie/struct.TrieEntryIter.html +++ b/rust/sudachi/dic/lexicon/trie/struct.TrieEntryIter.html @@ -1,591 +1,588 @@ -TrieEntryIter in sudachi::dic::lexicon::trie - Rust
pub struct TrieEntryIter<'a> { /* private fields */ }

Trait Implementations§

source§

impl<'a> Iterator for TrieEntryIter<'a>

§

type Item = TrieEntry

The type of the elements being iterated over.
source§

fn next(&mut self) -> Option<Self::Item>

Advances the iterator and returns the next value. Read more
source§

fn next_chunk<const N: usize>( +TrieEntryIter in sudachi::dic::lexicon::trie - Rust
pub struct TrieEntryIter<'a> { /* private fields */ }

Trait Implementations§

source§

impl<'a> Iterator for TrieEntryIter<'a>

§

type Item = TrieEntry

The type of the elements being iterated over.
source§

fn next(&mut self) -> Option<Self::Item>

Advances the iterator and returns the next value. Read more
source§

fn next_chunk<const N: usize>( &mut self -) -> Result<[Self::Item; N], IntoIter<Self::Item, N>>where - Self: Sized,

🔬This is a nightly-only experimental API. (iter_next_chunk)
Advances the iterator and returns an array containing the next N values. Read more
1.0.0 · source§

fn size_hint(&self) -> (usize, Option<usize>)

Returns the bounds on the remaining length of the iterator. Read more
1.0.0 · source§

fn count(self) -> usizewhere - Self: Sized,

Consumes the iterator, counting the number of iterations and returning it. Read more
1.0.0 · source§

fn last(self) -> Option<Self::Item>where - Self: Sized,

Consumes the iterator, returning the last element. Read more
source§

fn advance_by(&mut self, n: usize) -> Result<(), NonZeroUsize>

🔬This is a nightly-only experimental API. (iter_advance_by)
Advances the iterator by n elements. Read more
1.0.0 · source§

fn nth(&mut self, n: usize) -> Option<Self::Item>

Returns the nth element of the iterator. Read more
1.28.0 · source§

fn step_by(self, step: usize) -> StepBy<Self>where - Self: Sized,

Creates an iterator starting at the same point, but stepping by -the given amount at each iteration. Read more
1.0.0 · source§

fn chain<U>(self, other: U) -> Chain<Self, <U as IntoIterator>::IntoIter>where - Self: Sized, - U: IntoIterator<Item = Self::Item>,

Takes two iterators and creates a new iterator over both in sequence. Read more
1.0.0 · source§

fn zip<U>(self, other: U) -> Zip<Self, <U as IntoIterator>::IntoIter>where - Self: Sized, - U: IntoIterator,

‘Zips up’ two iterators into a single iterator of pairs. Read more
source§

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

🔬This is a nightly-only experimental API. (iter_intersperse)
Creates a new iterator which places an item generated by separator -between adjacent items of the original iterator. Read more
1.0.0 · source§

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

Takes a closure and creates an iterator which calls that closure on each -element. Read more
1.21.0 · source§

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

Calls a closure on each element of an iterator. Read more
1.0.0 · source§

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

Creates an iterator which uses a closure to determine if an element -should be yielded. Read more
1.0.0 · source§

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

Creates an iterator that both filters and maps. Read more
1.0.0 · source§

fn enumerate(self) -> Enumerate<Self>where - Self: Sized,

Creates an iterator which gives the current iteration count as well as -the next value. Read more
1.0.0 · source§

fn peekable(self) -> Peekable<Self>where - Self: Sized,

Creates an iterator which can use the peek and peek_mut methods +) -> Result<[Self::Item; N], IntoIter<Self::Item, N>>where + Self: Sized,

🔬This is a nightly-only experimental API. (iter_next_chunk)
Advances the iterator and returns an array containing the next N values. Read more
1.0.0 · source§

fn size_hint(&self) -> (usize, Option<usize>)

Returns the bounds on the remaining length of the iterator. Read more
1.0.0 · source§

fn count(self) -> usizewhere + Self: Sized,

Consumes the iterator, counting the number of iterations and returning it. Read more
1.0.0 · source§

fn last(self) -> Option<Self::Item>where + Self: Sized,

Consumes the iterator, returning the last element. Read more
source§

fn advance_by(&mut self, n: usize) -> Result<(), NonZeroUsize>

🔬This is a nightly-only experimental API. (iter_advance_by)
Advances the iterator by n elements. Read more
1.0.0 · source§

fn nth(&mut self, n: usize) -> Option<Self::Item>

Returns the nth element of the iterator. Read more
1.28.0 · source§

fn step_by(self, step: usize) -> StepBy<Self>where + Self: Sized,

Creates an iterator starting at the same point, but stepping by +the given amount at each iteration. Read more
1.0.0 · source§

fn chain<U>(self, other: U) -> Chain<Self, <U as IntoIterator>::IntoIter>where + Self: Sized, + U: IntoIterator<Item = Self::Item>,

Takes two iterators and creates a new iterator over both in sequence. Read more
1.0.0 · source§

fn zip<U>(self, other: U) -> Zip<Self, <U as IntoIterator>::IntoIter>where + Self: Sized, + U: IntoIterator,

‘Zips up’ two iterators into a single iterator of pairs. Read more
source§

fn intersperse_with<G>(self, separator: G) -> IntersperseWith<Self, G>where + Self: Sized, + G: FnMut() -> Self::Item,

🔬This is a nightly-only experimental API. (iter_intersperse)
Creates a new iterator which places an item generated by separator +between adjacent items of the original iterator. Read more
1.0.0 · source§

fn map<B, F>(self, f: F) -> Map<Self, F>where + Self: Sized, + F: FnMut(Self::Item) -> B,

Takes a closure and creates an iterator which calls that closure on each +element. Read more
1.21.0 · source§

fn for_each<F>(self, f: F)where + Self: Sized, + F: FnMut(Self::Item),

Calls a closure on each element of an iterator. Read more
1.0.0 · source§

fn filter<P>(self, predicate: P) -> Filter<Self, P>where + Self: Sized, + P: FnMut(&Self::Item) -> bool,

Creates an iterator which uses a closure to determine if an element +should be yielded. Read more
1.0.0 · source§

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F>where + Self: Sized, + F: FnMut(Self::Item) -> Option<B>,

Creates an iterator that both filters and maps. Read more
1.0.0 · source§

fn enumerate(self) -> Enumerate<Self>where + Self: Sized,

Creates an iterator which gives the current iteration count as well as +the next value. Read more
1.0.0 · source§

fn peekable(self) -> Peekable<Self>where + Self: Sized,

Creates an iterator which can use the peek and peek_mut methods to look at the next element of the iterator without consuming it. See -their documentation for more information. Read more
1.0.0 · source§

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

Creates an iterator that skips elements based on a predicate. Read more
1.0.0 · source§

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

Creates an iterator that yields elements based on a predicate. Read more
1.57.0 · source§

fn map_while<B, P>(self, predicate: P) -> MapWhile<Self, P>where - Self: Sized, - P: FnMut(Self::Item) -> Option<B>,

Creates an iterator that both yields elements based on a predicate and maps. Read more
1.0.0 · source§

fn skip(self, n: usize) -> Skip<Self>where - Self: Sized,

Creates an iterator that skips the first n elements. Read more
1.0.0 · source§

fn take(self, n: usize) -> Take<Self>where - Self: Sized,

Creates an iterator that yields the first n elements, or fewer -if the underlying iterator ends sooner. Read more
1.0.0 · source§

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F>where - Self: Sized, - F: FnMut(&mut St, Self::Item) -> Option<B>,

An iterator adapter which, like fold, holds internal state, but -unlike fold, produces a new iterator. Read more
1.0.0 · source§

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F>where - Self: Sized, - U: IntoIterator, - F: FnMut(Self::Item) -> U,

Creates an iterator that works like map, but flattens nested structure. Read more
source§

fn map_windows<F, R, const N: usize>(self, f: F) -> MapWindows<Self, F, N>where - Self: Sized, - F: FnMut(&[Self::Item; N]) -> R,

🔬This is a nightly-only experimental API. (iter_map_windows)
Calls the given function f for each contiguous window of size N over -self and returns an iterator over the outputs of f. Like slice::windows(), -the windows during mapping overlap as well. Read more
1.0.0 · source§

fn fuse(self) -> Fuse<Self>where - Self: Sized,

Creates an iterator which ends after the first None. Read more
1.0.0 · source§

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

Does something with each element of an iterator, passing the value on. Read more
1.0.0 · source§

fn by_ref(&mut self) -> &mut Selfwhere - Self: Sized,

Borrows an iterator, rather than consuming it. Read more
1.0.0 · source§

fn collect<B>(self) -> Bwhere - B: FromIterator<Self::Item>, - Self: Sized,

Transforms an iterator into a collection. Read more
source§

fn collect_into<E>(self, collection: &mut E) -> &mut Ewhere - E: Extend<Self::Item>, - Self: Sized,

🔬This is a nightly-only experimental API. (iter_collect_into)
Collects all the items from an iterator into a collection. Read more
1.0.0 · source§

fn partition<B, F>(self, f: F) -> (B, B)where - Self: Sized, - B: Default + Extend<Self::Item>, - F: FnMut(&Self::Item) -> bool,

Consumes an iterator, creating two collections from it. Read more
source§

fn is_partitioned<P>(self, predicate: P) -> boolwhere - Self: Sized, - P: FnMut(Self::Item) -> bool,

🔬This is a nightly-only experimental API. (iter_is_partitioned)
Checks if the elements of this iterator are partitioned according to the given predicate, -such that all those that return true precede all those that return false. Read more
1.27.0 · source§

fn try_fold<B, F, R>(&mut self, init: B, f: F) -> Rwhere - Self: Sized, - F: FnMut(B, Self::Item) -> R, - R: Try<Output = B>,

An iterator method that applies a function as long as it returns -successfully, producing a single, final value. Read more
1.27.0 · source§

fn try_for_each<F, R>(&mut self, f: F) -> Rwhere - Self: Sized, - F: FnMut(Self::Item) -> R, - R: Try<Output = ()>,

An iterator method that applies a fallible function to each item in the -iterator, stopping at the first error and returning that error. Read more
1.0.0 · source§

fn fold<B, F>(self, init: B, f: F) -> Bwhere - Self: Sized, - F: FnMut(B, Self::Item) -> B,

Folds every element into an accumulator by applying an operation, -returning the final result. Read more
1.51.0 · source§

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

Reduces the elements to a single one, by repeatedly applying a reducing -operation. Read more
source§

fn try_reduce<F, R>( +their documentation for more information. Read more

1.0.0 · source§

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P>where + Self: Sized, + P: FnMut(&Self::Item) -> bool,

Creates an iterator that skips elements based on a predicate. Read more
1.0.0 · source§

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P>where + Self: Sized, + P: FnMut(&Self::Item) -> bool,

Creates an iterator that yields elements based on a predicate. Read more
1.57.0 · source§

fn map_while<B, P>(self, predicate: P) -> MapWhile<Self, P>where + Self: Sized, + P: FnMut(Self::Item) -> Option<B>,

Creates an iterator that both yields elements based on a predicate and maps. Read more
1.0.0 · source§

fn skip(self, n: usize) -> Skip<Self>where + Self: Sized,

Creates an iterator that skips the first n elements. Read more
1.0.0 · source§

fn take(self, n: usize) -> Take<Self>where + Self: Sized,

Creates an iterator that yields the first n elements, or fewer +if the underlying iterator ends sooner. Read more
1.0.0 · source§

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F>where + Self: Sized, + F: FnMut(&mut St, Self::Item) -> Option<B>,

An iterator adapter which, like fold, holds internal state, but +unlike fold, produces a new iterator. Read more
1.0.0 · source§

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F>where + Self: Sized, + U: IntoIterator, + F: FnMut(Self::Item) -> U,

Creates an iterator that works like map, but flattens nested structure. Read more
source§

fn map_windows<F, R, const N: usize>(self, f: F) -> MapWindows<Self, F, N>where + Self: Sized, + F: FnMut(&[Self::Item; N]) -> R,

🔬This is a nightly-only experimental API. (iter_map_windows)
Calls the given function f for each contiguous window of size N over +self and returns an iterator over the outputs of f. Like slice::windows(), +the windows during mapping overlap as well. Read more
1.0.0 · source§

fn fuse(self) -> Fuse<Self>where + Self: Sized,

Creates an iterator which ends after the first None. Read more
1.0.0 · source§

fn inspect<F>(self, f: F) -> Inspect<Self, F>where + Self: Sized, + F: FnMut(&Self::Item),

Does something with each element of an iterator, passing the value on. Read more
1.0.0 · source§

fn by_ref(&mut self) -> &mut Selfwhere + Self: Sized,

Borrows an iterator, rather than consuming it. Read more
1.0.0 · source§

fn collect<B>(self) -> Bwhere + B: FromIterator<Self::Item>, + Self: Sized,

Transforms an iterator into a collection. Read more
source§

fn collect_into<E>(self, collection: &mut E) -> &mut Ewhere + E: Extend<Self::Item>, + Self: Sized,

🔬This is a nightly-only experimental API. (iter_collect_into)
Collects all the items from an iterator into a collection. Read more
1.0.0 · source§

fn partition<B, F>(self, f: F) -> (B, B)where + Self: Sized, + B: Default + Extend<Self::Item>, + F: FnMut(&Self::Item) -> bool,

Consumes an iterator, creating two collections from it. Read more
source§

fn is_partitioned<P>(self, predicate: P) -> boolwhere + Self: Sized, + P: FnMut(Self::Item) -> bool,

🔬This is a nightly-only experimental API. (iter_is_partitioned)
Checks if the elements of this iterator are partitioned according to the given predicate, +such that all those that return true precede all those that return false. Read more
1.27.0 · source§

fn try_fold<B, F, R>(&mut self, init: B, f: F) -> Rwhere + Self: Sized, + F: FnMut(B, Self::Item) -> R, + R: Try<Output = B>,

An iterator method that applies a function as long as it returns +successfully, producing a single, final value. Read more
1.27.0 · source§

fn try_for_each<F, R>(&mut self, f: F) -> Rwhere + Self: Sized, + F: FnMut(Self::Item) -> R, + R: Try<Output = ()>,

An iterator method that applies a fallible function to each item in the +iterator, stopping at the first error and returning that error. Read more
1.0.0 · source§

fn fold<B, F>(self, init: B, f: F) -> Bwhere + Self: Sized, + F: FnMut(B, Self::Item) -> B,

Folds every element into an accumulator by applying an operation, +returning the final result. Read more
1.51.0 · source§

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

Reduces the elements to a single one, by repeatedly applying a reducing +operation. Read more
source§

fn try_reduce<F, R>( &mut self, f: F -) -> <<R as Try>::Residual as Residual<Option<<R as Try>::Output>>>::TryTypewhere - Self: Sized, - F: FnMut(Self::Item, Self::Item) -> R, - R: Try<Output = Self::Item>, - <R as Try>::Residual: Residual<Option<Self::Item>>,

🔬This is a nightly-only experimental API. (iterator_try_reduce)
Reduces the elements to a single one by repeatedly applying a reducing operation. If the -closure returns a failure, the failure is propagated back to the caller immediately. Read more
1.0.0 · source§

fn all<F>(&mut self, f: F) -> boolwhere - Self: Sized, - F: FnMut(Self::Item) -> bool,

Tests if every element of the iterator matches a predicate. Read more
1.0.0 · source§

fn any<F>(&mut self, f: F) -> boolwhere - Self: Sized, - F: FnMut(Self::Item) -> bool,

Tests if any element of the iterator matches a predicate. Read more
1.0.0 · source§

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

Searches for an element of an iterator that satisfies a predicate. Read more
1.30.0 · source§

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

Applies function to the elements of iterator and returns -the first non-none result. Read more
source§

fn try_find<F, R>( +) -> <<R as Try>::Residual as Residual<Option<<R as Try>::Output>>>::TryTypewhere + Self: Sized, + F: FnMut(Self::Item, Self::Item) -> R, + R: Try<Output = Self::Item>, + <R as Try>::Residual: Residual<Option<Self::Item>>,

🔬This is a nightly-only experimental API. (iterator_try_reduce)
Reduces the elements to a single one by repeatedly applying a reducing operation. If the +closure returns a failure, the failure is propagated back to the caller immediately. Read more
1.0.0 · source§

fn all<F>(&mut self, f: F) -> boolwhere + Self: Sized, + F: FnMut(Self::Item) -> bool,

Tests if every element of the iterator matches a predicate. Read more
1.0.0 · source§

fn any<F>(&mut self, f: F) -> boolwhere + Self: Sized, + F: FnMut(Self::Item) -> bool,

Tests if any element of the iterator matches a predicate. Read more
1.0.0 · source§

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

Searches for an element of an iterator that satisfies a predicate. Read more
1.30.0 · source§

fn find_map<B, F>(&mut self, f: F) -> Option<B>where + Self: Sized, + F: FnMut(Self::Item) -> Option<B>,

Applies function to the elements of iterator and returns +the first non-none result. Read more
source§

fn try_find<F, R>( &mut self, f: F -) -> <<R as Try>::Residual as Residual<Option<Self::Item>>>::TryTypewhere - Self: Sized, - F: FnMut(&Self::Item) -> R, - R: Try<Output = bool>, - <R as Try>::Residual: Residual<Option<Self::Item>>,

🔬This is a nightly-only experimental API. (try_find)
Applies function to the elements of iterator and returns -the first true result or the first error. Read more
1.0.0 · source§

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

Searches for an element in an iterator, returning its index. Read more
1.6.0 · source§

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item>where - B: Ord, - Self: Sized, - F: FnMut(&Self::Item) -> B,

Returns the element that gives the maximum value from the -specified function. Read more
1.15.0 · source§

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

Returns the element that gives the maximum value with respect to the -specified comparison function. Read more
1.6.0 · source§

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item>where - B: Ord, - Self: Sized, - F: FnMut(&Self::Item) -> B,

Returns the element that gives the minimum value from the -specified function. Read more
1.15.0 · source§

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

Returns the element that gives the minimum value with respect to the -specified comparison function. Read more
1.0.0 · source§

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB)where - FromA: Default + Extend<A>, - FromB: Default + Extend<B>, - Self: Sized + Iterator<Item = (A, B)>,

Converts an iterator of pairs into a pair of containers. Read more
1.36.0 · source§

fn copied<'a, T>(self) -> Copied<Self>where - T: 'a + Copy, - Self: Sized + Iterator<Item = &'a T>,

Creates an iterator which copies all of its elements. Read more
1.0.0 · source§

fn cloned<'a, T>(self) -> Cloned<Self>where - T: 'a + Clone, - Self: Sized + Iterator<Item = &'a T>,

Creates an iterator which clones all of its elements. Read more
source§

fn array_chunks<const N: usize>(self) -> ArrayChunks<Self, N>where - Self: Sized,

🔬This is a nightly-only experimental API. (iter_array_chunks)
Returns an iterator over N elements of the iterator at a time. Read more
1.11.0 · source§

fn sum<S>(self) -> Swhere - Self: Sized, - S: Sum<Self::Item>,

Sums the elements of an iterator. Read more
1.11.0 · source§

fn product<P>(self) -> Pwhere - Self: Sized, - P: Product<Self::Item>,

Iterates over the entire iterator, multiplying all the elements Read more
source§

fn cmp_by<I, F>(self, other: I, cmp: F) -> Orderingwhere - Self: Sized, - I: IntoIterator, - F: FnMut(Self::Item, <I as IntoIterator>::Item) -> Ordering,

🔬This is a nightly-only experimental API. (iter_order_by)
Lexicographically compares the elements of this Iterator with those -of another with respect to the specified comparison function. Read more
1.5.0 · source§

fn partial_cmp<I>(self, other: I) -> Option<Ordering>where - I: IntoIterator, - Self::Item: PartialOrd<<I as IntoIterator>::Item>, - Self: Sized,

Lexicographically compares the PartialOrd elements of -this Iterator with those of another. The comparison works like short-circuit +) -> <<R as Try>::Residual as Residual<Option<Self::Item>>>::TryTypewhere + Self: Sized, + F: FnMut(&Self::Item) -> R, + R: Try<Output = bool>, + <R as Try>::Residual: Residual<Option<Self::Item>>,
🔬This is a nightly-only experimental API. (try_find)
Applies function to the elements of iterator and returns +the first true result or the first error. Read more
1.0.0 · source§

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

Searches for an element in an iterator, returning its index. Read more
1.6.0 · source§

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item>where + B: Ord, + Self: Sized, + F: FnMut(&Self::Item) -> B,

Returns the element that gives the maximum value from the +specified function. Read more
1.15.0 · source§

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

Returns the element that gives the maximum value with respect to the +specified comparison function. Read more
1.6.0 · source§

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item>where + B: Ord, + Self: Sized, + F: FnMut(&Self::Item) -> B,

Returns the element that gives the minimum value from the +specified function. Read more
1.15.0 · source§

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

Returns the element that gives the minimum value with respect to the +specified comparison function. Read more
1.0.0 · source§

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB)where + FromA: Default + Extend<A>, + FromB: Default + Extend<B>, + Self: Sized + Iterator<Item = (A, B)>,

Converts an iterator of pairs into a pair of containers. Read more
1.36.0 · source§

fn copied<'a, T>(self) -> Copied<Self>where + T: 'a + Copy, + Self: Sized + Iterator<Item = &'a T>,

Creates an iterator which copies all of its elements. Read more
1.0.0 · source§

fn cloned<'a, T>(self) -> Cloned<Self>where + T: 'a + Clone, + Self: Sized + Iterator<Item = &'a T>,

Creates an iterator which clones all of its elements. Read more
source§

fn array_chunks<const N: usize>(self) -> ArrayChunks<Self, N>where + Self: Sized,

🔬This is a nightly-only experimental API. (iter_array_chunks)
Returns an iterator over N elements of the iterator at a time. Read more
1.11.0 · source§

fn sum<S>(self) -> Swhere + Self: Sized, + S: Sum<Self::Item>,

Sums the elements of an iterator. Read more
1.11.0 · source§

fn product<P>(self) -> Pwhere + Self: Sized, + P: Product<Self::Item>,

Iterates over the entire iterator, multiplying all the elements Read more
source§

fn cmp_by<I, F>(self, other: I, cmp: F) -> Orderingwhere + Self: Sized, + I: IntoIterator, + F: FnMut(Self::Item, <I as IntoIterator>::Item) -> Ordering,

🔬This is a nightly-only experimental API. (iter_order_by)
Lexicographically compares the elements of this Iterator with those +of another with respect to the specified comparison function. Read more
1.5.0 · source§

fn partial_cmp<I>(self, other: I) -> Option<Ordering>where + I: IntoIterator, + Self::Item: PartialOrd<<I as IntoIterator>::Item>, + Self: Sized,

Lexicographically compares the PartialOrd elements of +this Iterator with those of another. The comparison works like short-circuit evaluation, returning a result without comparing the remaining elements. -As soon as an order can be determined, the evaluation stops and a result is returned. Read more
source§

fn partial_cmp_by<I, F>(self, other: I, partial_cmp: F) -> Option<Ordering>where - Self: Sized, - I: IntoIterator, - F: FnMut(Self::Item, <I as IntoIterator>::Item) -> Option<Ordering>,

🔬This is a nightly-only experimental API. (iter_order_by)
Lexicographically compares the elements of this Iterator with those -of another with respect to the specified comparison function. Read more
1.5.0 · source§

fn eq<I>(self, other: I) -> boolwhere - I: IntoIterator, - Self::Item: PartialEq<<I as IntoIterator>::Item>, - Self: Sized,

Determines if the elements of this Iterator are equal to those of -another. Read more
source§

fn eq_by<I, F>(self, other: I, eq: F) -> boolwhere - Self: Sized, - I: IntoIterator, - F: FnMut(Self::Item, <I as IntoIterator>::Item) -> bool,

🔬This is a nightly-only experimental API. (iter_order_by)
Determines if the elements of this Iterator are equal to those of -another with respect to the specified equality function. Read more
1.5.0 · source§

fn ne<I>(self, other: I) -> boolwhere - I: IntoIterator, - Self::Item: PartialEq<<I as IntoIterator>::Item>, - Self: Sized,

Determines if the elements of this Iterator are not equal to those of -another. Read more
1.5.0 · source§

fn lt<I>(self, other: I) -> boolwhere - I: IntoIterator, - Self::Item: PartialOrd<<I as IntoIterator>::Item>, - Self: Sized,

Determines if the elements of this Iterator are lexicographically -less than those of another. Read more
1.5.0 · source§

fn le<I>(self, other: I) -> boolwhere - I: IntoIterator, - Self::Item: PartialOrd<<I as IntoIterator>::Item>, - Self: Sized,

Determines if the elements of this Iterator are lexicographically -less or equal to those of another. Read more
1.5.0 · source§

fn gt<I>(self, other: I) -> boolwhere - I: IntoIterator, - Self::Item: PartialOrd<<I as IntoIterator>::Item>, - Self: Sized,

Determines if the elements of this Iterator are lexicographically -greater than those of another. Read more
1.5.0 · source§

fn ge<I>(self, other: I) -> boolwhere - I: IntoIterator, - Self::Item: PartialOrd<<I as IntoIterator>::Item>, - Self: Sized,

Determines if the elements of this Iterator are lexicographically -greater than or equal to those of another. Read more
source§

fn is_sorted_by<F>(self, compare: F) -> boolwhere - Self: Sized, - F: FnMut(&Self::Item, &Self::Item) -> Option<Ordering>,

🔬This is a nightly-only experimental API. (is_sorted)
Checks if the elements of this iterator are sorted using the given comparator function. Read more
source§

fn is_sorted_by_key<F, K>(self, f: F) -> boolwhere - Self: Sized, - F: FnMut(Self::Item) -> K, - K: PartialOrd<K>,

🔬This is a nightly-only experimental API. (is_sorted)
Checks if the elements of this iterator are sorted using the given key extraction -function. Read more
source§

impl FusedIterator for TrieEntryIter<'_>

Auto Trait Implementations§

§

impl<'a> RefUnwindSafe for TrieEntryIter<'a>

§

impl<'a> Send for TrieEntryIter<'a>

§

impl<'a> Sync for TrieEntryIter<'a>

§

impl<'a> Unpin for TrieEntryIter<'a>

§

impl<'a> UnwindSafe for TrieEntryIter<'a>

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,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

source§

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

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

-
source§

impl<T, U> Into<U> for Twhere - U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

+As soon as an order can be determined, the evaluation stops and a result is returned. Read more
source§

fn partial_cmp_by<I, F>(self, other: I, partial_cmp: F) -> Option<Ordering>where + Self: Sized, + I: IntoIterator, + F: FnMut(Self::Item, <I as IntoIterator>::Item) -> Option<Ordering>,

🔬This is a nightly-only experimental API. (iter_order_by)
Lexicographically compares the elements of this Iterator with those +of another with respect to the specified comparison function. Read more
1.5.0 · source§

fn eq<I>(self, other: I) -> boolwhere + I: IntoIterator, + Self::Item: PartialEq<<I as IntoIterator>::Item>, + Self: Sized,

Determines if the elements of this Iterator are equal to those of +another. Read more
source§

fn eq_by<I, F>(self, other: I, eq: F) -> boolwhere + Self: Sized, + I: IntoIterator, + F: FnMut(Self::Item, <I as IntoIterator>::Item) -> bool,

🔬This is a nightly-only experimental API. (iter_order_by)
Determines if the elements of this Iterator are equal to those of +another with respect to the specified equality function. Read more
1.5.0 · source§

fn ne<I>(self, other: I) -> boolwhere + I: IntoIterator, + Self::Item: PartialEq<<I as IntoIterator>::Item>, + Self: Sized,

Determines if the elements of this Iterator are not equal to those of +another. Read more
1.5.0 · source§

fn lt<I>(self, other: I) -> boolwhere + I: IntoIterator, + Self::Item: PartialOrd<<I as IntoIterator>::Item>, + Self: Sized,

Determines if the elements of this Iterator are lexicographically +less than those of another. Read more
1.5.0 · source§

fn le<I>(self, other: I) -> boolwhere + I: IntoIterator, + Self::Item: PartialOrd<<I as IntoIterator>::Item>, + Self: Sized,

Determines if the elements of this Iterator are lexicographically +less or equal to those of another. Read more
1.5.0 · source§

fn gt<I>(self, other: I) -> boolwhere + I: IntoIterator, + Self::Item: PartialOrd<<I as IntoIterator>::Item>, + Self: Sized,

Determines if the elements of this Iterator are lexicographically +greater than those of another. Read more
1.5.0 · source§

fn ge<I>(self, other: I) -> boolwhere + I: IntoIterator, + Self::Item: PartialOrd<<I as IntoIterator>::Item>, + Self: Sized,

Determines if the elements of this Iterator are lexicographically +greater than or equal to those of another. Read more
source§

fn is_sorted_by<F>(self, compare: F) -> boolwhere + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> Option<Ordering>,

🔬This is a nightly-only experimental API. (is_sorted)
Checks if the elements of this iterator are sorted using the given comparator function. Read more
source§

fn is_sorted_by_key<F, K>(self, f: F) -> boolwhere + Self: Sized, + F: FnMut(Self::Item) -> K, + K: PartialOrd,

🔬This is a nightly-only experimental API. (is_sorted)
Checks if the elements of this iterator are sorted using the given key extraction +function. Read more
source§

impl FusedIterator for TrieEntryIter<'_>

Auto Trait Implementations§

§

impl<'a> RefUnwindSafe for TrieEntryIter<'a>

§

impl<'a> Send for TrieEntryIter<'a>

§

impl<'a> Sync for TrieEntryIter<'a>

§

impl<'a> Unpin for TrieEntryIter<'a>

§

impl<'a> UnwindSafe for TrieEntryIter<'a>

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,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

source§

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

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

+
source§

impl<T, U> Into<U> for Twhere + U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of -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>( +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>( 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>( +) -> 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, 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 +) -> 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( self, - element: Self::Item -) -> IntersperseWith<Self, IntersperseElementSimple<Self::Item>>where - Self: Sized, - Self::Item: Clone,

An iterator adaptor to insert a particular value + 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 - Self: Sized, - F: FnMut() -> Self::Item,

An iterator adaptor to insert a particular value created by a function + 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>( 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 - J: IntoIterator, - Self: Sized,

Create an iterator which iterates over both this and the specified +) -> 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 + 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 - F: FnMut(&mut Self) -> Option<B>, - Self: Sized,

A “meta iterator adaptor”. Its closure receives a reference to the + 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 - Self: Sized, - F: FnMut(&Self::Item) -> K, - K: PartialEq<K>,

Return an iterable that can group iterator elements. + Self: Sized, + F: FnMut(&Self::Item) -> K, + K: PartialEq,
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 - Self: Sized + Iterator<Item = <T as TupleCollect>::Item>, +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 + <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 - 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 + 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 - Self: Sized + Iterator<Item = <T as TupleCollect>::Item>, + 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 - 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 - Self: Sized,

👎Deprecated since 0.8.0: Use std .step_by() instead
Return an iterator adaptor that steps n elements in the base iterator + 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 + 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 - 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: 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, 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
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 + Self: Iterator<Item = Result<T, E>> + Sized, + F: FnMut(T) -> U,
👎Deprecated since 0.10.0: Use .map_ok() instead
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 - Self: Iterator<Item = Result<T, E>> + Sized, - F: FnMut(&T) -> bool,

Return an iterator adaptor that filters every Result::Ok + 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 - Self: Iterator<Item = Result<T, E>> + Sized, - F: FnMut(T) -> Option<U>,

Return an iterator adaptor that filters and transforms every + 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 - 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 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 + 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 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 - Self: Sized, - Self::Item: PartialOrd<Self::Item>, - J: IntoIterator<Item = Self::Item>,

Return an iterator adaptor that merges the two base iterators in +) -> MergeBy<Self, <J as IntoIterator>::IntoIter, MergeLte>where + Self: Sized, + Self::Item: PartialOrd, + 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>( self, other: J, is_first: F -) -> MergeBy<Self, <J as IntoIterator>::IntoIter, F>where - Self: 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. +) -> MergeBy<Self, <J as IntoIterator>::IntoIter, F>where + Self: 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, T>( self, other: J, cmp_fn: F -) -> MergeBy<Self, <J as IntoIterator>::IntoIter, MergeFuncLR<F, <F as FuncLR<Self::Item, <<J as IntoIterator>::IntoIter as Iterator>::Item>>::T>>where - J: IntoIterator, - F: FnMut(&Self::Item, &<J as IntoIterator>::Item) -> T, - 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 - 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 +) -> MergeBy<Self, <J as IntoIterator>::IntoIter, MergeFuncLR<F, <F as FuncLR<Self::Item, <<J as IntoIterator>::IntoIter as Iterator>::Item>>::T>>where + J: IntoIterator, + F: FnMut(&Self::Item, &<J as IntoIterator>::Item) -> T, + 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 + Self: Sized, + Self::Item: IntoIterator, + <Self::Item as IntoIterator>::Item: PartialOrd,

Return an iterator adaptor that flattens an iterator of iterators by 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 +) -> 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>( self, other: J -) -> Product<Self, <J as IntoIterator>::IntoIter>where - Self: Sized, - Self::Item: Clone, - J: IntoIterator, - <J as IntoIterator>::IntoIter: Clone,

Return an iterator adaptor that iterates over the cartesian product of +) -> Product<Self, <J as IntoIterator>::IntoIter>where + Self: Sized, + Self::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( 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 - 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 - Self: Sized, - Self::Item: PartialEq<Self::Item>,

Remove duplicates from sections of consecutive identical elements. +) -> 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 + 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 + Self: Sized, + Self::Item: PartialEq,

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>( 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, +) -> 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( self -) -> CoalesceBy<Self, DedupPredWithCount2CoalescePred<DedupEq>, (usize, Self::Item)>where - Self: Sized,

Remove duplicates from sections of consecutive identical elements, while keeping a count of +) -> 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>( self, cmp: Cmp -) -> CoalesceBy<Self, DedupPredWithCount2CoalescePred<Cmp>, (usize, Self::Item)>where - Self: Sized, - Cmp: FnMut(&Self::Item, &Self::Item) -> bool,

Remove duplicates from sections of consecutive identical elements, while keeping a count of +) -> CoalesceBy<Self, DedupPredWithCount2CoalescePred<Cmp>, (usize, Self::Item)>where + Self: Sized, + Cmp: 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 - Self: Sized, - Self::Item: Eq + Hash,

Return an iterator adaptor that produces elements that appear more than once during the +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 - Self: Sized, - V: Eq + Hash, - F: FnMut(&Self::Item) -> V,

Return an iterator adaptor that produces elements that appear more than once during the + 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 - Self: Sized, - Self::Item: Clone + Eq + Hash,

Return an iterator adaptor that filters out elements that have + 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 - Self: Sized, - V: Eq + Hash, - F: FnMut(&Self::Item) -> V,

Return an iterator adaptor that filters out elements that have + 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 - Self: Sized + PeekingNext, - F: FnMut(&Self::Item) -> bool,

Return an iterator adaptor that borrows from this iterator and + 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 - Self: Clone, - F: FnMut(&Self::Item) -> bool,

Return an iterator adaptor that borrows from a Clone-able iterator + 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 take_while_inclusive<F>(self, accept: F) -> TakeWhileInclusive<Self, F>where - Self: Sized, - F: FnMut(&Self::Item) -> bool,

Returns an iterator adaptor that consumes elements while the given + 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 + 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 - Self: Sized + Clone, - Self::Item: Clone, + 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 - Self: Sized, - Self::Item: Clone,

Return an iterator adaptor that iterates over the k-length combinations of +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( self, - k: usize + 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 - Self: Sized, - Self::Item: Clone,

Return an iterator adaptor that iterates over all k-permutations of the + 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 + 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 - 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 - Self: Sized, - F: FnMut(usize) -> Self::Item,

Return an iterator adaptor that pads the sequence to a minimum length of + 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 + 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 combines each element with a Position to + 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 + 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 - 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 - Self: Sized + Iterator<Item = <T as TupleCollect>::Item>, + 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 + 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 - Self: Sized + Iterator<Item = <T as TupleCollect>::Item>, +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 - 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 - 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 - 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 - Self: Sized, - Self::Item: PartialEq<Self::Item>,

Check whether all elements compare equal. Read more
source§

fn all_equal_value( +(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 + 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 + Self: Sized, + Self::Item: Borrow<Q>, + Q: PartialEq,

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,

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: PartialEq<Self::Item>,

If there are elements and they are all equal, return a single copy of that element. +) -> Result<Self::Item, Option<(Self::Item, Self::Item)>>where + Self: Sized, + Self::Item: PartialEq,
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 - Self: Sized + DoubleEndedIterator,

Consume the last n elements from the iterator eagerly, +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 + 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 - 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, - 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 - 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 + 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, + 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>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 + 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 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 - 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 - Self: Iterator<Item = Result<A, E>>, - F: FnMut(B, A) -> B,

👎Deprecated since 0.10.0: Use .fold_ok() instead
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 - 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(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 - 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, - 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 - 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 - 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: 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 - 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 - 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: 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 - 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 - 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 - 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: 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 - 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 - 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>( - 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 + 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 + 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 + Self: Iterator<Item = Result<A, E>>, + F: FnMut(B, A) -> B,

👎Deprecated since 0.10.0: Use .fold_ok() instead
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 + 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(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 + 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, + 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 + 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>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>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>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>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>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>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>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>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: 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 + 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>>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>(self, f: F) -> HashMap<K, Vec<V>>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 - Self: Iterator<Item = (K, V)> + Sized, - K: Hash + Eq,

Constructs a GroupingMap to be used later with one of the efficient + 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>( 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 - 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: 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 - 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 - 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: 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 - Self: Sized, - K: Ord, - 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: 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 - 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 - 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: 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 - 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 - 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: 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 - 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 - 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 - 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 - 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 - Self: Sized,

If the iterator yields exactly one element, that element will be returned, otherwise + 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>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>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>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>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>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>where + Self: Sized, + K: Ord, + 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,

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, + 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 + 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 + 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: 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 + 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 + 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: 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 + 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 + Self: Sized, + Self::Item: PartialOrd,

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 + Self: Sized, + K: PartialOrd, + 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 + 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 + 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 - Self: Sized,

If the iterator yields no elements, Ok(None) will be returned. If the iterator yields +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 - 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 - Self: Sized, - Self::Item: Eq + Hash,

Collect the items in this iterator and return a HashMap which + 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>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 - Self: Sized, - K: Eq + Hash, - F: FnMut(Self::Item) -> K,

Collect the items in this iterator and return a HashMap which +of times it appears. Read more
source§

fn counts_by<K, F>(self, f: F) -> HashMap<K, usize>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 - Self: Sized + MultiUnzip<FromI>,

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

fn try_len(&self) -> Result<usize, (usize, Option<usize>)>

Returns the length of the iterator if one exists. -Otherwise return self.size_hint(). Read more
source§

impl<T, U> TryFrom<U> for Twhere - U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
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.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
\ No newline at end of file + Self: Sized + MultiUnzip<FromI>,
Converts an iterator of tuples into a tuple of containers. Read more
source§

fn try_len(&self) -> Result<usize, (usize, Option<usize>)>

Returns the length of the iterator if one exists. +Otherwise return self.size_hint(). Read more
source§

impl<T, U> TryFrom<U> for Twhere + U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
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.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
\ No newline at end of file diff --git a/rust/sudachi/dic/lexicon/word_id_table/index.html b/rust/sudachi/dic/lexicon/word_id_table/index.html index 8942fbbc..af51aa02 100644 --- a/rust/sudachi/dic/lexicon/word_id_table/index.html +++ b/rust/sudachi/dic/lexicon/word_id_table/index.html @@ -1 +1 @@ -sudachi::dic::lexicon::word_id_table - Rust
\ No newline at end of file +sudachi::dic::lexicon::word_id_table - Rust
\ No newline at end of file diff --git a/rust/sudachi/dic/lexicon/word_id_table/struct.WordIdIter.html b/rust/sudachi/dic/lexicon/word_id_table/struct.WordIdIter.html index 827a5b31..d99d28d0 100644 --- a/rust/sudachi/dic/lexicon/word_id_table/struct.WordIdIter.html +++ b/rust/sudachi/dic/lexicon/word_id_table/struct.WordIdIter.html @@ -1,604 +1,601 @@ -WordIdIter in sudachi::dic::lexicon::word_id_table - Rust
pub struct WordIdIter { /* private fields */ }

Trait Implementations§

source§

impl Iterator for WordIdIter

§

type Item = u32

The type of the elements being iterated over.
source§

fn next(&mut self) -> Option<Self::Item>

Advances the iterator and returns the next value. Read more
source§

fn next_chunk<const N: usize>( +WordIdIter in sudachi::dic::lexicon::word_id_table - Rust
pub struct WordIdIter { /* private fields */ }

Trait Implementations§

source§

impl Iterator for WordIdIter

§

type Item = u32

The type of the elements being iterated over.
source§

fn next(&mut self) -> Option<Self::Item>

Advances the iterator and returns the next value. Read more
source§

fn next_chunk<const N: usize>( &mut self -) -> Result<[Self::Item; N], IntoIter<Self::Item, N>>where - Self: Sized,

🔬This is a nightly-only experimental API. (iter_next_chunk)
Advances the iterator and returns an array containing the next N values. Read more
1.0.0 · source§

fn size_hint(&self) -> (usize, Option<usize>)

Returns the bounds on the remaining length of the iterator. Read more
1.0.0 · source§

fn count(self) -> usizewhere - Self: Sized,

Consumes the iterator, counting the number of iterations and returning it. Read more
1.0.0 · source§

fn last(self) -> Option<Self::Item>where - Self: Sized,

Consumes the iterator, returning the last element. Read more
source§

fn advance_by(&mut self, n: usize) -> Result<(), NonZeroUsize>

🔬This is a nightly-only experimental API. (iter_advance_by)
Advances the iterator by n elements. Read more
1.0.0 · source§

fn nth(&mut self, n: usize) -> Option<Self::Item>

Returns the nth element of the iterator. Read more
1.28.0 · source§

fn step_by(self, step: usize) -> StepBy<Self>where - Self: Sized,

Creates an iterator starting at the same point, but stepping by -the given amount at each iteration. Read more
1.0.0 · source§

fn chain<U>(self, other: U) -> Chain<Self, <U as IntoIterator>::IntoIter>where - Self: Sized, - U: IntoIterator<Item = Self::Item>,

Takes two iterators and creates a new iterator over both in sequence. Read more
1.0.0 · source§

fn zip<U>(self, other: U) -> Zip<Self, <U as IntoIterator>::IntoIter>where - Self: Sized, - U: IntoIterator,

‘Zips up’ two iterators into a single iterator of pairs. Read more
source§

fn intersperse(self, separator: Self::Item) -> Intersperse<Self>where - Self: Sized, - Self::Item: Clone,

🔬This is a nightly-only experimental API. (iter_intersperse)
Creates a new iterator which places a copy of separator between adjacent -items of the original iterator. Read more
source§

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

🔬This is a nightly-only experimental API. (iter_intersperse)
Creates a new iterator which places an item generated by separator -between adjacent items of the original iterator. Read more
1.0.0 · source§

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

Takes a closure and creates an iterator which calls that closure on each -element. Read more
1.21.0 · source§

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

Calls a closure on each element of an iterator. Read more
1.0.0 · source§

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

Creates an iterator which uses a closure to determine if an element -should be yielded. Read more
1.0.0 · source§

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

Creates an iterator that both filters and maps. Read more
1.0.0 · source§

fn enumerate(self) -> Enumerate<Self>where - Self: Sized,

Creates an iterator which gives the current iteration count as well as -the next value. Read more
1.0.0 · source§

fn peekable(self) -> Peekable<Self>where - Self: Sized,

Creates an iterator which can use the peek and peek_mut methods +) -> Result<[Self::Item; N], IntoIter<Self::Item, N>>where + Self: Sized,

🔬This is a nightly-only experimental API. (iter_next_chunk)
Advances the iterator and returns an array containing the next N values. Read more
1.0.0 · source§

fn size_hint(&self) -> (usize, Option<usize>)

Returns the bounds on the remaining length of the iterator. Read more
1.0.0 · source§

fn count(self) -> usizewhere + Self: Sized,

Consumes the iterator, counting the number of iterations and returning it. Read more
1.0.0 · source§

fn last(self) -> Option<Self::Item>where + Self: Sized,

Consumes the iterator, returning the last element. Read more
source§

fn advance_by(&mut self, n: usize) -> Result<(), NonZeroUsize>

🔬This is a nightly-only experimental API. (iter_advance_by)
Advances the iterator by n elements. Read more
1.0.0 · source§

fn nth(&mut self, n: usize) -> Option<Self::Item>

Returns the nth element of the iterator. Read more
1.28.0 · source§

fn step_by(self, step: usize) -> StepBy<Self>where + Self: Sized,

Creates an iterator starting at the same point, but stepping by +the given amount at each iteration. Read more
1.0.0 · source§

fn chain<U>(self, other: U) -> Chain<Self, <U as IntoIterator>::IntoIter>where + Self: Sized, + U: IntoIterator<Item = Self::Item>,

Takes two iterators and creates a new iterator over both in sequence. Read more
1.0.0 · source§

fn zip<U>(self, other: U) -> Zip<Self, <U as IntoIterator>::IntoIter>where + Self: Sized, + U: IntoIterator,

‘Zips up’ two iterators into a single iterator of pairs. Read more
source§

fn intersperse(self, separator: Self::Item) -> Intersperse<Self>where + Self: Sized, + Self::Item: Clone,

🔬This is a nightly-only experimental API. (iter_intersperse)
Creates a new iterator which places a copy of separator between adjacent +items of the original iterator. Read more
source§

fn intersperse_with<G>(self, separator: G) -> IntersperseWith<Self, G>where + Self: Sized, + G: FnMut() -> Self::Item,

🔬This is a nightly-only experimental API. (iter_intersperse)
Creates a new iterator which places an item generated by separator +between adjacent items of the original iterator. Read more
1.0.0 · source§

fn map<B, F>(self, f: F) -> Map<Self, F>where + Self: Sized, + F: FnMut(Self::Item) -> B,

Takes a closure and creates an iterator which calls that closure on each +element. Read more
1.21.0 · source§

fn for_each<F>(self, f: F)where + Self: Sized, + F: FnMut(Self::Item),

Calls a closure on each element of an iterator. Read more
1.0.0 · source§

fn filter<P>(self, predicate: P) -> Filter<Self, P>where + Self: Sized, + P: FnMut(&Self::Item) -> bool,

Creates an iterator which uses a closure to determine if an element +should be yielded. Read more
1.0.0 · source§

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F>where + Self: Sized, + F: FnMut(Self::Item) -> Option<B>,

Creates an iterator that both filters and maps. Read more
1.0.0 · source§

fn enumerate(self) -> Enumerate<Self>where + Self: Sized,

Creates an iterator which gives the current iteration count as well as +the next value. Read more
1.0.0 · source§

fn peekable(self) -> Peekable<Self>where + Self: Sized,

Creates an iterator which can use the peek and peek_mut methods to look at the next element of the iterator without consuming it. See -their documentation for more information. Read more
1.0.0 · source§

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

Creates an iterator that skips elements based on a predicate. Read more
1.0.0 · source§

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

Creates an iterator that yields elements based on a predicate. Read more
1.57.0 · source§

fn map_while<B, P>(self, predicate: P) -> MapWhile<Self, P>where - Self: Sized, - P: FnMut(Self::Item) -> Option<B>,

Creates an iterator that both yields elements based on a predicate and maps. Read more
1.0.0 · source§

fn skip(self, n: usize) -> Skip<Self>where - Self: Sized,

Creates an iterator that skips the first n elements. Read more
1.0.0 · source§

fn take(self, n: usize) -> Take<Self>where - Self: Sized,

Creates an iterator that yields the first n elements, or fewer -if the underlying iterator ends sooner. Read more
1.0.0 · source§

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F>where - Self: Sized, - F: FnMut(&mut St, Self::Item) -> Option<B>,

An iterator adapter which, like fold, holds internal state, but -unlike fold, produces a new iterator. Read more
1.0.0 · source§

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F>where - Self: Sized, - U: IntoIterator, - F: FnMut(Self::Item) -> U,

Creates an iterator that works like map, but flattens nested structure. Read more
source§

fn map_windows<F, R, const N: usize>(self, f: F) -> MapWindows<Self, F, N>where - Self: Sized, - F: FnMut(&[Self::Item; N]) -> R,

🔬This is a nightly-only experimental API. (iter_map_windows)
Calls the given function f for each contiguous window of size N over -self and returns an iterator over the outputs of f. Like slice::windows(), -the windows during mapping overlap as well. Read more
1.0.0 · source§

fn fuse(self) -> Fuse<Self>where - Self: Sized,

Creates an iterator which ends after the first None. Read more
1.0.0 · source§

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

Does something with each element of an iterator, passing the value on. Read more
1.0.0 · source§

fn by_ref(&mut self) -> &mut Selfwhere - Self: Sized,

Borrows an iterator, rather than consuming it. Read more
1.0.0 · source§

fn collect<B>(self) -> Bwhere - B: FromIterator<Self::Item>, - Self: Sized,

Transforms an iterator into a collection. Read more
source§

fn collect_into<E>(self, collection: &mut E) -> &mut Ewhere - E: Extend<Self::Item>, - Self: Sized,

🔬This is a nightly-only experimental API. (iter_collect_into)
Collects all the items from an iterator into a collection. Read more
1.0.0 · source§

fn partition<B, F>(self, f: F) -> (B, B)where - Self: Sized, - B: Default + Extend<Self::Item>, - F: FnMut(&Self::Item) -> bool,

Consumes an iterator, creating two collections from it. Read more
source§

fn is_partitioned<P>(self, predicate: P) -> boolwhere - Self: Sized, - P: FnMut(Self::Item) -> bool,

🔬This is a nightly-only experimental API. (iter_is_partitioned)
Checks if the elements of this iterator are partitioned according to the given predicate, -such that all those that return true precede all those that return false. Read more
1.27.0 · source§

fn try_fold<B, F, R>(&mut self, init: B, f: F) -> Rwhere - Self: Sized, - F: FnMut(B, Self::Item) -> R, - R: Try<Output = B>,

An iterator method that applies a function as long as it returns -successfully, producing a single, final value. Read more
1.27.0 · source§

fn try_for_each<F, R>(&mut self, f: F) -> Rwhere - Self: Sized, - F: FnMut(Self::Item) -> R, - R: Try<Output = ()>,

An iterator method that applies a fallible function to each item in the -iterator, stopping at the first error and returning that error. Read more
1.0.0 · source§

fn fold<B, F>(self, init: B, f: F) -> Bwhere - Self: Sized, - F: FnMut(B, Self::Item) -> B,

Folds every element into an accumulator by applying an operation, -returning the final result. Read more
1.51.0 · source§

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

Reduces the elements to a single one, by repeatedly applying a reducing -operation. Read more
source§

fn try_reduce<F, R>( +their documentation for more information. Read more

1.0.0 · source§

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P>where + Self: Sized, + P: FnMut(&Self::Item) -> bool,

Creates an iterator that skips elements based on a predicate. Read more
1.0.0 · source§

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P>where + Self: Sized, + P: FnMut(&Self::Item) -> bool,

Creates an iterator that yields elements based on a predicate. Read more
1.57.0 · source§

fn map_while<B, P>(self, predicate: P) -> MapWhile<Self, P>where + Self: Sized, + P: FnMut(Self::Item) -> Option<B>,

Creates an iterator that both yields elements based on a predicate and maps. Read more
1.0.0 · source§

fn skip(self, n: usize) -> Skip<Self>where + Self: Sized,

Creates an iterator that skips the first n elements. Read more
1.0.0 · source§

fn take(self, n: usize) -> Take<Self>where + Self: Sized,

Creates an iterator that yields the first n elements, or fewer +if the underlying iterator ends sooner. Read more
1.0.0 · source§

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F>where + Self: Sized, + F: FnMut(&mut St, Self::Item) -> Option<B>,

An iterator adapter which, like fold, holds internal state, but +unlike fold, produces a new iterator. Read more
1.0.0 · source§

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F>where + Self: Sized, + U: IntoIterator, + F: FnMut(Self::Item) -> U,

Creates an iterator that works like map, but flattens nested structure. Read more
source§

fn map_windows<F, R, const N: usize>(self, f: F) -> MapWindows<Self, F, N>where + Self: Sized, + F: FnMut(&[Self::Item; N]) -> R,

🔬This is a nightly-only experimental API. (iter_map_windows)
Calls the given function f for each contiguous window of size N over +self and returns an iterator over the outputs of f. Like slice::windows(), +the windows during mapping overlap as well. Read more
1.0.0 · source§

fn fuse(self) -> Fuse<Self>where + Self: Sized,

Creates an iterator which ends after the first None. Read more
1.0.0 · source§

fn inspect<F>(self, f: F) -> Inspect<Self, F>where + Self: Sized, + F: FnMut(&Self::Item),

Does something with each element of an iterator, passing the value on. Read more
1.0.0 · source§

fn by_ref(&mut self) -> &mut Selfwhere + Self: Sized,

Borrows an iterator, rather than consuming it. Read more
1.0.0 · source§

fn collect<B>(self) -> Bwhere + B: FromIterator<Self::Item>, + Self: Sized,

Transforms an iterator into a collection. Read more
source§

fn collect_into<E>(self, collection: &mut E) -> &mut Ewhere + E: Extend<Self::Item>, + Self: Sized,

🔬This is a nightly-only experimental API. (iter_collect_into)
Collects all the items from an iterator into a collection. Read more
1.0.0 · source§

fn partition<B, F>(self, f: F) -> (B, B)where + Self: Sized, + B: Default + Extend<Self::Item>, + F: FnMut(&Self::Item) -> bool,

Consumes an iterator, creating two collections from it. Read more
source§

fn is_partitioned<P>(self, predicate: P) -> boolwhere + Self: Sized, + P: FnMut(Self::Item) -> bool,

🔬This is a nightly-only experimental API. (iter_is_partitioned)
Checks if the elements of this iterator are partitioned according to the given predicate, +such that all those that return true precede all those that return false. Read more
1.27.0 · source§

fn try_fold<B, F, R>(&mut self, init: B, f: F) -> Rwhere + Self: Sized, + F: FnMut(B, Self::Item) -> R, + R: Try<Output = B>,

An iterator method that applies a function as long as it returns +successfully, producing a single, final value. Read more
1.27.0 · source§

fn try_for_each<F, R>(&mut self, f: F) -> Rwhere + Self: Sized, + F: FnMut(Self::Item) -> R, + R: Try<Output = ()>,

An iterator method that applies a fallible function to each item in the +iterator, stopping at the first error and returning that error. Read more
1.0.0 · source§

fn fold<B, F>(self, init: B, f: F) -> Bwhere + Self: Sized, + F: FnMut(B, Self::Item) -> B,

Folds every element into an accumulator by applying an operation, +returning the final result. Read more
1.51.0 · source§

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

Reduces the elements to a single one, by repeatedly applying a reducing +operation. Read more
source§

fn try_reduce<F, R>( &mut self, f: F -) -> <<R as Try>::Residual as Residual<Option<<R as Try>::Output>>>::TryTypewhere - Self: Sized, - F: FnMut(Self::Item, Self::Item) -> R, - R: Try<Output = Self::Item>, - <R as Try>::Residual: Residual<Option<Self::Item>>,

🔬This is a nightly-only experimental API. (iterator_try_reduce)
Reduces the elements to a single one by repeatedly applying a reducing operation. If the -closure returns a failure, the failure is propagated back to the caller immediately. Read more
1.0.0 · source§

fn all<F>(&mut self, f: F) -> boolwhere - Self: Sized, - F: FnMut(Self::Item) -> bool,

Tests if every element of the iterator matches a predicate. Read more
1.0.0 · source§

fn any<F>(&mut self, f: F) -> boolwhere - Self: Sized, - F: FnMut(Self::Item) -> bool,

Tests if any element of the iterator matches a predicate. Read more
1.0.0 · source§

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

Searches for an element of an iterator that satisfies a predicate. Read more
1.30.0 · source§

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

Applies function to the elements of iterator and returns -the first non-none result. Read more
source§

fn try_find<F, R>( +) -> <<R as Try>::Residual as Residual<Option<<R as Try>::Output>>>::TryTypewhere + Self: Sized, + F: FnMut(Self::Item, Self::Item) -> R, + R: Try<Output = Self::Item>, + <R as Try>::Residual: Residual<Option<Self::Item>>,

🔬This is a nightly-only experimental API. (iterator_try_reduce)
Reduces the elements to a single one by repeatedly applying a reducing operation. If the +closure returns a failure, the failure is propagated back to the caller immediately. Read more
1.0.0 · source§

fn all<F>(&mut self, f: F) -> boolwhere + Self: Sized, + F: FnMut(Self::Item) -> bool,

Tests if every element of the iterator matches a predicate. Read more
1.0.0 · source§

fn any<F>(&mut self, f: F) -> boolwhere + Self: Sized, + F: FnMut(Self::Item) -> bool,

Tests if any element of the iterator matches a predicate. Read more
1.0.0 · source§

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

Searches for an element of an iterator that satisfies a predicate. Read more
1.30.0 · source§

fn find_map<B, F>(&mut self, f: F) -> Option<B>where + Self: Sized, + F: FnMut(Self::Item) -> Option<B>,

Applies function to the elements of iterator and returns +the first non-none result. Read more
source§

fn try_find<F, R>( &mut self, f: F -) -> <<R as Try>::Residual as Residual<Option<Self::Item>>>::TryTypewhere - Self: Sized, - F: FnMut(&Self::Item) -> R, - R: Try<Output = bool>, - <R as Try>::Residual: Residual<Option<Self::Item>>,

🔬This is a nightly-only experimental API. (try_find)
Applies function to the elements of iterator and returns -the first true result or the first error. Read more
1.0.0 · source§

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

Searches for an element in an iterator, returning its index. Read more
1.0.0 · source§

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

Returns the maximum element of an iterator. Read more
1.0.0 · source§

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

Returns the minimum element of an iterator. Read more
1.6.0 · source§

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item>where - B: Ord, - Self: Sized, - F: FnMut(&Self::Item) -> B,

Returns the element that gives the maximum value from the -specified function. Read more
1.15.0 · source§

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

Returns the element that gives the maximum value with respect to the -specified comparison function. Read more
1.6.0 · source§

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item>where - B: Ord, - Self: Sized, - F: FnMut(&Self::Item) -> B,

Returns the element that gives the minimum value from the -specified function. Read more
1.15.0 · source§

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

Returns the element that gives the minimum value with respect to the -specified comparison function. Read more
1.0.0 · source§

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB)where - FromA: Default + Extend<A>, - FromB: Default + Extend<B>, - Self: Sized + Iterator<Item = (A, B)>,

Converts an iterator of pairs into a pair of containers. Read more
1.36.0 · source§

fn copied<'a, T>(self) -> Copied<Self>where - T: 'a + Copy, - Self: Sized + Iterator<Item = &'a T>,

Creates an iterator which copies all of its elements. Read more
1.0.0 · source§

fn cloned<'a, T>(self) -> Cloned<Self>where - T: 'a + Clone, - Self: Sized + Iterator<Item = &'a T>,

Creates an iterator which clones all of its elements. Read more
source§

fn array_chunks<const N: usize>(self) -> ArrayChunks<Self, N>where - Self: Sized,

🔬This is a nightly-only experimental API. (iter_array_chunks)
Returns an iterator over N elements of the iterator at a time. Read more
1.11.0 · source§

fn sum<S>(self) -> Swhere - Self: Sized, - S: Sum<Self::Item>,

Sums the elements of an iterator. Read more
1.11.0 · source§

fn product<P>(self) -> Pwhere - Self: Sized, - P: Product<Self::Item>,

Iterates over the entire iterator, multiplying all the elements Read more
1.5.0 · source§

fn cmp<I>(self, other: I) -> Orderingwhere - I: IntoIterator<Item = Self::Item>, - Self::Item: Ord, - Self: Sized,

Lexicographically compares the elements of this Iterator with those -of another. Read more
source§

fn cmp_by<I, F>(self, other: I, cmp: F) -> Orderingwhere - Self: Sized, - I: IntoIterator, - F: FnMut(Self::Item, <I as IntoIterator>::Item) -> Ordering,

🔬This is a nightly-only experimental API. (iter_order_by)
Lexicographically compares the elements of this Iterator with those -of another with respect to the specified comparison function. Read more
1.5.0 · source§

fn partial_cmp<I>(self, other: I) -> Option<Ordering>where - I: IntoIterator, - Self::Item: PartialOrd<<I as IntoIterator>::Item>, - Self: Sized,

Lexicographically compares the PartialOrd elements of -this Iterator with those of another. The comparison works like short-circuit +) -> <<R as Try>::Residual as Residual<Option<Self::Item>>>::TryTypewhere + Self: Sized, + F: FnMut(&Self::Item) -> R, + R: Try<Output = bool>, + <R as Try>::Residual: Residual<Option<Self::Item>>,
🔬This is a nightly-only experimental API. (try_find)
Applies function to the elements of iterator and returns +the first true result or the first error. Read more
1.0.0 · source§

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

Searches for an element in an iterator, returning its index. Read more
1.0.0 · source§

fn max(self) -> Option<Self::Item>where + Self: Sized, + Self::Item: Ord,

Returns the maximum element of an iterator. Read more
1.0.0 · source§

fn min(self) -> Option<Self::Item>where + Self: Sized, + Self::Item: Ord,

Returns the minimum element of an iterator. Read more
1.6.0 · source§

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item>where + B: Ord, + Self: Sized, + F: FnMut(&Self::Item) -> B,

Returns the element that gives the maximum value from the +specified function. Read more
1.15.0 · source§

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

Returns the element that gives the maximum value with respect to the +specified comparison function. Read more
1.6.0 · source§

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item>where + B: Ord, + Self: Sized, + F: FnMut(&Self::Item) -> B,

Returns the element that gives the minimum value from the +specified function. Read more
1.15.0 · source§

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

Returns the element that gives the minimum value with respect to the +specified comparison function. Read more
1.0.0 · source§

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB)where + FromA: Default + Extend<A>, + FromB: Default + Extend<B>, + Self: Sized + Iterator<Item = (A, B)>,

Converts an iterator of pairs into a pair of containers. Read more
1.36.0 · source§

fn copied<'a, T>(self) -> Copied<Self>where + T: 'a + Copy, + Self: Sized + Iterator<Item = &'a T>,

Creates an iterator which copies all of its elements. Read more
1.0.0 · source§

fn cloned<'a, T>(self) -> Cloned<Self>where + T: 'a + Clone, + Self: Sized + Iterator<Item = &'a T>,

Creates an iterator which clones all of its elements. Read more
source§

fn array_chunks<const N: usize>(self) -> ArrayChunks<Self, N>where + Self: Sized,

🔬This is a nightly-only experimental API. (iter_array_chunks)
Returns an iterator over N elements of the iterator at a time. Read more
1.11.0 · source§

fn sum<S>(self) -> Swhere + Self: Sized, + S: Sum<Self::Item>,

Sums the elements of an iterator. Read more
1.11.0 · source§

fn product<P>(self) -> Pwhere + Self: Sized, + P: Product<Self::Item>,

Iterates over the entire iterator, multiplying all the elements Read more
1.5.0 · source§

fn cmp<I>(self, other: I) -> Orderingwhere + I: IntoIterator<Item = Self::Item>, + Self::Item: Ord, + Self: Sized,

Lexicographically compares the elements of this Iterator with those +of another. Read more
source§

fn cmp_by<I, F>(self, other: I, cmp: F) -> Orderingwhere + Self: Sized, + I: IntoIterator, + F: FnMut(Self::Item, <I as IntoIterator>::Item) -> Ordering,

🔬This is a nightly-only experimental API. (iter_order_by)
Lexicographically compares the elements of this Iterator with those +of another with respect to the specified comparison function. Read more
1.5.0 · source§

fn partial_cmp<I>(self, other: I) -> Option<Ordering>where + I: IntoIterator, + Self::Item: PartialOrd<<I as IntoIterator>::Item>, + Self: Sized,

Lexicographically compares the PartialOrd elements of +this Iterator with those of another. The comparison works like short-circuit evaluation, returning a result without comparing the remaining elements. -As soon as an order can be determined, the evaluation stops and a result is returned. Read more
source§

fn partial_cmp_by<I, F>(self, other: I, partial_cmp: F) -> Option<Ordering>where - Self: Sized, - I: IntoIterator, - F: FnMut(Self::Item, <I as IntoIterator>::Item) -> Option<Ordering>,

🔬This is a nightly-only experimental API. (iter_order_by)
Lexicographically compares the elements of this Iterator with those -of another with respect to the specified comparison function. Read more
1.5.0 · source§

fn eq<I>(self, other: I) -> boolwhere - I: IntoIterator, - Self::Item: PartialEq<<I as IntoIterator>::Item>, - Self: Sized,

Determines if the elements of this Iterator are equal to those of -another. Read more
source§

fn eq_by<I, F>(self, other: I, eq: F) -> boolwhere - Self: Sized, - I: IntoIterator, - F: FnMut(Self::Item, <I as IntoIterator>::Item) -> bool,

🔬This is a nightly-only experimental API. (iter_order_by)
Determines if the elements of this Iterator are equal to those of -another with respect to the specified equality function. Read more
1.5.0 · source§

fn ne<I>(self, other: I) -> boolwhere - I: IntoIterator, - Self::Item: PartialEq<<I as IntoIterator>::Item>, - Self: Sized,

Determines if the elements of this Iterator are not equal to those of -another. Read more
1.5.0 · source§

fn lt<I>(self, other: I) -> boolwhere - I: IntoIterator, - Self::Item: PartialOrd<<I as IntoIterator>::Item>, - Self: Sized,

Determines if the elements of this Iterator are lexicographically -less than those of another. Read more
1.5.0 · source§

fn le<I>(self, other: I) -> boolwhere - I: IntoIterator, - Self::Item: PartialOrd<<I as IntoIterator>::Item>, - Self: Sized,

Determines if the elements of this Iterator are lexicographically -less or equal to those of another. Read more
1.5.0 · source§

fn gt<I>(self, other: I) -> boolwhere - I: IntoIterator, - Self::Item: PartialOrd<<I as IntoIterator>::Item>, - Self: Sized,

Determines if the elements of this Iterator are lexicographically -greater than those of another. Read more
1.5.0 · source§

fn ge<I>(self, other: I) -> boolwhere - I: IntoIterator, - Self::Item: PartialOrd<<I as IntoIterator>::Item>, - Self: Sized,

Determines if the elements of this Iterator are lexicographically -greater than or equal to those of another. Read more
source§

fn is_sorted(self) -> boolwhere - Self: Sized, - Self::Item: PartialOrd<Self::Item>,

🔬This is a nightly-only experimental API. (is_sorted)
Checks if the elements of this iterator are sorted. Read more
source§

fn is_sorted_by<F>(self, compare: F) -> boolwhere - Self: Sized, - F: FnMut(&Self::Item, &Self::Item) -> Option<Ordering>,

🔬This is a nightly-only experimental API. (is_sorted)
Checks if the elements of this iterator are sorted using the given comparator function. Read more
source§

fn is_sorted_by_key<F, K>(self, f: F) -> boolwhere - Self: Sized, - F: FnMut(Self::Item) -> K, - K: PartialOrd<K>,

🔬This is a nightly-only experimental API. (is_sorted)
Checks if the elements of this iterator are sorted using the given key extraction -function. Read more
source§

impl FusedIterator for WordIdIter

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,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

source§

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

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

-
source§

impl<T, U> Into<U> for Twhere - U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

+As soon as an order can be determined, the evaluation stops and a result is returned. Read more
source§

fn partial_cmp_by<I, F>(self, other: I, partial_cmp: F) -> Option<Ordering>where + Self: Sized, + I: IntoIterator, + F: FnMut(Self::Item, <I as IntoIterator>::Item) -> Option<Ordering>,

🔬This is a nightly-only experimental API. (iter_order_by)
Lexicographically compares the elements of this Iterator with those +of another with respect to the specified comparison function. Read more
1.5.0 · source§

fn eq<I>(self, other: I) -> boolwhere + I: IntoIterator, + Self::Item: PartialEq<<I as IntoIterator>::Item>, + Self: Sized,

Determines if the elements of this Iterator are equal to those of +another. Read more
source§

fn eq_by<I, F>(self, other: I, eq: F) -> boolwhere + Self: Sized, + I: IntoIterator, + F: FnMut(Self::Item, <I as IntoIterator>::Item) -> bool,

🔬This is a nightly-only experimental API. (iter_order_by)
Determines if the elements of this Iterator are equal to those of +another with respect to the specified equality function. Read more
1.5.0 · source§

fn ne<I>(self, other: I) -> boolwhere + I: IntoIterator, + Self::Item: PartialEq<<I as IntoIterator>::Item>, + Self: Sized,

Determines if the elements of this Iterator are not equal to those of +another. Read more
1.5.0 · source§

fn lt<I>(self, other: I) -> boolwhere + I: IntoIterator, + Self::Item: PartialOrd<<I as IntoIterator>::Item>, + Self: Sized,

Determines if the elements of this Iterator are lexicographically +less than those of another. Read more
1.5.0 · source§

fn le<I>(self, other: I) -> boolwhere + I: IntoIterator, + Self::Item: PartialOrd<<I as IntoIterator>::Item>, + Self: Sized,

Determines if the elements of this Iterator are lexicographically +less or equal to those of another. Read more
1.5.0 · source§

fn gt<I>(self, other: I) -> boolwhere + I: IntoIterator, + Self::Item: PartialOrd<<I as IntoIterator>::Item>, + Self: Sized,

Determines if the elements of this Iterator are lexicographically +greater than those of another. Read more
1.5.0 · source§

fn ge<I>(self, other: I) -> boolwhere + I: IntoIterator, + Self::Item: PartialOrd<<I as IntoIterator>::Item>, + Self: Sized,

Determines if the elements of this Iterator are lexicographically +greater than or equal to those of another. Read more
source§

fn is_sorted(self) -> boolwhere + Self: Sized, + Self::Item: PartialOrd,

🔬This is a nightly-only experimental API. (is_sorted)
Checks if the elements of this iterator are sorted. Read more
source§

fn is_sorted_by<F>(self, compare: F) -> boolwhere + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> Option<Ordering>,

🔬This is a nightly-only experimental API. (is_sorted)
Checks if the elements of this iterator are sorted using the given comparator function. Read more
source§

fn is_sorted_by_key<F, K>(self, f: F) -> boolwhere + Self: Sized, + F: FnMut(Self::Item) -> K, + K: PartialOrd,

🔬This is a nightly-only experimental API. (is_sorted)
Checks if the elements of this iterator are sorted using the given key extraction +function. Read more
source§

impl FusedIterator for WordIdIter

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,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

source§

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

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

+
source§

impl<T, U> Into<U> for Twhere + U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of -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>( +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>( 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>( +) -> 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, 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 +) -> 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( self, - element: Self::Item -) -> IntersperseWith<Self, IntersperseElementSimple<Self::Item>>where - Self: Sized, - Self::Item: Clone,

An iterator adaptor to insert a particular value + 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 - Self: Sized, - F: FnMut() -> Self::Item,

An iterator adaptor to insert a particular value created by a function + 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>( 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 - J: IntoIterator, - Self: Sized,

Create an iterator which iterates over both this and the specified +) -> 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 + 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 - F: FnMut(&mut Self) -> Option<B>, - Self: Sized,

A “meta iterator adaptor”. Its closure receives a reference to the + 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 - Self: Sized, - F: FnMut(&Self::Item) -> K, - K: PartialEq<K>,

Return an iterable that can group iterator elements. + Self: Sized, + F: FnMut(&Self::Item) -> K, + K: PartialEq,
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 - Self: Sized + Iterator<Item = <T as TupleCollect>::Item>, +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 + <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 - 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 + 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 - Self: Sized + Iterator<Item = <T as TupleCollect>::Item>, + 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 - 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 - Self: Sized,

👎Deprecated since 0.8.0: Use std .step_by() instead
Return an iterator adaptor that steps n elements in the base iterator + 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 + 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 - 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: 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, 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
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 + Self: Iterator<Item = Result<T, E>> + Sized, + F: FnMut(T) -> U,
👎Deprecated since 0.10.0: Use .map_ok() instead
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 - Self: Iterator<Item = Result<T, E>> + Sized, - F: FnMut(&T) -> bool,

Return an iterator adaptor that filters every Result::Ok + 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 - Self: Iterator<Item = Result<T, E>> + Sized, - F: FnMut(T) -> Option<U>,

Return an iterator adaptor that filters and transforms every + 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 - 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 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 + 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 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 - Self: Sized, - Self::Item: PartialOrd<Self::Item>, - J: IntoIterator<Item = Self::Item>,

Return an iterator adaptor that merges the two base iterators in +) -> MergeBy<Self, <J as IntoIterator>::IntoIter, MergeLte>where + Self: Sized, + Self::Item: PartialOrd, + 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>( self, other: J, is_first: F -) -> MergeBy<Self, <J as IntoIterator>::IntoIter, F>where - Self: 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. +) -> MergeBy<Self, <J as IntoIterator>::IntoIter, F>where + Self: 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, T>( self, other: J, cmp_fn: F -) -> MergeBy<Self, <J as IntoIterator>::IntoIter, MergeFuncLR<F, <F as FuncLR<Self::Item, <<J as IntoIterator>::IntoIter as Iterator>::Item>>::T>>where - J: IntoIterator, - F: FnMut(&Self::Item, &<J as IntoIterator>::Item) -> T, - 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 - 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 +) -> MergeBy<Self, <J as IntoIterator>::IntoIter, MergeFuncLR<F, <F as FuncLR<Self::Item, <<J as IntoIterator>::IntoIter as Iterator>::Item>>::T>>where + J: IntoIterator, + F: FnMut(&Self::Item, &<J as IntoIterator>::Item) -> T, + 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 + Self: Sized, + Self::Item: IntoIterator, + <Self::Item as IntoIterator>::Item: PartialOrd,

Return an iterator adaptor that flattens an iterator of iterators by 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 +) -> 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>( self, other: J -) -> Product<Self, <J as IntoIterator>::IntoIter>where - Self: Sized, - Self::Item: Clone, - J: IntoIterator, - <J as IntoIterator>::IntoIter: Clone,

Return an iterator adaptor that iterates over the cartesian product of +) -> Product<Self, <J as IntoIterator>::IntoIter>where + Self: Sized, + Self::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( 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 - 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 - Self: Sized, - Self::Item: PartialEq<Self::Item>,

Remove duplicates from sections of consecutive identical elements. +) -> 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 + 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 + Self: Sized, + Self::Item: PartialEq,

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>( 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, +) -> 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( self -) -> CoalesceBy<Self, DedupPredWithCount2CoalescePred<DedupEq>, (usize, Self::Item)>where - Self: Sized,

Remove duplicates from sections of consecutive identical elements, while keeping a count of +) -> 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>( self, cmp: Cmp -) -> CoalesceBy<Self, DedupPredWithCount2CoalescePred<Cmp>, (usize, Self::Item)>where - Self: Sized, - Cmp: FnMut(&Self::Item, &Self::Item) -> bool,

Remove duplicates from sections of consecutive identical elements, while keeping a count of +) -> CoalesceBy<Self, DedupPredWithCount2CoalescePred<Cmp>, (usize, Self::Item)>where + Self: Sized, + Cmp: 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 - Self: Sized, - Self::Item: Eq + Hash,

Return an iterator adaptor that produces elements that appear more than once during the +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 - Self: Sized, - V: Eq + Hash, - F: FnMut(&Self::Item) -> V,

Return an iterator adaptor that produces elements that appear more than once during the + 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 - Self: Sized, - Self::Item: Clone + Eq + Hash,

Return an iterator adaptor that filters out elements that have + 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 - Self: Sized, - V: Eq + Hash, - F: FnMut(&Self::Item) -> V,

Return an iterator adaptor that filters out elements that have + 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 - Self: Sized + PeekingNext, - F: FnMut(&Self::Item) -> bool,

Return an iterator adaptor that borrows from this iterator and + 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 - Self: Clone, - F: FnMut(&Self::Item) -> bool,

Return an iterator adaptor that borrows from a Clone-able iterator + 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 take_while_inclusive<F>(self, accept: F) -> TakeWhileInclusive<Self, F>where - Self: Sized, - F: FnMut(&Self::Item) -> bool,

Returns an iterator adaptor that consumes elements while the given + 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 + 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 - Self: Sized + Clone, - Self::Item: Clone, + 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 - Self: Sized, - Self::Item: Clone,

Return an iterator adaptor that iterates over the k-length combinations of +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( self, - k: usize + 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 - Self: Sized, - Self::Item: Clone,

Return an iterator adaptor that iterates over all k-permutations of the + 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 + 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 - 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 - Self: Sized, - F: FnMut(usize) -> Self::Item,

Return an iterator adaptor that pads the sequence to a minimum length of + 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 + 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 combines each element with a Position to + 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 + 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 - 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 - Self: Sized + Iterator<Item = <T as TupleCollect>::Item>, + 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 + 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 - Self: Sized + Iterator<Item = <T as TupleCollect>::Item>, +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 - 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 - 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 - 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 - Self: Sized, - Self::Item: PartialEq<Self::Item>,

Check whether all elements compare equal. Read more
source§

fn all_equal_value( +(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 + 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 + Self: Sized, + Self::Item: Borrow<Q>, + Q: PartialEq,

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,

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: PartialEq<Self::Item>,

If there are elements and they are all equal, return a single copy of that element. +) -> Result<Self::Item, Option<(Self::Item, Self::Item)>>where + Self: Sized, + Self::Item: PartialEq,
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 - Self: Sized + DoubleEndedIterator,

Consume the last n elements from the iterator eagerly, +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 + 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 - 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, - 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 - 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 + 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, + 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>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 + 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 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 - 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 - Self: Iterator<Item = Result<A, E>>, - F: FnMut(B, A) -> B,

👎Deprecated since 0.10.0: Use .fold_ok() instead
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 - 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(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 - 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, - 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 - 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 - 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: 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 - 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 - 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: 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 - 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 - 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 - 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: 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 - 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 - 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>( - 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 + 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 + 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 + Self: Iterator<Item = Result<A, E>>, + F: FnMut(B, A) -> B,

👎Deprecated since 0.10.0: Use .fold_ok() instead
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 + 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(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 + 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, + 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 + 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>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>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>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>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>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>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>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>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: 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 + 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>>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>(self, f: F) -> HashMap<K, Vec<V>>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 - Self: Iterator<Item = (K, V)> + Sized, - K: Hash + Eq,

Constructs a GroupingMap to be used later with one of the efficient + 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>( 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 - 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: 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 - 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 - 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: 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 - Self: Sized, - K: Ord, - 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: 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 - 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 - 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: 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 - 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 - 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: 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 - 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 - 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 - 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 - 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 - Self: Sized,

If the iterator yields exactly one element, that element will be returned, otherwise + 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>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>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>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>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>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>where + Self: Sized, + K: Ord, + 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,

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, + 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 + 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 + 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: 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 + 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 + 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: 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 + 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 + Self: Sized, + Self::Item: PartialOrd,

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 + Self: Sized, + K: PartialOrd, + 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 + 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 + 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 - Self: Sized,

If the iterator yields no elements, Ok(None) will be returned. If the iterator yields +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 - 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 - Self: Sized, - Self::Item: Eq + Hash,

Collect the items in this iterator and return a HashMap which + 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>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 - Self: Sized, - K: Eq + Hash, - F: FnMut(Self::Item) -> K,

Collect the items in this iterator and return a HashMap which +of times it appears. Read more
source§

fn counts_by<K, F>(self, f: F) -> HashMap<K, usize>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 - Self: Sized + MultiUnzip<FromI>,

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

fn try_len(&self) -> Result<usize, (usize, Option<usize>)>

Returns the length of the iterator if one exists. -Otherwise return self.size_hint(). Read more
source§

impl<T, U> TryFrom<U> for Twhere - U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
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.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
\ No newline at end of file + Self: Sized + MultiUnzip<FromI>,
Converts an iterator of tuples into a tuple of containers. Read more
source§

fn try_len(&self) -> Result<usize, (usize, Option<usize>)>

Returns the length of the iterator if one exists. +Otherwise return self.size_hint(). Read more
source§

impl<T, U> TryFrom<U> for Twhere + U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
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.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
\ No newline at end of file diff --git a/rust/sudachi/dic/lexicon/word_id_table/struct.WordIdTable.html b/rust/sudachi/dic/lexicon/word_id_table/struct.WordIdTable.html index 7210ba21..008eb7f2 100644 --- a/rust/sudachi/dic/lexicon/word_id_table/struct.WordIdTable.html +++ b/rust/sudachi/dic/lexicon/word_id_table/struct.WordIdTable.html @@ -1,11 +1,11 @@ -WordIdTable in sudachi::dic::lexicon::word_id_table - Rust
pub struct WordIdTable<'a> { /* private fields */ }

Implementations§

source§

impl<'a> WordIdTable<'a>

source

pub fn new(bytes: &'a [u8], size: u32, offset: usize) -> WordIdTable<'_>

source

pub fn storage_size(&self) -> usize

source

pub fn entries(&self, index: usize) -> WordIdIter

Auto Trait Implementations§

§

impl<'a> RefUnwindSafe for WordIdTable<'a>

§

impl<'a> Send for WordIdTable<'a>

§

impl<'a> Sync for WordIdTable<'a>

§

impl<'a> Unpin for WordIdTable<'a>

§

impl<'a> UnwindSafe for WordIdTable<'a>

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,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

source§

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

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

-
source§

impl<T, U> Into<U> for Twhere - U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

+WordIdTable in sudachi::dic::lexicon::word_id_table - Rust
pub struct WordIdTable<'a> { /* private fields */ }

Implementations§

source§

impl<'a> WordIdTable<'a>

source

pub fn new(bytes: &'a [u8], size: u32, offset: usize) -> WordIdTable<'_>

source

pub fn storage_size(&self) -> usize

source

pub fn entries(&self, index: usize) -> WordIdIter

Auto Trait Implementations§

§

impl<'a> RefUnwindSafe for WordIdTable<'a>

§

impl<'a> Send for WordIdTable<'a>

§

impl<'a> Sync for WordIdTable<'a>

§

impl<'a> Unpin for WordIdTable<'a>

§

impl<'a> UnwindSafe for WordIdTable<'a>

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,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

source§

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

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

+
source§

impl<T, U> Into<U> for Twhere + U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of -From<T> for U chooses to do.

-
source§

impl<T, U> TryFrom<U> for Twhere - U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
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.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
\ No newline at end of file +From<T> for U chooses to do.

+
source§

impl<T, U> TryFrom<U> for Twhere + U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
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.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
\ No newline at end of file diff --git a/rust/sudachi/dic/lexicon/word_infos/index.html b/rust/sudachi/dic/lexicon/word_infos/index.html index f481b2c3..a106ccab 100644 --- a/rust/sudachi/dic/lexicon/word_infos/index.html +++ b/rust/sudachi/dic/lexicon/word_infos/index.html @@ -1,3 +1,3 @@ -sudachi::dic::lexicon::word_infos - Rust

Module sudachi::dic::lexicon::word_infos

source ·

Structs

\ No newline at end of file diff --git a/rust/sudachi/dic/lexicon/word_infos/struct.WordInfoData.html b/rust/sudachi/dic/lexicon/word_infos/struct.WordInfoData.html index 9a23898c..10ed2d6d 100644 --- a/rust/sudachi/dic/lexicon/word_infos/struct.WordInfoData.html +++ b/rust/sudachi/dic/lexicon/word_infos/struct.WordInfoData.html @@ -1,28 +1,28 @@ -WordInfoData in sudachi::dic::lexicon::word_infos - Rust
pub struct WordInfoData {
-    pub surface: String,
-    pub head_word_length: u16,
-    pub pos_id: u16,
-    pub normalized_form: String,
-    pub dictionary_form_word_id: i32,
-    pub dictionary_form: String,
-    pub reading_form: String,
-    pub a_unit_split: Vec<WordId>,
-    pub b_unit_split: Vec<WordId>,
-    pub word_structure: Vec<WordId>,
-    pub synonym_group_ids: Vec<u32>,
+WordInfoData in sudachi::dic::lexicon::word_infos - Rust
pub struct WordInfoData {
+    pub surface: String,
+    pub head_word_length: u16,
+    pub pos_id: u16,
+    pub normalized_form: String,
+    pub dictionary_form_word_id: i32,
+    pub dictionary_form: String,
+    pub reading_form: String,
+    pub a_unit_split: Vec<WordId>,
+    pub b_unit_split: Vec<WordId>,
+    pub word_structure: Vec<WordId>,
+    pub synonym_group_ids: Vec<u32>,
 }
Expand description

Internal storage of the WordInfo. It is not accessible by default, but a WordInfo can be created from it: let wi: WordInfo = data.into();

String fields CAN be empty, in this case the value of the surface field should be used instead

-

Fields§

§surface: String§head_word_length: u16§pos_id: u16§normalized_form: String§dictionary_form_word_id: i32§dictionary_form: String§reading_form: String§a_unit_split: Vec<WordId>§b_unit_split: Vec<WordId>§word_structure: Vec<WordId>§synonym_group_ids: Vec<u32>

Trait Implementations§

source§

impl Clone for WordInfoData

source§

fn clone(&self) -> WordInfoData

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 WordInfoData

source§

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

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

impl Default for WordInfoData

source§

fn default() -> WordInfoData

Returns the “default value” for a type. Read more
source§

impl From<WordInfo> for WordInfoData

source§

fn from(info: WordInfo) -> Self

Converts to this type from the input type.
source§

impl From<WordInfoData> for WordInfo

source§

fn from(data: WordInfoData) -> 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,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

source§

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

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

-
source§

impl<T, U> Into<U> for Twhere - U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

+

Fields§

§surface: String§head_word_length: u16§pos_id: u16§normalized_form: String§dictionary_form_word_id: i32§dictionary_form: String§reading_form: String§a_unit_split: Vec<WordId>§b_unit_split: Vec<WordId>§word_structure: Vec<WordId>§synonym_group_ids: Vec<u32>

Trait Implementations§

source§

impl Clone for WordInfoData

source§

fn clone(&self) -> WordInfoData

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 WordInfoData

source§

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

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

impl Default for WordInfoData

source§

fn default() -> WordInfoData

Returns the “default value” for a type. Read more
source§

impl From<WordInfo> for WordInfoData

source§

fn from(info: WordInfo) -> Self

Converts to this type from the input type.
source§

impl From<WordInfoData> for WordInfo

source§

fn from(data: WordInfoData) -> 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,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

source§

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

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

+
source§

impl<T, U> Into<U> for Twhere + U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of -From<T> for U chooses to do.

-
source§

impl<T> ToOwned for Twhere - T: Clone,

§

type Owned = T

The resulting type after obtaining ownership.
source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
source§

impl<T, U> TryFrom<U> for Twhere - U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
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.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
\ No newline at end of file +From<T> for U chooses to do.

+
source§

impl<T> ToOwned for Twhere + T: Clone,

§

type Owned = T

The resulting type after obtaining ownership.
source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
source§

impl<T, U> TryFrom<U> for Twhere + U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
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.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
\ No newline at end of file diff --git a/rust/sudachi/dic/lexicon/word_infos/struct.WordInfos.html b/rust/sudachi/dic/lexicon/word_infos/struct.WordInfos.html index 41f46e56..249c6fe7 100644 --- a/rust/sudachi/dic/lexicon/word_infos/struct.WordInfos.html +++ b/rust/sudachi/dic/lexicon/word_infos/struct.WordInfos.html @@ -1,20 +1,20 @@ -WordInfos in sudachi::dic::lexicon::word_infos - Rust
pub struct WordInfos<'a> { /* private fields */ }

Implementations§

source§

impl<'a> WordInfos<'a>

source

pub fn new( - bytes: &'a [u8], - offset: usize, - _word_size: u32, - has_synonym_group_ids: bool +WordInfos in sudachi::dic::lexicon::word_infos - Rust
pub struct WordInfos<'a> { /* private fields */ }

Implementations§

source§

impl<'a> WordInfos<'a>

source

pub fn new( + bytes: &'a [u8], + offset: usize, + _word_size: u32, + has_synonym_group_ids: bool ) -> WordInfos<'_>

source

pub fn get_word_info( &self, - word_id: u32, + word_id: u32, subset: InfoSubset -) -> SudachiResult<WordInfo>

Auto Trait Implementations§

§

impl<'a> RefUnwindSafe for WordInfos<'a>

§

impl<'a> Send for WordInfos<'a>

§

impl<'a> Sync for WordInfos<'a>

§

impl<'a> Unpin for WordInfos<'a>

§

impl<'a> UnwindSafe for WordInfos<'a>

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,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

source§

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

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

-
source§

impl<T, U> Into<U> for Twhere - U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

+) -> SudachiResult<WordInfo>

Auto Trait Implementations§

§

impl<'a> RefUnwindSafe for WordInfos<'a>

§

impl<'a> Send for WordInfos<'a>

§

impl<'a> Sync for WordInfos<'a>

§

impl<'a> Unpin for WordInfos<'a>

§

impl<'a> UnwindSafe for WordInfos<'a>

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,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

source§

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

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

+
source§

impl<T, U> Into<U> for Twhere + U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of -From<T> for U chooses to do.

-
source§

impl<T, U> TryFrom<U> for Twhere - U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
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.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
\ No newline at end of file +From<T> for U chooses to do.

+
source§

impl<T, U> TryFrom<U> for Twhere + U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
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.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
\ No newline at end of file diff --git a/rust/sudachi/dic/lexicon/word_params/index.html b/rust/sudachi/dic/lexicon/word_params/index.html index 1d380217..12b266a4 100644 --- a/rust/sudachi/dic/lexicon/word_params/index.html +++ b/rust/sudachi/dic/lexicon/word_params/index.html @@ -1 +1 @@ -sudachi::dic::lexicon::word_params - Rust
\ No newline at end of file +sudachi::dic::lexicon::word_params - Rust
\ No newline at end of file diff --git a/rust/sudachi/dic/lexicon/word_params/struct.WordParams.html b/rust/sudachi/dic/lexicon/word_params/struct.WordParams.html index 064cad2a..edddf857 100644 --- a/rust/sudachi/dic/lexicon/word_params/struct.WordParams.html +++ b/rust/sudachi/dic/lexicon/word_params/struct.WordParams.html @@ -1,11 +1,11 @@ -WordParams in sudachi::dic::lexicon::word_params - Rust
pub struct WordParams<'a> { /* private fields */ }

Implementations§

source§

impl<'a> WordParams<'a>

source

pub fn new(bytes: &'a [u8], size: u32, offset: usize) -> WordParams<'_>

source

pub fn storage_size(&self) -> usize

source

pub fn size(&self) -> u32

source

pub fn get_params(&self, word_id: u32) -> (i16, i16, i16)

source

pub fn get_cost(&self, word_id: u32) -> i16

source

pub fn set_cost(&mut self, word_id: u32, cost: i16)

Auto Trait Implementations§

§

impl<'a> RefUnwindSafe for WordParams<'a>

§

impl<'a> Send for WordParams<'a>

§

impl<'a> Sync for WordParams<'a>

§

impl<'a> Unpin for WordParams<'a>

§

impl<'a> UnwindSafe for WordParams<'a>

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,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

source§

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

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

-
source§

impl<T, U> Into<U> for Twhere - U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

+WordParams in sudachi::dic::lexicon::word_params - Rust
pub struct WordParams<'a> { /* private fields */ }

Implementations§

source§

impl<'a> WordParams<'a>

source

pub fn new(bytes: &'a [u8], size: u32, offset: usize) -> WordParams<'_>

source

pub fn storage_size(&self) -> usize

source

pub fn size(&self) -> u32

source

pub fn get_params(&self, word_id: u32) -> (i16, i16, i16)

source

pub fn get_cost(&self, word_id: u32) -> i16

source

pub fn set_cost(&mut self, word_id: u32, cost: i16)

Auto Trait Implementations§

§

impl<'a> RefUnwindSafe for WordParams<'a>

§

impl<'a> Send for WordParams<'a>

§

impl<'a> Sync for WordParams<'a>

§

impl<'a> Unpin for WordParams<'a>

§

impl<'a> UnwindSafe for WordParams<'a>

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,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

source§

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

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

+
source§

impl<T, U> Into<U> for Twhere + U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of -From<T> for U chooses to do.

-
source§

impl<T, U> TryFrom<U> for Twhere - U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
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.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
\ No newline at end of file +From<T> for U chooses to do.

+
source§

impl<T, U> TryFrom<U> for Twhere + U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
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.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
\ No newline at end of file diff --git a/rust/sudachi/dic/lexicon_set/enum.LexiconSetError.html b/rust/sudachi/dic/lexicon_set/enum.LexiconSetError.html index d7247a4b..1bf66e33 100644 --- a/rust/sudachi/dic/lexicon_set/enum.LexiconSetError.html +++ b/rust/sudachi/dic/lexicon_set/enum.LexiconSetError.html @@ -1,23 +1,23 @@ -LexiconSetError in sudachi::dic::lexicon_set - Rust
pub enum LexiconSetError {
-    TooLargeWordId(u32, usize),
-    TooLargeDictionaryId(usize),
+LexiconSetError in sudachi::dic::lexicon_set - Rust
pub enum LexiconSetError {
+    TooLargeWordId(u32, usize),
+    TooLargeDictionaryId(usize),
     TooManyDictionaries,
 }
Expand description

Sudachi error

-

Variants§

§

TooLargeWordId(u32, usize)

§

TooLargeDictionaryId(usize)

§

TooManyDictionaries

Trait Implementations§

source§

impl Debug for LexiconSetError

source§

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

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

impl Display for LexiconSetError

source§

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

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

impl Error for LexiconSetError

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()
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, request: &mut Request<'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<LexiconSetError> for SudachiError

source§

fn from(source: LexiconSetError) -> Self

Converts to this type from the input type.
source§

impl PartialEq<LexiconSetError> for LexiconSetError

source§

fn eq(&self, other: &LexiconSetError) -> 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 LexiconSetError

source§

impl StructuralEq for LexiconSetError

source§

impl StructuralPartialEq for LexiconSetError

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,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

source§

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

Mutably borrows from an owned value. Read more
§

impl<Q, K> Equivalent<K> for Qwhere - Q: Eq + ?Sized, - K: Borrow<Q> + ?Sized,

§

fn equivalent(&self, key: &K) -> bool

Checks if this value is equivalent to the given key. Read more
§

impl<Q, K> Equivalent<K> for Qwhere - Q: Eq + ?Sized, - K: Borrow<Q> + ?Sized,

§

fn equivalent(&self, key: &K) -> bool

Compare self to key and return true if they are equal.
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

-
source§

impl<T, U> Into<U> for Twhere - U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

+

Variants§

§

TooLargeWordId(u32, usize)

§

TooLargeDictionaryId(usize)

§

TooManyDictionaries

Trait Implementations§

source§

impl Debug for LexiconSetError

source§

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

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

impl Display for LexiconSetError

source§

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

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

impl Error for LexiconSetError

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()
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, request: &mut Request<'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<LexiconSetError> for SudachiError

source§

fn from(source: LexiconSetError) -> Self

Converts to this type from the input type.
source§

impl PartialEq for LexiconSetError

source§

fn eq(&self, other: &LexiconSetError) -> 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 LexiconSetError

source§

impl StructuralEq for LexiconSetError

source§

impl StructuralPartialEq for LexiconSetError

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,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

source§

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

Mutably borrows from an owned value. Read more
§

impl<Q, K> Equivalent<K> for Qwhere + Q: Eq + ?Sized, + K: Borrow<Q> + ?Sized,

§

fn equivalent(&self, key: &K) -> bool

Checks if this value is equivalent to the given key. Read more
§

impl<Q, K> Equivalent<K> for Qwhere + Q: Eq + ?Sized, + K: Borrow<Q> + ?Sized,

§

fn equivalent(&self, key: &K) -> bool

Compare self to key and return true if they are equal.
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

+
source§

impl<T, U> Into<U> for Twhere + U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of -From<T> for U chooses to do.

-
source§

impl<T> ToString for Twhere - T: Display + ?Sized,

source§

default fn to_string(&self) -> String

Converts the given value to a String. Read more
source§

impl<T, U> TryFrom<U> for Twhere - U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
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.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
\ No newline at end of file +From<T> for U chooses to do.

+
source§

impl<T> ToString for Twhere + T: Display + ?Sized,

source§

default fn to_string(&self) -> String

Converts the given value to a String. Read more
source§

impl<T, U> TryFrom<U> for Twhere + U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
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.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
\ No newline at end of file diff --git a/rust/sudachi/dic/lexicon_set/index.html b/rust/sudachi/dic/lexicon_set/index.html index be4a650f..ccacb442 100644 --- a/rust/sudachi/dic/lexicon_set/index.html +++ b/rust/sudachi/dic/lexicon_set/index.html @@ -1 +1 @@ -sudachi::dic::lexicon_set - Rust

Module sudachi::dic::lexicon_set

source ·

Structs

Enums

\ No newline at end of file +sudachi::dic::lexicon_set - Rust

Module sudachi::dic::lexicon_set

source ·

Structs

Enums

\ No newline at end of file diff --git a/rust/sudachi/dic/lexicon_set/struct.LexiconSet.html b/rust/sudachi/dic/lexicon_set/struct.LexiconSet.html index 2498a5df..81353ba1 100644 --- a/rust/sudachi/dic/lexicon_set/struct.LexiconSet.html +++ b/rust/sudachi/dic/lexicon_set/struct.LexiconSet.html @@ -1,20 +1,20 @@ -LexiconSet in sudachi::dic::lexicon_set - Rust
pub struct LexiconSet<'a> { /* private fields */ }
Expand description

Set of Lexicons

+LexiconSet in sudachi::dic::lexicon_set - Rust
pub struct LexiconSet<'a> { /* private fields */ }
Expand description

Set of Lexicons

Handles multiple lexicons as one lexicon The first lexicon in the list must be from system dictionary

-

Implementations§

source§

impl<'a> LexiconSet<'a>

source

pub fn new(system_lexicon: Lexicon<'_>, num_system_pos: usize) -> LexiconSet<'_>

Creates a LexiconSet given a lexicon

+

Implementations§

source§

impl<'a> LexiconSet<'a>

source

pub fn new(system_lexicon: Lexicon<'_>, num_system_pos: usize) -> LexiconSet<'_>

Creates a LexiconSet given a lexicon

It is assumed that the passed lexicon is the system dictionary

source

pub fn append( &mut self, lexicon: Lexicon<'a>, - pos_offset: usize -) -> Result<(), LexiconSetError>

Add a lexicon to the lexicon list

+ pos_offset: usize +) -> Result<(), LexiconSetError>

Add a lexicon to the lexicon list

pos_offset: number of pos in the grammar

-
source

pub fn is_full(&self) -> bool

Returns if dictionary capacity is full

+
source

pub fn is_full(&self) -> bool

Returns if dictionary capacity is full

source§

impl LexiconSet<'_>

source

pub fn lookup<'b>( &'b self, - input: &'b [u8], - offset: usize -) -> impl Iterator<Item = LexiconEntry> + 'b

Returns iterator which yields all words in the dictionary, starting from the offset bytes

+ input: &'b [u8], + offset: usize +) -> impl Iterator<Item = LexiconEntry> + 'b

Returns iterator which yields all words in the dictionary, starting from the offset bytes

Searches dictionaries in the reverse order: user dictionaries first and then system dictionary

source

pub fn get_word_info(&self, id: WordId) -> SudachiResult<WordInfo>

Returns WordInfo for given WordId

source

pub fn get_word_info_subset( @@ -24,15 +24,15 @@ ) -> SudachiResult<WordInfo>

Returns WordInfo for given WordId. Only fills a requested subset of fields. Rest will be of default values (0 or empty).

-
source

pub fn get_word_param(&self, id: WordId) -> (i16, i16, i16)

Returns word_param for given word_id

-
source

pub fn size(&self) -> u32

Auto Trait Implementations§

§

impl<'a> RefUnwindSafe for LexiconSet<'a>

§

impl<'a> Send for LexiconSet<'a>

§

impl<'a> Sync for LexiconSet<'a>

§

impl<'a> Unpin for LexiconSet<'a>

§

impl<'a> UnwindSafe for LexiconSet<'a>

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,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

source§

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

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

-
source§

impl<T, U> Into<U> for Twhere - U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

+
source

pub fn get_word_param(&self, id: WordId) -> (i16, i16, i16)

Returns word_param for given word_id

+
source

pub fn size(&self) -> u32

Auto Trait Implementations§

§

impl<'a> RefUnwindSafe for LexiconSet<'a>

§

impl<'a> Send for LexiconSet<'a>

§

impl<'a> Sync for LexiconSet<'a>

§

impl<'a> Unpin for LexiconSet<'a>

§

impl<'a> UnwindSafe for LexiconSet<'a>

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,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

source§

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

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

+
source§

impl<T, U> Into<U> for Twhere + U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of -From<T> for U chooses to do.

-
source§

impl<T, U> TryFrom<U> for Twhere - U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
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.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
\ No newline at end of file +From<T> for U chooses to do.

+
source§

impl<T, U> TryFrom<U> for Twhere + U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
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.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
\ No newline at end of file diff --git a/rust/sudachi/dic/read/fn.skip_u32_array.html b/rust/sudachi/dic/read/fn.skip_u32_array.html index 71e28522..8cbd5898 100644 --- a/rust/sudachi/dic/read/fn.skip_u32_array.html +++ b/rust/sudachi/dic/read/fn.skip_u32_array.html @@ -1 +1 @@ -skip_u32_array in sudachi::dic::read - Rust

Function sudachi::dic::read::skip_u32_array

source ·
pub fn skip_u32_array(input: &[u8]) -> SudachiNomResult<&[u8], Vec<u32>>
\ No newline at end of file +skip_u32_array in sudachi::dic::read - Rust

Function sudachi::dic::read::skip_u32_array

source ·
pub fn skip_u32_array(input: &[u8]) -> SudachiNomResult<&[u8], Vec<u32>>
\ No newline at end of file diff --git a/rust/sudachi/dic/read/fn.skip_wid_array.html b/rust/sudachi/dic/read/fn.skip_wid_array.html index a7c31fe3..fba4fe41 100644 --- a/rust/sudachi/dic/read/fn.skip_wid_array.html +++ b/rust/sudachi/dic/read/fn.skip_wid_array.html @@ -1 +1 @@ -skip_wid_array in sudachi::dic::read - Rust

Function sudachi::dic::read::skip_wid_array

source ·
pub fn skip_wid_array(input: &[u8]) -> SudachiNomResult<&[u8], Vec<WordId>>
\ No newline at end of file +skip_wid_array in sudachi::dic::read - Rust

Function sudachi::dic::read::skip_wid_array

source ·
pub fn skip_wid_array(input: &[u8]) -> SudachiNomResult<&[u8], Vec<WordId>>
\ No newline at end of file diff --git a/rust/sudachi/dic/read/fn.u32_array_parser.html b/rust/sudachi/dic/read/fn.u32_array_parser.html index 5ff88909..7ea06399 100644 --- a/rust/sudachi/dic/read/fn.u32_array_parser.html +++ b/rust/sudachi/dic/read/fn.u32_array_parser.html @@ -1 +1 @@ -u32_array_parser in sudachi::dic::read - Rust

Function sudachi::dic::read::u32_array_parser

source ·
pub fn u32_array_parser(input: &[u8]) -> SudachiNomResult<&[u8], Vec<u32>>
\ No newline at end of file +u32_array_parser in sudachi::dic::read - Rust

Function sudachi::dic::read::u32_array_parser

source ·
pub fn u32_array_parser(input: &[u8]) -> SudachiNomResult<&[u8], Vec<u32>>
\ No newline at end of file diff --git a/rust/sudachi/dic/read/fn.u32_parser.html b/rust/sudachi/dic/read/fn.u32_parser.html index 64ce916f..32879306 100644 --- a/rust/sudachi/dic/read/fn.u32_parser.html +++ b/rust/sudachi/dic/read/fn.u32_parser.html @@ -1 +1 @@ -u32_parser in sudachi::dic::read - Rust

Function sudachi::dic::read::u32_parser

source ·
pub fn u32_parser(input: &[u8]) -> SudachiNomResult<&[u8], u32>
\ No newline at end of file +u32_parser in sudachi::dic::read - Rust

Function sudachi::dic::read::u32_parser

source ·
pub fn u32_parser(input: &[u8]) -> SudachiNomResult<&[u8], u32>
\ No newline at end of file diff --git a/rust/sudachi/dic/read/fn.u32_wid_array_parser.html b/rust/sudachi/dic/read/fn.u32_wid_array_parser.html index bfbfa6e4..d978c3c9 100644 --- a/rust/sudachi/dic/read/fn.u32_wid_array_parser.html +++ b/rust/sudachi/dic/read/fn.u32_wid_array_parser.html @@ -1,3 +1,3 @@ -u32_wid_array_parser in sudachi::dic::read - Rust
pub fn u32_wid_array_parser(
-    input: &[u8]
-) -> SudachiNomResult<&[u8], Vec<WordId>>
\ No newline at end of file +u32_wid_array_parser in sudachi::dic::read - Rust
pub fn u32_wid_array_parser(
+    input: &[u8]
+) -> SudachiNomResult<&[u8], Vec<WordId>>
\ No newline at end of file diff --git a/rust/sudachi/dic/read/index.html b/rust/sudachi/dic/read/index.html index b5a9a9a1..1c02b2ef 100644 --- a/rust/sudachi/dic/read/index.html +++ b/rust/sudachi/dic/read/index.html @@ -1 +1 @@ -sudachi::dic::read - Rust
\ No newline at end of file +sudachi::dic::read - Rust
\ No newline at end of file diff --git a/rust/sudachi/dic/storage/enum.Storage.html b/rust/sudachi/dic/storage/enum.Storage.html index 926de40e..2c3d33f4 100644 --- a/rust/sudachi/dic/storage/enum.Storage.html +++ b/rust/sudachi/dic/storage/enum.Storage.html @@ -1,15 +1,15 @@ -Storage in sudachi::dic::storage - Rust

Enum sudachi::dic::storage::Storage

source ·
pub enum Storage {
+Storage in sudachi::dic::storage - Rust

Enum sudachi::dic::storage::Storage

source ·
pub enum Storage {
     File(Mmap),
-    Borrowed(&'static [u8]),
-    Owned(Vec<u8>),
-}

Variants§

§

File(Mmap)

§

Borrowed(&'static [u8])

§

Owned(Vec<u8>)

Trait Implementations§

source§

impl AsRef<[u8]> for Storage

source§

fn as_ref(&self) -> &[u8]

Converts this type into a shared reference of the (usually inferred) 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,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

source§

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

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

-
source§

impl<T, U> Into<U> for Twhere - U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

+ Borrowed(&'static [u8]), + Owned(Vec<u8>), +}

Variants§

§

File(Mmap)

§

Borrowed(&'static [u8])

§

Owned(Vec<u8>)

Trait Implementations§

source§

impl AsRef<[u8]> for Storage

source§

fn as_ref(&self) -> &[u8]

Converts this type into a shared reference of the (usually inferred) 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,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

source§

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

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

+
source§

impl<T, U> Into<U> for Twhere + U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of -From<T> for U chooses to do.

-
source§

impl<T, U> TryFrom<U> for Twhere - U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
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.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
\ No newline at end of file +From<T> for U chooses to do.

+
source§

impl<T, U> TryFrom<U> for Twhere + U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
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.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
\ No newline at end of file diff --git a/rust/sudachi/dic/storage/index.html b/rust/sudachi/dic/storage/index.html index 1dba2620..34c702a9 100644 --- a/rust/sudachi/dic/storage/index.html +++ b/rust/sudachi/dic/storage/index.html @@ -1 +1 @@ -sudachi::dic::storage - Rust
\ No newline at end of file +sudachi::dic::storage - Rust
\ No newline at end of file diff --git a/rust/sudachi/dic/storage/struct.SudachiDicData.html b/rust/sudachi/dic/storage/struct.SudachiDicData.html index 7749796c..8b15e787 100644 --- a/rust/sudachi/dic/storage/struct.SudachiDicData.html +++ b/rust/sudachi/dic/storage/struct.SudachiDicData.html @@ -1,11 +1,11 @@ -SudachiDicData in sudachi::dic::storage - Rust
pub struct SudachiDicData { /* private fields */ }

Implementations§

source§

impl SudachiDicData

source

pub fn new(system: Storage) -> Self

source

pub fn add_user(&mut self, user: Storage)

source

pub fn system(&self) -> &[u8]

source

pub unsafe fn system_static_slice(&self) -> &'static [u8]

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,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

source§

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

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

-
source§

impl<T, U> Into<U> for Twhere - U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

+SudachiDicData in sudachi::dic::storage - Rust
pub struct SudachiDicData { /* private fields */ }

Implementations§

source§

impl SudachiDicData

source

pub fn new(system: Storage) -> Self

source

pub fn add_user(&mut self, user: Storage)

source

pub fn system(&self) -> &[u8]

source

pub unsafe fn system_static_slice(&self) -> &'static [u8]

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,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

source§

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

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

+
source§

impl<T, U> Into<U> for Twhere + U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of -From<T> for U chooses to do.

-
source§

impl<T, U> TryFrom<U> for Twhere - U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
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.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
\ No newline at end of file +From<T> for U chooses to do.

+
source§

impl<T, U> TryFrom<U> for Twhere + U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
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.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
\ No newline at end of file diff --git a/rust/sudachi/dic/struct.DictionaryLoader.html b/rust/sudachi/dic/struct.DictionaryLoader.html index 25319942..77906b6b 100644 --- a/rust/sudachi/dic/struct.DictionaryLoader.html +++ b/rust/sudachi/dic/struct.DictionaryLoader.html @@ -1,28 +1,28 @@ -DictionaryLoader in sudachi::dic - Rust
pub struct DictionaryLoader<'a> {
+DictionaryLoader in sudachi::dic - Rust
pub struct DictionaryLoader<'a> {
     pub header: Header,
-    pub grammar: Option<Grammar<'a>>,
+    pub grammar: Option<Grammar<'a>>,
     pub lexicon: Lexicon<'a>,
 }
Expand description

A single system or user dictionary

-

Fields§

§header: Header§grammar: Option<Grammar<'a>>§lexicon: Lexicon<'a>

Implementations§

source§

impl<'a> DictionaryLoader<'a>

source

pub unsafe fn read_any_dictionary( - dictionary_bytes: &[u8] +

Fields§

§header: Header§grammar: Option<Grammar<'a>>§lexicon: Lexicon<'a>

Implementations§

source§

impl<'a> DictionaryLoader<'a>

source

pub unsafe fn read_any_dictionary( + dictionary_bytes: &[u8] ) -> SudachiResult<DictionaryLoader<'_>>

Creates a binary dictionary from bytes

This function is marked unsafe because it does not perform header validation

source

pub fn read_system_dictionary( - dictionary_bytes: &[u8] + dictionary_bytes: &[u8] ) -> SudachiResult<DictionaryLoader<'_>>

Creates a system binary dictionary from bytes

Returns Err if header version is not match

source

pub fn read_user_dictionary( - dictionary_bytes: &[u8] + dictionary_bytes: &[u8] ) -> SudachiResult<DictionaryLoader<'_>>

Creates a user binary dictionary from bytes

Returns Err if header version is not match

-
source

pub fn to_loaded(self) -> Option<LoadedDictionary<'a>>

Auto Trait Implementations§

§

impl<'a> RefUnwindSafe for DictionaryLoader<'a>

§

impl<'a> Send for DictionaryLoader<'a>

§

impl<'a> Sync for DictionaryLoader<'a>

§

impl<'a> Unpin for DictionaryLoader<'a>

§

impl<'a> UnwindSafe for DictionaryLoader<'a>

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,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

source§

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

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

-
source§

impl<T, U> Into<U> for Twhere - U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

+
source

pub fn to_loaded(self) -> Option<LoadedDictionary<'a>>

Auto Trait Implementations§

§

impl<'a> RefUnwindSafe for DictionaryLoader<'a>

§

impl<'a> Send for DictionaryLoader<'a>

§

impl<'a> Sync for DictionaryLoader<'a>

§

impl<'a> Unpin for DictionaryLoader<'a>

§

impl<'a> UnwindSafe for DictionaryLoader<'a>

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,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

source§

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

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

+
source§

impl<T, U> Into<U> for Twhere + U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of -From<T> for U chooses to do.

-
source§

impl<T, U> TryFrom<U> for Twhere - U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
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.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
\ No newline at end of file +From<T> for U chooses to do.

+
source§

impl<T, U> TryFrom<U> for Twhere + U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
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.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
\ No newline at end of file diff --git a/rust/sudachi/dic/struct.LoadedDictionary.html b/rust/sudachi/dic/struct.LoadedDictionary.html index c796abe3..2be2f5ab 100644 --- a/rust/sudachi/dic/struct.LoadedDictionary.html +++ b/rust/sudachi/dic/struct.LoadedDictionary.html @@ -1,19 +1,19 @@ -LoadedDictionary in sudachi::dic - Rust
pub struct LoadedDictionary<'a> {
+LoadedDictionary in sudachi::dic - Rust
pub struct LoadedDictionary<'a> {
     pub grammar: Grammar<'a>,
     pub lexicon_set: LexiconSet<'a>,
 }
Expand description

A dictionary consists of one system_dict and zero or more user_dicts

Fields§

§grammar: Grammar<'a>§lexicon_set: LexiconSet<'a>

Implementations§

source§

impl<'a> LoadedDictionary<'a>

source

pub fn from_system_dictionary( - dictionary_bytes: &'a [u8], - character_category_file: &Path + dictionary_bytes: &'a [u8], + character_category_file: &Path ) -> SudachiResult<LoadedDictionary<'a>>

Creates a system dictionary from bytes, and load a character category from file

-

Trait Implementations§

Auto Trait Implementations§

§

impl<'a> RefUnwindSafe for LoadedDictionary<'a>

§

impl<'a> Send for LoadedDictionary<'a>

§

impl<'a> Sync for LoadedDictionary<'a>

§

impl<'a> Unpin for LoadedDictionary<'a>

§

impl<'a> UnwindSafe for LoadedDictionary<'a>

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,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

source§

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

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

-
source§

impl<T, U> Into<U> for Twhere - U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

+

Trait Implementations§

Auto Trait Implementations§

§

impl<'a> RefUnwindSafe for LoadedDictionary<'a>

§

impl<'a> Send for LoadedDictionary<'a>

§

impl<'a> Sync for LoadedDictionary<'a>

§

impl<'a> Unpin for LoadedDictionary<'a>

§

impl<'a> UnwindSafe for LoadedDictionary<'a>

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,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

source§

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

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

+
source§

impl<T, U> Into<U> for Twhere + U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of -From<T> for U chooses to do.

-
source§

impl<T, U> TryFrom<U> for Twhere - U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
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.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
\ No newline at end of file +From<T> for U chooses to do.

+
source§

impl<T, U> TryFrom<U> for Twhere + U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
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.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
\ No newline at end of file diff --git a/rust/sudachi/dic/subset/index.html b/rust/sudachi/dic/subset/index.html index 49656faa..cad34479 100644 --- a/rust/sudachi/dic/subset/index.html +++ b/rust/sudachi/dic/subset/index.html @@ -1 +1 @@ -sudachi::dic::subset - Rust
\ No newline at end of file +sudachi::dic::subset - Rust
\ No newline at end of file diff --git a/rust/sudachi/dic/subset/struct.InfoSubset.html b/rust/sudachi/dic/subset/struct.InfoSubset.html index abeb8aa9..4f8c7164 100644 --- a/rust/sudachi/dic/subset/struct.InfoSubset.html +++ b/rust/sudachi/dic/subset/struct.InfoSubset.html @@ -1,24 +1,24 @@ -InfoSubset in sudachi::dic::subset - Rust

Struct sudachi::dic::subset::InfoSubset

source ·
#[repr(transparent)]
pub struct InfoSubset(/* private fields */);

Implementations§

source§

impl InfoSubset

source

pub const SURFACE: Self = _

source

pub const HEAD_WORD_LENGTH: Self = _

source

pub const POS_ID: Self = _

source

pub const NORMALIZED_FORM: Self = _

source

pub const DIC_FORM_WORD_ID: Self = _

source

pub const READING_FORM: Self = _

source

pub const SPLIT_A: Self = _

source

pub const SPLIT_B: Self = _

source

pub const WORD_STRUCTURE: Self = _

source

pub const SYNONYM_GROUP_ID: Self = _

source§

impl InfoSubset

source

pub const fn empty() -> Self

Get a flags value with all bits unset.

+InfoSubset in sudachi::dic::subset - Rust

Struct sudachi::dic::subset::InfoSubset

source ·
pub struct InfoSubset(/* private fields */);

Implementations§

source§

impl InfoSubset

source

pub const SURFACE: Self = _

source

pub const HEAD_WORD_LENGTH: Self = _

source

pub const POS_ID: Self = _

source

pub const NORMALIZED_FORM: Self = _

source

pub const DIC_FORM_WORD_ID: Self = _

source

pub const READING_FORM: Self = _

source

pub const SPLIT_A: Self = _

source

pub const SPLIT_B: Self = _

source

pub const WORD_STRUCTURE: Self = _

source

pub const SYNONYM_GROUP_ID: Self = _

source§

impl InfoSubset

source

pub const fn empty() -> Self

Get a flags value with all bits unset.

source

pub const fn all() -> Self

Get a flags value with all known bits set.

-
source

pub const fn bits(&self) -> u32

Get the underlying bits value.

+
source

pub const fn bits(&self) -> u32

Get the underlying bits value.

The returned value is exactly the bits set in this flags value.

-
source

pub const fn from_bits(bits: u32) -> Option<Self>

Convert from a bits value.

+
source

pub const fn from_bits(bits: u32) -> Option<Self>

Convert from a bits value.

This method will return None if any unknown bits are set.

-
source

pub const fn from_bits_truncate(bits: u32) -> Self

Convert from a bits value, unsetting any unknown bits.

-
source

pub const fn from_bits_retain(bits: u32) -> Self

Convert from a bits value exactly.

-
source

pub fn from_name(name: &str) -> Option<Self>

Get a flags value with the bits of a flag with the given name set.

+
source

pub const fn from_bits_truncate(bits: u32) -> Self

Convert from a bits value, unsetting any unknown bits.

+
source

pub const fn from_bits_retain(bits: u32) -> Self

Convert from a bits value exactly.

+
source

pub fn from_name(name: &str) -> Option<Self>

Get a flags value with the bits of a flag with the given name set.

This method will return None if name is empty or doesn’t correspond to any named flag.

-
source

pub const fn is_empty(&self) -> bool

Whether all bits in this flags value are unset.

-
source

pub const fn is_all(&self) -> bool

Whether all known bits in this flags value are set.

-
source

pub const fn intersects(&self, other: Self) -> bool

Whether any set bits in a source flags value are also set in a target flags value.

-
source

pub const fn contains(&self, other: Self) -> bool

Whether all set bits in a source flags value are also set in a target flags value.

+
source

pub const fn is_empty(&self) -> bool

Whether all bits in this flags value are unset.

+
source

pub const fn is_all(&self) -> bool

Whether all known bits in this flags value are set.

+
source

pub const fn intersects(&self, other: Self) -> bool

Whether any set bits in a source flags value are also set in a target flags value.

+
source

pub const fn contains(&self, other: Self) -> bool

Whether all set bits in a source flags value are also set in a target flags value.

source

pub fn insert(&mut self, other: Self)

The bitwise or (|) of the bits in two flags values.

source

pub fn remove(&mut self, other: Self)

The intersection of a source flags value with the complement of a target flags value (&!).

This method is not equivalent to self & !other when other has unknown bits set. remove won’t truncate other, but the ! operator will.

source

pub fn toggle(&mut self, other: Self)

The bitwise exclusive-or (^) of the bits in two flags values.

-
source

pub fn set(&mut self, other: Self, value: bool)

Call insert when value is true or remove when value is false.

+
source

pub fn set(&mut self, other: Self, value: bool)

Call insert when value is true or remove when value is false.

source

pub const fn intersection(self, other: Self) -> Self

The bitwise and (&) of the bits in two flags values.

source

pub const fn union(self, other: Self) -> Self

The bitwise or (|) of the bits in two flags values.

source

pub const fn difference(self, other: Self) -> Self

The intersection of a source flags value with the complement of a target flags value (&!).

@@ -32,42 +32,42 @@
source

pub const fn iter_names(&self) -> IterNames<InfoSubset>

Yield a set of contained named flags values.

This method is like iter, except only yields bits in contained named flags. Any unknown bits, or bits not corresponding to a contained flag will not be yielded.

-
source§

impl InfoSubset

source

pub fn normalize(self) -> Self

Trait Implementations§

source§

impl Binary for InfoSubset

source§

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

Formats the value using the given formatter.
source§

impl BitAnd<InfoSubset> for InfoSubset

source§

fn bitand(self, other: Self) -> Self

The bitwise and (&) of the bits in two flags values.

-
§

type Output = InfoSubset

The resulting type after applying the & operator.
source§

impl BitAndAssign<InfoSubset> for InfoSubset

source§

fn bitand_assign(&mut self, other: Self)

The bitwise and (&) of the bits in two flags values.

-
source§

impl BitOr<InfoSubset> for InfoSubset

source§

fn bitor(self, other: InfoSubset) -> Self

The bitwise or (|) of the bits in two flags values.

-
§

type Output = InfoSubset

The resulting type after applying the | operator.
source§

impl BitOrAssign<InfoSubset> for InfoSubset

source§

fn bitor_assign(&mut self, other: Self)

The bitwise or (|) of the bits in two flags values.

-
source§

impl BitXor<InfoSubset> for InfoSubset

source§

fn bitxor(self, other: Self) -> Self

The bitwise exclusive-or (^) of the bits in two flags values.

-
§

type Output = InfoSubset

The resulting type after applying the ^ operator.
source§

impl BitXorAssign<InfoSubset> for InfoSubset

source§

fn bitxor_assign(&mut self, other: Self)

The bitwise exclusive-or (^) of the bits in two flags values.

-
source§

impl Clone for InfoSubset

source§

fn clone(&self) -> InfoSubset

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 InfoSubset

source§

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

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

impl Default for InfoSubset

source§

fn default() -> Self

Returns the “default value” for a type. Read more
source§

impl Extend<InfoSubset> for InfoSubset

source§

fn extend<T: IntoIterator<Item = Self>>(&mut self, iterator: T)

The bitwise or (|) of the bits in each flags value.

-
source§

fn extend_one(&mut self, item: A)

🔬This is a nightly-only experimental API. (extend_one)
Extends a collection with exactly one element.
source§

fn extend_reserve(&mut self, additional: usize)

🔬This is a nightly-only experimental API. (extend_one)
Reserves capacity in a collection for the given number of additional elements. Read more
source§

impl Flags for InfoSubset

source§

const FLAGS: &'static [Flag<InfoSubset>] = _

The set of defined flags.
§

type Bits = u32

The underlying bits type.
source§

fn bits(&self) -> u32

Get the underlying bits value. Read more
source§

fn from_bits_retain(bits: u32) -> InfoSubset

Convert from a bits value exactly.
§

fn empty() -> Self

Get a flags value with all bits unset.
§

fn all() -> Self

Get a flags value with all known bits set.
§

fn from_bits(bits: Self::Bits) -> Option<Self>

Convert from a bits value. Read more
§

fn from_bits_truncate(bits: Self::Bits) -> Self

Convert from a bits value, unsetting any unknown bits.
§

fn from_name(name: &str) -> Option<Self>

Get a flags value with the bits of a flag with the given name set. Read more
§

fn iter(&self) -> Iter<Self>

Yield a set of contained flags values. Read more
§

fn iter_names(&self) -> IterNames<Self>

Yield a set of contained named flags values. Read more
§

fn is_empty(&self) -> bool

Whether all bits in this flags value are unset.
§

fn is_all(&self) -> bool

Whether all known bits in this flags value are set.
§

fn intersects(&self, other: Self) -> boolwhere - Self: Sized,

Whether any set bits in a source flags value are also set in a target flags value.
§

fn contains(&self, other: Self) -> boolwhere - Self: Sized,

Whether all set bits in a source flags value are also set in a target flags value.
§

fn insert(&mut self, other: Self)where - Self: Sized,

The bitwise or (|) of the bits in two flags values.
§

fn remove(&mut self, other: Self)where - Self: Sized,

The intersection of a source flags value with the complement of a target flags value (&!). Read more
§

fn toggle(&mut self, other: Self)where - Self: Sized,

The bitwise exclusive-or (^) of the bits in two flags values.
§

fn set(&mut self, other: Self, value: bool)where - Self: Sized,

Call [Flags::insert] when value is true or [Flags::remove] when value is false.
§

fn intersection(self, other: Self) -> Self

The bitwise and (&) of the bits in two flags values.
§

fn union(self, other: Self) -> Self

The bitwise or (|) of the bits in two flags values.
§

fn difference(self, other: Self) -> Self

The intersection of a source flags value with the complement of a target flags value (&!). Read more
§

fn symmetric_difference(self, other: Self) -> Self

The bitwise exclusive-or (^) of the bits in two flags values.
§

fn complement(self) -> Self

The bitwise negation (!) of the bits in a flags value, truncating the result.
source§

impl FromIterator<InfoSubset> for InfoSubset

source§

fn from_iter<T: IntoIterator<Item = Self>>(iterator: T) -> Self

The bitwise or (|) of the bits in each flags value.

-
source§

impl IntoIterator for InfoSubset

§

type Item = InfoSubset

The type of the elements being iterated over.
§

type IntoIter = Iter<InfoSubset>

Which kind of iterator are we turning this into?
source§

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value. Read more
source§

impl LowerHex for InfoSubset

source§

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

Formats the value using the given formatter.
source§

impl Not for InfoSubset

source§

fn not(self) -> Self

The bitwise negation (!) of the bits in a flags value, truncating the result.

-
§

type Output = InfoSubset

The resulting type after applying the ! operator.
source§

impl Octal for InfoSubset

source§

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

Formats the value using the given formatter.
source§

impl PartialEq<InfoSubset> for InfoSubset

source§

fn eq(&self, other: &InfoSubset) -> 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 PublicFlags for InfoSubset

§

type Primitive = u32

The type of the underlying storage.
§

type Internal = InternalBitFlags

The type of the internal field on the generated flags type.
source§

impl Sub<InfoSubset> for InfoSubset

source§

fn sub(self, other: Self) -> Self

The intersection of a source flags value with the complement of a target flags value (&!).

+
source§

impl InfoSubset

source

pub fn normalize(self) -> Self

Trait Implementations§

source§

impl Binary for InfoSubset

source§

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

Formats the value using the given formatter.
source§

impl BitAnd for InfoSubset

source§

fn bitand(self, other: Self) -> Self

The bitwise and (&) of the bits in two flags values.

+
§

type Output = InfoSubset

The resulting type after applying the & operator.
source§

impl BitAndAssign for InfoSubset

source§

fn bitand_assign(&mut self, other: Self)

The bitwise and (&) of the bits in two flags values.

+
source§

impl BitOr for InfoSubset

source§

fn bitor(self, other: InfoSubset) -> Self

The bitwise or (|) of the bits in two flags values.

+
§

type Output = InfoSubset

The resulting type after applying the | operator.
source§

impl BitOrAssign for InfoSubset

source§

fn bitor_assign(&mut self, other: Self)

The bitwise or (|) of the bits in two flags values.

+
source§

impl BitXor for InfoSubset

source§

fn bitxor(self, other: Self) -> Self

The bitwise exclusive-or (^) of the bits in two flags values.

+
§

type Output = InfoSubset

The resulting type after applying the ^ operator.
source§

impl BitXorAssign for InfoSubset

source§

fn bitxor_assign(&mut self, other: Self)

The bitwise exclusive-or (^) of the bits in two flags values.

+
source§

impl Clone for InfoSubset

source§

fn clone(&self) -> InfoSubset

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 InfoSubset

source§

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

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

impl Default for InfoSubset

source§

fn default() -> Self

Returns the “default value” for a type. Read more
source§

impl Extend<InfoSubset> for InfoSubset

source§

fn extend<T: IntoIterator<Item = Self>>(&mut self, iterator: T)

The bitwise or (|) of the bits in each flags value.

+
source§

fn extend_one(&mut self, item: A)

🔬This is a nightly-only experimental API. (extend_one)
Extends a collection with exactly one element.
source§

fn extend_reserve(&mut self, additional: usize)

🔬This is a nightly-only experimental API. (extend_one)
Reserves capacity in a collection for the given number of additional elements. Read more
source§

impl Flags for InfoSubset

source§

const FLAGS: &'static [Flag<InfoSubset>] = _

The set of defined flags.
§

type Bits = u32

The underlying bits type.
source§

fn bits(&self) -> u32

Get the underlying bits value. Read more
source§

fn from_bits_retain(bits: u32) -> InfoSubset

Convert from a bits value exactly.
§

fn empty() -> Self

Get a flags value with all bits unset.
§

fn all() -> Self

Get a flags value with all known bits set.
§

fn from_bits(bits: Self::Bits) -> Option<Self>

Convert from a bits value. Read more
§

fn from_bits_truncate(bits: Self::Bits) -> Self

Convert from a bits value, unsetting any unknown bits.
§

fn from_name(name: &str) -> Option<Self>

Get a flags value with the bits of a flag with the given name set. Read more
§

fn iter(&self) -> Iter<Self>

Yield a set of contained flags values. Read more
§

fn iter_names(&self) -> IterNames<Self>

Yield a set of contained named flags values. Read more
§

fn is_empty(&self) -> bool

Whether all bits in this flags value are unset.
§

fn is_all(&self) -> bool

Whether all known bits in this flags value are set.
§

fn intersects(&self, other: Self) -> boolwhere + Self: Sized,

Whether any set bits in a source flags value are also set in a target flags value.
§

fn contains(&self, other: Self) -> boolwhere + Self: Sized,

Whether all set bits in a source flags value are also set in a target flags value.
§

fn insert(&mut self, other: Self)where + Self: Sized,

The bitwise or (|) of the bits in two flags values.
§

fn remove(&mut self, other: Self)where + Self: Sized,

The intersection of a source flags value with the complement of a target flags value (&!). Read more
§

fn toggle(&mut self, other: Self)where + Self: Sized,

The bitwise exclusive-or (^) of the bits in two flags values.
§

fn set(&mut self, other: Self, value: bool)where + Self: Sized,

Call [Flags::insert] when value is true or [Flags::remove] when value is false.
§

fn intersection(self, other: Self) -> Self

The bitwise and (&) of the bits in two flags values.
§

fn union(self, other: Self) -> Self

The bitwise or (|) of the bits in two flags values.
§

fn difference(self, other: Self) -> Self

The intersection of a source flags value with the complement of a target flags value (&!). Read more
§

fn symmetric_difference(self, other: Self) -> Self

The bitwise exclusive-or (^) of the bits in two flags values.
§

fn complement(self) -> Self

The bitwise negation (!) of the bits in a flags value, truncating the result.
source§

impl FromIterator<InfoSubset> for InfoSubset

source§

fn from_iter<T: IntoIterator<Item = Self>>(iterator: T) -> Self

The bitwise or (|) of the bits in each flags value.

+
source§

impl IntoIterator for InfoSubset

§

type Item = InfoSubset

The type of the elements being iterated over.
§

type IntoIter = Iter<InfoSubset>

Which kind of iterator are we turning this into?
source§

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value. Read more
source§

impl LowerHex for InfoSubset

source§

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

Formats the value using the given formatter.
source§

impl Not for InfoSubset

source§

fn not(self) -> Self

The bitwise negation (!) of the bits in a flags value, truncating the result.

+
§

type Output = InfoSubset

The resulting type after applying the ! operator.
source§

impl Octal for InfoSubset

source§

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

Formats the value using the given formatter.
source§

impl PartialEq for InfoSubset

source§

fn eq(&self, other: &InfoSubset) -> 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 PublicFlags for InfoSubset

§

type Primitive = u32

The type of the underlying storage.
§

type Internal = InternalBitFlags

The type of the internal field on the generated flags type.
source§

impl Sub for InfoSubset

source§

fn sub(self, other: Self) -> Self

The intersection of a source flags value with the complement of a target flags value (&!).

This method is not equivalent to self & !other when other has unknown bits set. difference won’t truncate other, but the ! operator will.

-
§

type Output = InfoSubset

The resulting type after applying the - operator.
source§

impl SubAssign<InfoSubset> for InfoSubset

source§

fn sub_assign(&mut self, other: Self)

The intersection of a source flags value with the complement of a target flags value (&!).

+
§

type Output = InfoSubset

The resulting type after applying the - operator.
source§

impl SubAssign for InfoSubset

source§

fn sub_assign(&mut self, other: Self)

The intersection of a source flags value with the complement of a target flags value (&!).

This method is not equivalent to self & !other when other has unknown bits set. difference won’t truncate other, but the ! operator will.

-
source§

impl UpperHex for InfoSubset

source§

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

Formats the value using the given formatter.
source§

impl Copy for InfoSubset

source§

impl Eq for InfoSubset

source§

impl StructuralEq for InfoSubset

source§

impl StructuralPartialEq for InfoSubset

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,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

source§

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

Mutably borrows from an owned value. Read more
§

impl<Q, K> Equivalent<K> for Qwhere - Q: Eq + ?Sized, - K: Borrow<Q> + ?Sized,

§

fn equivalent(&self, key: &K) -> bool

Checks if this value is equivalent to the given key. Read more
§

impl<Q, K> Equivalent<K> for Qwhere - Q: Eq + ?Sized, - K: Borrow<Q> + ?Sized,

§

fn equivalent(&self, key: &K) -> bool

Compare self to key and return true if they are equal.
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

-
source§

impl<T, U> Into<U> for Twhere - U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

+
source§

impl UpperHex for InfoSubset

source§

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

Formats the value using the given formatter.
source§

impl Copy for InfoSubset

source§

impl Eq for InfoSubset

source§

impl StructuralEq for InfoSubset

source§

impl StructuralPartialEq for InfoSubset

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,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

source§

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

Mutably borrows from an owned value. Read more
§

impl<Q, K> Equivalent<K> for Qwhere + Q: Eq + ?Sized, + K: Borrow<Q> + ?Sized,

§

fn equivalent(&self, key: &K) -> bool

Checks if this value is equivalent to the given key. Read more
§

impl<Q, K> Equivalent<K> for Qwhere + Q: Eq + ?Sized, + K: Borrow<Q> + ?Sized,

§

fn equivalent(&self, key: &K) -> bool

Compare self to key and return true if they are equal.
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

+
source§

impl<T, U> Into<U> for Twhere + U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of -From<T> for U chooses to do.

-
source§

impl<T> ToOwned for Twhere - T: Clone,

§

type Owned = T

The resulting type after obtaining ownership.
source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
source§

impl<T, U> TryFrom<U> for Twhere - U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
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.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
\ No newline at end of file +From<T> for U chooses to do.

+
source§

impl<T> ToOwned for Twhere + T: Clone,

§

type Owned = T

The resulting type after obtaining ownership.
source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
source§

impl<T, U> TryFrom<U> for Twhere + U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
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.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
\ No newline at end of file diff --git a/rust/sudachi/dic/word_id/index.html b/rust/sudachi/dic/word_id/index.html index 29fad975..ec03e2c9 100644 --- a/rust/sudachi/dic/word_id/index.html +++ b/rust/sudachi/dic/word_id/index.html @@ -1 +1 @@ -sudachi::dic::word_id - Rust

Module sudachi::dic::word_id

source ·

Structs

\ No newline at end of file +sudachi::dic::word_id - Rust

Module sudachi::dic::word_id

source ·

Structs

\ No newline at end of file diff --git a/rust/sudachi/dic/word_id/struct.WordId.html b/rust/sudachi/dic/word_id/struct.WordId.html index add32b86..8cf46426 100644 --- a/rust/sudachi/dic/word_id/struct.WordId.html +++ b/rust/sudachi/dic/word_id/struct.WordId.html @@ -1,43 +1,43 @@ -WordId in sudachi::dic::word_id - Rust

Struct sudachi::dic::word_id::WordId

source ·
#[repr(transparent)]
pub struct WordId { /* private fields */ }
Expand description

Dictionary word ID

+WordId in sudachi::dic::word_id - Rust

Struct sudachi::dic::word_id::WordId

source ·
pub struct WordId { /* private fields */ }
Expand description

Dictionary word ID

Encode dictionary ID and word internal ID as 4 bits and 28 bits respectively DicId 0 - system dictionary DicId 15 - OOV and other special nodes

-

Implementations§

source§

impl WordId

source

pub const fn from_raw(raw: u32) -> WordId

Create WordId from the compressed representation

-
source

pub fn new(dic: u8, word: u32) -> WordId

Create WordId from parts

-
source

pub fn checked(dic: u8, word: u32) -> SudachiResult<WordId>

Creates the WordId with correctness checking

-
source

pub fn oov(pos_id: u32) -> WordId

Creates an OOV node for pos_id

-
source

pub fn dic(&self) -> u8

Extract Dictionary ID

-
source

pub fn word(&self) -> u32

Extract Word ID

-
source

pub fn is_system(&self) -> bool

Check if the word comes from the system dictionary

-
source

pub fn is_user(&self) -> bool

Check if the word comes from the user dictionary

-
source

pub fn as_raw(&self) -> u32

source

pub fn is_oov(&self) -> bool

Check if the word is OOV +

Implementations§

source§

impl WordId

source

pub const fn from_raw(raw: u32) -> WordId

Create WordId from the compressed representation

+
source

pub fn new(dic: u8, word: u32) -> WordId

Create WordId from parts

+
source

pub fn checked(dic: u8, word: u32) -> SudachiResult<WordId>

Creates the WordId with correctness checking

+
source

pub fn oov(pos_id: u32) -> WordId

Creates an OOV node for pos_id

+
source

pub fn dic(&self) -> u8

Extract Dictionary ID

+
source

pub fn word(&self) -> u32

Extract Word ID

+
source

pub fn is_system(&self) -> bool

Check if the word comes from the system dictionary

+
source

pub fn is_user(&self) -> bool

Check if the word comes from the user dictionary

+
source

pub fn as_raw(&self) -> u32

source

pub fn is_oov(&self) -> bool

Check if the word is OOV An OOV node can come of OOV handlers or be a special system node like BOS or EOS

-
source

pub fn is_special(&self) -> bool

Checks if the WordId corresponds to a special node

-
source

pub const INVALID: WordId = _

source

pub const BOS: WordId = _

source

pub const EOS: WordId = _

source

pub const MAX_WORD: u32 = 268_435_455u32

Trait Implementations§

source§

impl Clone for WordId

source§

fn clone(&self) -> WordId

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 WordId

source§

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

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

impl Display for WordId

source§

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

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

impl Hash for WordId

source§

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher. Read more
1.3.0 · source§

fn hash_slice<H>(data: &[Self], state: &mut H)where - H: Hasher, - Self: Sized,

Feeds a slice of this type into the given Hasher. Read more
source§

impl Ord for WordId

source§

fn cmp(&self, other: &WordId) -> Ordering

This method returns an Ordering between self and other. Read more
1.21.0 · source§

fn max(self, other: Self) -> Selfwhere - Self: Sized,

Compares and returns the maximum of two values. Read more
1.21.0 · source§

fn min(self, other: Self) -> Selfwhere - Self: Sized,

Compares and returns the minimum of two values. Read more
1.50.0 · source§

fn clamp(self, min: Self, max: Self) -> Selfwhere - Self: Sized + PartialOrd<Self>,

Restrict a value to a certain interval. Read more
source§

impl PartialEq<WordId> for WordId

source§

fn eq(&self, other: &WordId) -> 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 PartialOrd<WordId> for WordId

source§

fn partial_cmp(&self, other: &WordId) -> Option<Ordering>

This method returns an ordering between self and other values if one exists. Read more
1.0.0 · source§

fn lt(&self, other: &Rhs) -> bool

This method tests less than (for self and other) and is used by the < operator. Read more
1.0.0 · source§

fn le(&self, other: &Rhs) -> bool

This method tests less than or equal to (for self and other) and is used by the <= -operator. Read more
1.0.0 · source§

fn gt(&self, other: &Rhs) -> bool

This method tests greater than (for self and other) and is used by the > operator. Read more
1.0.0 · source§

fn ge(&self, other: &Rhs) -> bool

This method tests greater than or equal to (for self and other) and is used by the >= -operator. Read more
source§

impl Copy for WordId

source§

impl Eq for WordId

source§

impl StructuralEq for WordId

source§

impl StructuralPartialEq for WordId

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,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

source§

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

Mutably borrows from an owned value. Read more
§

impl<Q, K> Comparable<K> for Qwhere - Q: Ord + ?Sized, - K: Borrow<Q> + ?Sized,

§

fn compare(&self, key: &K) -> Ordering

Compare self to key and return their ordering.
§

impl<Q, K> Equivalent<K> for Qwhere - Q: Eq + ?Sized, - K: Borrow<Q> + ?Sized,

§

fn equivalent(&self, key: &K) -> bool

Checks if this value is equivalent to the given key. Read more
§

impl<Q, K> Equivalent<K> for Qwhere - Q: Eq + ?Sized, - K: Borrow<Q> + ?Sized,

§

fn equivalent(&self, key: &K) -> bool

Compare self to key and return true if they are equal.
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

-
source§

impl<T, U> Into<U> for Twhere - U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

+
source

pub fn is_special(&self) -> bool

Checks if the WordId corresponds to a special node

+
source

pub const INVALID: WordId = _

source

pub const BOS: WordId = _

source

pub const EOS: WordId = _

source

pub const MAX_WORD: u32 = 268_435_455u32

Trait Implementations§

source§

impl Clone for WordId

source§

fn clone(&self) -> WordId

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 WordId

source§

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

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

impl Display for WordId

source§

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

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

impl Hash for WordId

source§

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher. Read more
1.3.0 · source§

fn hash_slice<H>(data: &[Self], state: &mut H)where + H: Hasher, + Self: Sized,

Feeds a slice of this type into the given Hasher. Read more
source§

impl Ord for WordId

source§

fn cmp(&self, other: &WordId) -> Ordering

This method returns an Ordering between self and other. Read more
1.21.0 · source§

fn max(self, other: Self) -> Selfwhere + Self: Sized,

Compares and returns the maximum of two values. Read more
1.21.0 · source§

fn min(self, other: Self) -> Selfwhere + Self: Sized,

Compares and returns the minimum of two values. Read more
1.50.0 · source§

fn clamp(self, min: Self, max: Self) -> Selfwhere + Self: Sized + PartialOrd,

Restrict a value to a certain interval. Read more
source§

impl PartialEq for WordId

source§

fn eq(&self, other: &WordId) -> 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 PartialOrd for WordId

source§

fn partial_cmp(&self, other: &WordId) -> Option<Ordering>

This method returns an ordering between self and other values if one exists. Read more
1.0.0 · source§

fn lt(&self, other: &Rhs) -> bool

This method tests less than (for self and other) and is used by the < operator. Read more
1.0.0 · source§

fn le(&self, other: &Rhs) -> bool

This method tests less than or equal to (for self and other) and is used by the <= +operator. Read more
1.0.0 · source§

fn gt(&self, other: &Rhs) -> bool

This method tests greater than (for self and other) and is used by the > operator. Read more
1.0.0 · source§

fn ge(&self, other: &Rhs) -> bool

This method tests greater than or equal to (for self and other) and is used by the >= +operator. Read more
source§

impl Copy for WordId

source§

impl Eq for WordId

source§

impl StructuralEq for WordId

source§

impl StructuralPartialEq for WordId

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,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

source§

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

Mutably borrows from an owned value. Read more
§

impl<Q, K> Comparable<K> for Qwhere + Q: Ord + ?Sized, + K: Borrow<Q> + ?Sized,

§

fn compare(&self, key: &K) -> Ordering

Compare self to key and return their ordering.
§

impl<Q, K> Equivalent<K> for Qwhere + Q: Eq + ?Sized, + K: Borrow<Q> + ?Sized,

§

fn equivalent(&self, key: &K) -> bool

Checks if this value is equivalent to the given key. Read more
§

impl<Q, K> Equivalent<K> for Qwhere + Q: Eq + ?Sized, + K: Borrow<Q> + ?Sized,

§

fn equivalent(&self, key: &K) -> bool

Compare self to key and return true if they are equal.
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

+
source§

impl<T, U> Into<U> for Twhere + U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of -From<T> for U chooses to do.

-
source§

impl<T> ToOwned for Twhere - T: Clone,

§

type Owned = T

The resulting type after obtaining ownership.
source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
source§

impl<T> ToString for Twhere - T: Display + ?Sized,

source§

default fn to_string(&self) -> String

Converts the given value to a String. Read more
source§

impl<T, U> TryFrom<U> for Twhere - U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
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.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
\ No newline at end of file +From<T> for U chooses to do.

+
source§

impl<T> ToOwned for Twhere + T: Clone,

§

type Owned = T

The resulting type after obtaining ownership.
source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
source§

impl<T> ToString for Twhere + T: Display + ?Sized,

source§

default fn to_string(&self) -> String

Converts the given value to a String. Read more
source§

impl<T, U> TryFrom<U> for Twhere + U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
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.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
\ No newline at end of file diff --git a/rust/sudachi/error/enum.SudachiError.html b/rust/sudachi/error/enum.SudachiError.html index aac29588..a8294fb2 100644 --- a/rust/sudachi/error/enum.SudachiError.html +++ b/rust/sudachi/error/enum.SudachiError.html @@ -1,16 +1,16 @@ -SudachiError in sudachi::error - Rust
#[non_exhaustive]
pub enum SudachiError { +SudachiError in sudachi::error - Rust
#[non_exhaustive]
pub enum SudachiError {
Show 23 variants ErrWithContext { - context: String, - cause: Box<SudachiError>, + context: String, + cause: Box<SudachiError>, }, Io { - cause: Error, - context: String, + cause: Error, + context: String, }, - ParseIntError(ParseIntError), - FromUtf16(FromUtf16Error), + ParseIntError(ParseIntError), + FromUtf16(FromUtf16Error), RegexError(Error), - NomParseError(String), + NomParseError(String), InvalidUtf16FromNom, SerdeError(Error), InvalidCharacterCategory(Error), @@ -19,25 +19,25 @@ LexiconSetError(LexiconSetError), PluginError(PluginError), EosBosDisconnect, - InvalidCharacterCategoryType(String), - InvalidDataFormat(usize, String), + InvalidCharacterCategoryType(String), + InvalidDataFormat(usize, String), InvalidDictionaryGrammar, - InvalidPartOfSpeech(String), - InvalidRange(usize, usize), + InvalidPartOfSpeech(String), + InvalidRange(usize, usize), NoOOVPluginProvided, - InputTooLong(usize, usize), + InputTooLong(usize, usize), DictionaryCompilationError(DicBuildError), MorphemeListBorrowed,
}
Expand description

Sudachi error

-

Variants (Non-exhaustive)§

This enum is marked as non-exhaustive
Non-exhaustive enums could have additional variants added in future. Therefore, when matching against variants of non-exhaustive enums, an extra wildcard arm must be added to account for any future variants.
§

ErrWithContext

Fields

§context: String
§

Io

Fields

§cause: Error
§context: String
§

ParseIntError(ParseIntError)

§

FromUtf16(FromUtf16Error)

§

RegexError(Error)

§

NomParseError(String)

§

InvalidUtf16FromNom

§

SerdeError(Error)

§

InvalidCharacterCategory(Error)

§

ConfigError(ConfigError)

§

InvalidHeader(HeaderError)

§

LexiconSetError(LexiconSetError)

§

PluginError(PluginError)

§

EosBosDisconnect

§

InvalidCharacterCategoryType(String)

§

InvalidDataFormat(usize, String)

§

InvalidDictionaryGrammar

§

InvalidPartOfSpeech(String)

§

InvalidRange(usize, usize)

§

NoOOVPluginProvided

§

InputTooLong(usize, usize)

§

DictionaryCompilationError(DicBuildError)

§

MorphemeListBorrowed

Implementations§

source§

impl SudachiError

source

pub fn with_context<S: Into<String>>(self, ctx: S) -> Self

Trait Implementations§

source§

impl Debug for SudachiError

source§

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

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

impl Display for SudachiError

source§

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

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

impl Error for SudachiError

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()
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, request: &mut Request<'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<ConfigError> for SudachiError

source§

fn from(source: ConfigError) -> Self

Converts to this type from the input type.
source§

impl From<DicBuildError> for SudachiError

source§

fn from(source: DicBuildError) -> Self

Converts to this type from the input type.
source§

impl<I: Debug> From<Err<SudachiNomError<I>>> for SudachiError

source§

fn from(err: Err<SudachiNomError<I>>) -> Self

Converts to this type from the input type.
source§

impl From<Error> for SudachiError

source§

fn from(source: CharacterCategoryError) -> Self

Converts to this type from the input type.
source§

impl From<Error> for SudachiError

source§

fn from(source: Error) -> Self

Converts to this type from the input type.
source§

impl From<Error> for SudachiError

source§

fn from(e: Error) -> Self

Converts to this type from the input type.
source§

impl From<Error> for SudachiError

source§

fn from(source: Error) -> Self

Converts to this type from the input type.
source§

impl From<FromUtf16Error> for SudachiError

source§

fn from(source: FromUtf16Error) -> Self

Converts to this type from the input type.
source§

impl From<HeaderError> for SudachiError

source§

fn from(source: HeaderError) -> Self

Converts to this type from the input type.
source§

impl From<LexiconSetError> for SudachiError

source§

fn from(source: LexiconSetError) -> Self

Converts to this type from the input type.
source§

impl From<ParseIntError> for SudachiError

source§

fn from(source: ParseIntError) -> Self

Converts to this type from the input type.
source§

impl From<PluginError> for SudachiError

source§

fn from(source: PluginError) -> 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,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

source§

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

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

-
source§

impl<T, U> Into<U> for Twhere - U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

+

Variants (Non-exhaustive)§

This enum is marked as non-exhaustive
Non-exhaustive enums could have additional variants added in future. Therefore, when matching against variants of non-exhaustive enums, an extra wildcard arm must be added to account for any future variants.
§

ErrWithContext

Fields

§context: String
§

Io

Fields

§cause: Error
§context: String
§

ParseIntError(ParseIntError)

§

FromUtf16(FromUtf16Error)

§

RegexError(Error)

§

NomParseError(String)

§

InvalidUtf16FromNom

§

SerdeError(Error)

§

InvalidCharacterCategory(Error)

§

ConfigError(ConfigError)

§

InvalidHeader(HeaderError)

§

LexiconSetError(LexiconSetError)

§

PluginError(PluginError)

§

EosBosDisconnect

§

InvalidCharacterCategoryType(String)

§

InvalidDataFormat(usize, String)

§

InvalidDictionaryGrammar

§

InvalidPartOfSpeech(String)

§

InvalidRange(usize, usize)

§

NoOOVPluginProvided

§

InputTooLong(usize, usize)

§

DictionaryCompilationError(DicBuildError)

§

MorphemeListBorrowed

Implementations§

source§

impl SudachiError

source

pub fn with_context<S: Into<String>>(self, ctx: S) -> Self

Trait Implementations§

source§

impl Debug for SudachiError

source§

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

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

impl Display for SudachiError

source§

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

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

impl Error for SudachiError

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()
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, request: &mut Request<'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<ConfigError> for SudachiError

source§

fn from(source: ConfigError) -> Self

Converts to this type from the input type.
source§

impl From<DicBuildError> for SudachiError

source§

fn from(source: DicBuildError) -> Self

Converts to this type from the input type.
source§

impl<I: Debug> From<Err<SudachiNomError<I>>> for SudachiError

source§

fn from(err: Err<SudachiNomError<I>>) -> Self

Converts to this type from the input type.
source§

impl From<Error> for SudachiError

source§

fn from(source: Error) -> Self

Converts to this type from the input type.
source§

impl From<Error> for SudachiError

source§

fn from(e: Error) -> Self

Converts to this type from the input type.
source§

impl From<Error> for SudachiError

source§

fn from(source: Error) -> Self

Converts to this type from the input type.
source§

impl From<Error> for SudachiError

source§

fn from(source: CharacterCategoryError) -> Self

Converts to this type from the input type.
source§

impl From<FromUtf16Error> for SudachiError

source§

fn from(source: FromUtf16Error) -> Self

Converts to this type from the input type.
source§

impl From<HeaderError> for SudachiError

source§

fn from(source: HeaderError) -> Self

Converts to this type from the input type.
source§

impl From<LexiconSetError> for SudachiError

source§

fn from(source: LexiconSetError) -> Self

Converts to this type from the input type.
source§

impl From<ParseIntError> for SudachiError

source§

fn from(source: ParseIntError) -> Self

Converts to this type from the input type.
source§

impl From<PluginError> for SudachiError

source§

fn from(source: PluginError) -> 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,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

source§

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

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

+
source§

impl<T, U> Into<U> for Twhere + U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of -From<T> for U chooses to do.

-
source§

impl<T> ToString for Twhere - T: Display + ?Sized,

source§

default fn to_string(&self) -> String

Converts the given value to a String. Read more
source§

impl<T, U> TryFrom<U> for Twhere - U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
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.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
\ No newline at end of file +From<T> for U chooses to do.

+
source§

impl<T> ToString for Twhere + T: Display + ?Sized,

source§

default fn to_string(&self) -> String

Converts the given value to a String. Read more
source§

impl<T, U> TryFrom<U> for Twhere + U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
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.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
\ No newline at end of file diff --git a/rust/sudachi/error/enum.SudachiNomError.html b/rust/sudachi/error/enum.SudachiNomError.html index 14019d74..1297976d 100644 --- a/rust/sudachi/error/enum.SudachiNomError.html +++ b/rust/sudachi/error/enum.SudachiNomError.html @@ -1,27 +1,27 @@ -SudachiNomError in sudachi::error - Rust
pub enum SudachiNomError<I> {
+SudachiNomError in sudachi::error - Rust
pub enum SudachiNomError<I> {
     Utf16String,
     Nom(I, ErrorKind),
-    OutOfBounds(String, usize, usize),
+    OutOfBounds(String, usize, usize),
 }
Expand description

Custum nom error

Variants§

§

Utf16String

Failed to parse utf16 string

-
§

Nom(I, ErrorKind)

§

OutOfBounds(String, usize, usize)

Trait Implementations§

source§

impl<I: Debug> Debug for SudachiNomError<I>

source§

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

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

impl<I> ParseError<I> for SudachiNomError<I>

source§

fn from_error_kind(input: I, kind: ErrorKind) -> Self

Creates an error from the input position and an [ErrorKind]
source§

fn append(_: I, _: ErrorKind, other: Self) -> Self

Combines an existing error with a new one created from the input +
§

Nom(I, ErrorKind)

§

OutOfBounds(String, usize, usize)

Trait Implementations§

source§

impl<I: Debug> Debug for SudachiNomError<I>

source§

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

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

impl<I> ParseError<I> for SudachiNomError<I>

source§

fn from_error_kind(input: I, kind: ErrorKind) -> Self

Creates an error from the input position and an [ErrorKind]
source§

fn append(_: I, _: ErrorKind, other: Self) -> Self

Combines an existing error with a new one created from the input position and an [ErrorKind]. This is useful when backtracking -through a parse tree, accumulating error context on the way
§

fn from_char(input: I, _: char) -> Self

Creates an error from an input position and an expected character
§

fn or(self, other: Self) -> Self

Combines two existing errors. This function is used to compare errors -generated in various branches of alt.
source§

impl<I: PartialEq> PartialEq<SudachiNomError<I>> for SudachiNomError<I>

source§

fn eq(&self, other: &SudachiNomError<I>) -> 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<I> StructuralPartialEq for SudachiNomError<I>

Auto Trait Implementations§

§

impl<I> RefUnwindSafe for SudachiNomError<I>where - I: RefUnwindSafe,

§

impl<I> Send for SudachiNomError<I>where - I: Send,

§

impl<I> Sync for SudachiNomError<I>where - I: Sync,

§

impl<I> Unpin for SudachiNomError<I>where - I: Unpin,

§

impl<I> UnwindSafe for SudachiNomError<I>where - I: UnwindSafe,

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,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

source§

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

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

-
source§

impl<T, U> Into<U> for Twhere - U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

+through a parse tree, accumulating error context on the way
§

fn from_char(input: I, _: char) -> Self

Creates an error from an input position and an expected character
§

fn or(self, other: Self) -> Self

Combines two existing errors. This function is used to compare errors +generated in various branches of alt.
source§

impl<I: PartialEq> PartialEq for SudachiNomError<I>

source§

fn eq(&self, other: &SudachiNomError<I>) -> 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<I> StructuralPartialEq for SudachiNomError<I>

Auto Trait Implementations§

§

impl<I> RefUnwindSafe for SudachiNomError<I>where + I: RefUnwindSafe,

§

impl<I> Send for SudachiNomError<I>where + I: Send,

§

impl<I> Sync for SudachiNomError<I>where + I: Sync,

§

impl<I> Unpin for SudachiNomError<I>where + I: Unpin,

§

impl<I> UnwindSafe for SudachiNomError<I>where + I: UnwindSafe,

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,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

source§

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

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

+
source§

impl<T, U> Into<U> for Twhere + U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of -From<T> for U chooses to do.

-
source§

impl<T, U> TryFrom<U> for Twhere - U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
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.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
\ No newline at end of file +From<T> for U chooses to do.

+
source§

impl<T, U> TryFrom<U> for Twhere + U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
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.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
\ No newline at end of file diff --git a/rust/sudachi/error/index.html b/rust/sudachi/error/index.html index d472bcd5..7141d84d 100644 --- a/rust/sudachi/error/index.html +++ b/rust/sudachi/error/index.html @@ -1 +1 @@ -sudachi::error - Rust
\ No newline at end of file +sudachi::error - Rust
\ No newline at end of file diff --git a/rust/sudachi/error/type.SudachiNomResult.html b/rust/sudachi/error/type.SudachiNomResult.html index 9b3e7281..8099a658 100644 --- a/rust/sudachi/error/type.SudachiNomResult.html +++ b/rust/sudachi/error/type.SudachiNomResult.html @@ -1,6 +1,6 @@ -SudachiNomResult in sudachi::error - Rust

Type Alias sudachi::error::SudachiNomResult

source ·
pub type SudachiNomResult<I, O> = IResult<I, O, SudachiNomError<I>>;

Aliased Type§

enum SudachiNomResult<I, O> {
-    Ok((I, O)),
+SudachiNomResult in sudachi::error - Rust

Type Alias sudachi::error::SudachiNomResult

source ·
pub type SudachiNomResult<I, O> = IResult<I, O, SudachiNomError<I>>;

Aliased Type§

enum SudachiNomResult<I, O> {
+    Ok((I, O)),
     Err(Err<SudachiNomError<I>>),
-}

Variants§

§1.0.0

Ok((I, O))

Contains the success value

+}

Variants§

§1.0.0

Ok((I, O))

Contains the success value

§1.0.0

Err(Err<SudachiNomError<I>>)

Contains the error value

\ No newline at end of file diff --git a/rust/sudachi/error/type.SudachiResult.html b/rust/sudachi/error/type.SudachiResult.html index 6a749ebb..95f99403 100644 --- a/rust/sudachi/error/type.SudachiResult.html +++ b/rust/sudachi/error/type.SudachiResult.html @@ -1,6 +1,6 @@ -SudachiResult in sudachi::error - Rust

Type Alias sudachi::error::SudachiResult

source ·
pub type SudachiResult<T> = Result<T, SudachiError>;

Aliased Type§

enum SudachiResult<T> {
+SudachiResult in sudachi::error - Rust

Type Alias sudachi::error::SudachiResult

source ·
pub type SudachiResult<T> = Result<T, SudachiError>;

Aliased Type§

enum SudachiResult<T> {
     Ok(T),
     Err(SudachiError),
 }

Variants§

§1.0.0

Ok(T)

Contains the success value

§1.0.0

Err(SudachiError)

Contains the error value

-
\ No newline at end of file +
\ No newline at end of file diff --git a/rust/sudachi/index.html b/rust/sudachi/index.html index 154b0404..1096eb2f 100644 --- a/rust/sudachi/index.html +++ b/rust/sudachi/index.html @@ -1,4 +1,5 @@ -sudachi - Rust

Crate sudachi

source ·
Expand description

Clone of Sudachi, +sudachi - Rust

Crate sudachi

source ·
Expand description

Clone of Sudachi, a Japanese morphological analyzer

There is no public API for the initial release. Issue: https://github.com/WorksApplications/sudachi.rs/issues/28

diff --git a/rust/sudachi/input_text/index.html b/rust/sudachi/input_text/index.html index c5e4a432..df121b9f 100644 --- a/rust/sudachi/input_text/index.html +++ b/rust/sudachi/input_text/index.html @@ -1 +1 @@ -sudachi::input_text - Rust

Module sudachi::input_text

source ·

Structs

Traits

\ No newline at end of file +sudachi::input_text - Rust

Module sudachi::input_text

source ·

Structs

Traits

\ No newline at end of file diff --git a/rust/sudachi/input_text/struct.InputBuffer.html b/rust/sudachi/input_text/struct.InputBuffer.html index 34dac3fa..a723fbe4 100644 --- a/rust/sudachi/input_text/struct.InputBuffer.html +++ b/rust/sudachi/input_text/struct.InputBuffer.html @@ -1,45 +1,45 @@ -InputBuffer in sudachi::input_text - Rust
pub struct InputBuffer { /* private fields */ }
Expand description

InputBuffer - prepares the input data for the analysis

+InputBuffer in sudachi::input_text - Rust
pub struct InputBuffer { /* private fields */ }
Expand description

InputBuffer - prepares the input data for the analysis

By saying char we actually mean Unicode codepoint here. In the context of this struct these terms are synonyms.

Implementations§

source§

impl InputBuffer

source

pub fn new() -> InputBuffer

Creates new InputBuffer

-
source

pub fn reset(&mut self) -> &mut String

Resets the input buffer, so it could be used to process new input. +

source

pub fn reset(&mut self) -> &mut String

Resets the input buffer, so it could be used to process new input. New input should be written to the returned mutable reference.

-
source

pub fn from<'a, T: AsRef<str>>(data: T) -> InputBuffer

Creates input from the passed string. Should be used mostly for tests.

+
source

pub fn from<'a, T: AsRef<str>>(data: T) -> InputBuffer

Creates input from the passed string. Should be used mostly for tests.

Panics if the input string is too long.

-
source

pub fn start_build(&mut self) -> SudachiResult<()>

Moves InputBuffer into RW state, making it possible to perform edits on it

-
source

pub fn build(&mut self, grammar: &Grammar<'_>) -> SudachiResult<()>

Finalizes InputBuffer state, making it RO

-
source

pub fn with_editor<'a, F>(&mut self, func: F) -> SudachiResult<()>where - F: FnOnce(&InputBuffer, InputEditor<'a>) -> SudachiResult<InputEditor<'a>> + 'a,

Execute a function which can modify the contents of the current buffer

+
source

pub fn start_build(&mut self) -> SudachiResult<()>

Moves InputBuffer into RW state, making it possible to perform edits on it

+
source

pub fn build(&mut self, grammar: &Grammar<'_>) -> SudachiResult<()>

Finalizes InputBuffer state, making it RO

+
source

pub fn with_editor<'a, F>(&mut self, func: F) -> SudachiResult<()>where + F: FnOnce(&InputBuffer, InputEditor<'a>) -> SudachiResult<InputEditor<'a>> + 'a,

Execute a function which can modify the contents of the current buffer

Edit can borrow &str from the context with the borrow checker working correctly

source

pub fn refresh_chars(&mut self)

Recompute chars from modified string (useful if the processing will use chars)

-
source§

impl InputBuffer

source

pub fn original(&self) -> &str

Borrow original data

-
source

pub fn current(&self) -> &str

Borrow modified data

-
source

pub fn current_chars(&self) -> &[char]

Borrow array of current characters

-
source

pub fn curr_byte_offsets(&self) -> &[usize]

Returns byte offsets of current chars

-
source

pub fn get_original_index(&self, index: usize) -> usize

Get index of the current byte in original sentence +

source§

impl InputBuffer

source

pub fn original(&self) -> &str

Borrow original data

+
source

pub fn current(&self) -> &str

Borrow modified data

+
source

pub fn current_chars(&self) -> &[char]

Borrow array of current characters

+
source

pub fn curr_byte_offsets(&self) -> &[usize]

Returns byte offsets of current chars

+
source

pub fn get_original_index(&self, index: usize) -> usize

Get index of the current byte in original sentence Bytes not on character boundaries are not supported

-
source

pub fn to_orig_byte_idx(&self, index: usize) -> usize

Mod Char Idx -> Orig Byte Idx

-
source

pub fn to_orig_char_idx(&self, index: usize) -> usize

Mod Char Idx -> Orig Char Idx

-
source

pub fn to_curr_byte_idx(&self, index: usize) -> usize

Mod Char Idx -> Mod Byte Idx

-
source

pub fn curr_slice_c(&self, data: Range<usize>) -> &str

Input: Mod Char Idx

-
source

pub fn orig_slice_c(&self, data: Range<usize>) -> &str

Input: Mod Char Idx

-
source

pub fn ch_idx(&self, idx: usize) -> usize

source

pub fn swap_original(&mut self, target: &mut String)

Swaps original data with the passed location

-
source

pub fn into_original(self) -> String

Return original data as owned, consuming itself

-
source

pub fn can_bow(&self, offset: usize) -> bool

Whether the byte can start a new word. +

source

pub fn to_orig_byte_idx(&self, index: usize) -> usize

Mod Char Idx -> Orig Byte Idx

+
source

pub fn to_orig_char_idx(&self, index: usize) -> usize

Mod Char Idx -> Orig Char Idx

+
source

pub fn to_curr_byte_idx(&self, index: usize) -> usize

Mod Char Idx -> Mod Byte Idx

+
source

pub fn curr_slice_c(&self, data: Range<usize>) -> &str

Input: Mod Char Idx

+
source

pub fn orig_slice_c(&self, data: Range<usize>) -> &str

Input: Mod Char Idx

+
source

pub fn ch_idx(&self, idx: usize) -> usize

source

pub fn swap_original(&mut self, target: &mut String)

Swaps original data with the passed location

+
source

pub fn into_original(self) -> String

Return original data as owned, consuming itself

+
source

pub fn can_bow(&self, offset: usize) -> bool

Whether the byte can start a new word. Supports bytes not on character boundaries.

-
source

pub fn get_word_candidate_length(&self, char_idx: usize) -> usize

Returns char length to the next can_bow point

+
source

pub fn get_word_candidate_length(&self, char_idx: usize) -> usize

Returns char length to the next can_bow point

Used by SimpleOOV plugin

-

Trait Implementations§

source§

impl Clone for InputBuffer

source§

fn clone(&self) -> InputBuffer

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 Default for InputBuffer

source§

fn default() -> InputBuffer

Returns the “default value” for a type. Read more
source§

impl InputTextIndex for InputBuffer

source§

fn cat_of_range(&self, range: Range<usize>) -> CategoryType

Common character category inside the range. Indexed by chars.
source§

fn cat_at_char(&self, offset: usize) -> CategoryType

Character category at char offset
source§

fn cat_continuous_len(&self, offset: usize) -> usize

Number of chars to the right of the offset with the same character category Read more
source§

fn char_distance(&self, cpt: usize, offset: usize) -> usize

Distance in chars between the char indexed by index +

Trait Implementations§

source§

impl Clone for InputBuffer

source§

fn clone(&self) -> InputBuffer

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 Default for InputBuffer

source§

fn default() -> InputBuffer

Returns the “default value” for a type. Read more
source§

impl InputTextIndex for InputBuffer

source§

fn cat_of_range(&self, range: Range<usize>) -> CategoryType

Common character category inside the range. Indexed by chars.
source§

fn cat_at_char(&self, offset: usize) -> CategoryType

Character category at char offset
source§

fn cat_continuous_len(&self, offset: usize) -> usize

Number of chars to the right of the offset with the same character category Read more
source§

fn char_distance(&self, cpt: usize, offset: usize) -> usize

Distance in chars between the char indexed by index and the char, relative to it by offset. -Java name: getCodePointsOffsetLength
source§

fn orig_slice(&self, range: Range<usize>) -> &str

Returns substring of original text by indices from the current text
source§

fn curr_slice(&self, range: Range<usize>) -> &str

Returns substring of the current (modified) text by indices from the current text
source§

fn to_orig(&self, range: Range<usize>) -> Range<usize>

Translate range from current state to original. Byte-indexed.

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,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

source§

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

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

-
source§

impl<T, U> Into<U> for Twhere - U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

+Java name: getCodePointsOffsetLength
source§

fn orig_slice(&self, range: Range<usize>) -> &str

Returns substring of original text by indices from the current text
source§

fn curr_slice(&self, range: Range<usize>) -> &str

Returns substring of the current (modified) text by indices from the current text
source§

fn to_orig(&self, range: Range<usize>) -> Range<usize>

Translate range from current state to original. Byte-indexed.

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,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

source§

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

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

+
source§

impl<T, U> Into<U> for Twhere + U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of -From<T> for U chooses to do.

-
source§

impl<T> ToOwned for Twhere - T: Clone,

§

type Owned = T

The resulting type after obtaining ownership.
source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
source§

impl<T, U> TryFrom<U> for Twhere - U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
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.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
\ No newline at end of file +From<T> for U chooses to do.

+
source§

impl<T> ToOwned for Twhere + T: Clone,

§

type Owned = T

The resulting type after obtaining ownership.
source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
source§

impl<T, U> TryFrom<U> for Twhere + U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
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.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
\ No newline at end of file diff --git a/rust/sudachi/input_text/struct.InputEditor.html b/rust/sudachi/input_text/struct.InputEditor.html index bd335802..076a9e7a 100644 --- a/rust/sudachi/input_text/struct.InputEditor.html +++ b/rust/sudachi/input_text/struct.InputEditor.html @@ -1,16 +1,16 @@ -InputEditor in sudachi::input_text - Rust
pub struct InputEditor<'a> { /* private fields */ }

Implementations§

source§

impl<'a> InputEditor<'a>

source

pub fn replace_ref(&mut self, range: Range<usize>, result: &'a str)

Replace range with a &str

-
source

pub fn replace_char(&mut self, range: Range<usize>, result: char)

Replace range with char

-
source

pub fn replace_own(&mut self, range: Range<usize>, result: String)

Replace range with owned String

-
source

pub fn replace_char_iter<It>(&mut self, range: Range<usize>, ch: char, rest: It)where - It: Iterator<Item = char>,

Replace range with char, followed by chars from iterator

-

Auto Trait Implementations§

§

impl<'a> RefUnwindSafe for InputEditor<'a>

§

impl<'a> Send for InputEditor<'a>

§

impl<'a> Sync for InputEditor<'a>

§

impl<'a> Unpin for InputEditor<'a>

§

impl<'a> !UnwindSafe for InputEditor<'a>

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,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

source§

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

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

-
source§

impl<T, U> Into<U> for Twhere - U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

+InputEditor in sudachi::input_text - Rust
pub struct InputEditor<'a> { /* private fields */ }

Implementations§

source§

impl<'a> InputEditor<'a>

source

pub fn replace_ref(&mut self, range: Range<usize>, result: &'a str)

Replace range with a &str

+
source

pub fn replace_char(&mut self, range: Range<usize>, result: char)

Replace range with char

+
source

pub fn replace_own(&mut self, range: Range<usize>, result: String)

Replace range with owned String

+
source

pub fn replace_char_iter<It>(&mut self, range: Range<usize>, ch: char, rest: It)where + It: Iterator<Item = char>,

Replace range with char, followed by chars from iterator

+

Auto Trait Implementations§

§

impl<'a> RefUnwindSafe for InputEditor<'a>

§

impl<'a> Send for InputEditor<'a>

§

impl<'a> Sync for InputEditor<'a>

§

impl<'a> Unpin for InputEditor<'a>

§

impl<'a> !UnwindSafe for InputEditor<'a>

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,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

source§

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

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

+
source§

impl<T, U> Into<U> for Twhere + U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of -From<T> for U chooses to do.

-
source§

impl<T, U> TryFrom<U> for Twhere - U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
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.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
\ No newline at end of file +From<T> for U chooses to do.

+
source§

impl<T, U> TryFrom<U> for Twhere + U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
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.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
\ No newline at end of file diff --git a/rust/sudachi/input_text/trait.InputTextIndex.html b/rust/sudachi/input_text/trait.InputTextIndex.html index 6cd7868f..2fb0e361 100644 --- a/rust/sudachi/input_text/trait.InputTextIndex.html +++ b/rust/sudachi/input_text/trait.InputTextIndex.html @@ -1,21 +1,21 @@ -InputTextIndex in sudachi::input_text - Rust
pub trait InputTextIndex {
+InputTextIndex in sudachi::input_text - Rust
pub trait InputTextIndex {
     // Required methods
-    fn cat_of_range(&self, range: Range<usize>) -> CategoryType;
-    fn cat_at_char(&self, offset: usize) -> CategoryType;
-    fn cat_continuous_len(&self, offset: usize) -> usize;
-    fn char_distance(&self, index: usize, offset: usize) -> usize;
-    fn orig_slice(&self, range: Range<usize>) -> &str;
-    fn curr_slice(&self, range: Range<usize>) -> &str;
-    fn to_orig(&self, range: Range<usize>) -> Range<usize>;
+    fn cat_of_range(&self, range: Range<usize>) -> CategoryType;
+    fn cat_at_char(&self, offset: usize) -> CategoryType;
+    fn cat_continuous_len(&self, offset: usize) -> usize;
+    fn char_distance(&self, index: usize, offset: usize) -> usize;
+    fn orig_slice(&self, range: Range<usize>) -> &str;
+    fn curr_slice(&self, range: Range<usize>) -> &str;
+    fn to_orig(&self, range: Range<usize>) -> Range<usize>;
 }
Expand description

Provides fast indexed access into the input text

-

Required Methods§

source

fn cat_of_range(&self, range: Range<usize>) -> CategoryType

Common character category inside the range. Indexed by chars.

-
source

fn cat_at_char(&self, offset: usize) -> CategoryType

Character category at char offset

-
source

fn cat_continuous_len(&self, offset: usize) -> usize

Number of chars to the right of the offset with the same character category

+

Required Methods§

source

fn cat_of_range(&self, range: Range<usize>) -> CategoryType

Common character category inside the range. Indexed by chars.

+
source

fn cat_at_char(&self, offset: usize) -> CategoryType

Character category at char offset

+
source

fn cat_continuous_len(&self, offset: usize) -> usize

Number of chars to the right of the offset with the same character category

Java name: getCharCategoryContinuousLength

-
source

fn char_distance(&self, index: usize, offset: usize) -> usize

Distance in chars between the char indexed by index +

source

fn char_distance(&self, index: usize, offset: usize) -> usize

Distance in chars between the char indexed by index and the char, relative to it by offset. Java name: getCodePointsOffsetLength

-
source

fn orig_slice(&self, range: Range<usize>) -> &str

Returns substring of original text by indices from the current text

-
source

fn curr_slice(&self, range: Range<usize>) -> &str

Returns substring of the current (modified) text by indices from the current text

-
source

fn to_orig(&self, range: Range<usize>) -> Range<usize>

Translate range from current state to original. Byte-indexed.

-

Implementors§

\ No newline at end of file +
source

fn orig_slice(&self, range: Range<usize>) -> &str

Returns substring of original text by indices from the current text

+
source

fn curr_slice(&self, range: Range<usize>) -> &str

Returns substring of the current (modified) text by indices from the current text

+
source

fn to_orig(&self, range: Range<usize>) -> Range<usize>

Translate range from current state to original. Byte-indexed.

+

Implementors§

\ No newline at end of file diff --git a/rust/sudachi/macro.sudachi_dso_plugin.html b/rust/sudachi/macro.sudachi_dso_plugin.html index 318007e1..9a1d10c5 100644 --- a/rust/sudachi/macro.sudachi_dso_plugin.html +++ b/rust/sudachi/macro.sudachi_dso_plugin.html @@ -1,4 +1,4 @@ -sudachi_dso_plugin in sudachi - Rust
macro_rules! sudachi_dso_plugin {
+sudachi_dso_plugin in sudachi - Rust
macro_rules! sudachi_dso_plugin {
     ($plugin_type:ty, $impl_type:ty) => { ... };
 }
Expand description

Create an entry point into sudachi DSO plugin

\ No newline at end of file diff --git a/rust/sudachi/plugin/connect_cost/index.html b/rust/sudachi/plugin/connect_cost/index.html index d36fdcd6..018507b4 100644 --- a/rust/sudachi/plugin/connect_cost/index.html +++ b/rust/sudachi/plugin/connect_cost/index.html @@ -1 +1 @@ -sudachi::plugin::connect_cost - Rust

Traits

\ No newline at end of file +sudachi::plugin::connect_cost - Rust

Traits

\ No newline at end of file diff --git a/rust/sudachi/plugin/connect_cost/trait.EditConnectionCostPlugin.html b/rust/sudachi/plugin/connect_cost/trait.EditConnectionCostPlugin.html index 98795e7c..99767280 100644 --- a/rust/sudachi/plugin/connect_cost/trait.EditConnectionCostPlugin.html +++ b/rust/sudachi/plugin/connect_cost/trait.EditConnectionCostPlugin.html @@ -1,11 +1,11 @@ -EditConnectionCostPlugin in sudachi::plugin::connect_cost - Rust
pub trait EditConnectionCostPlugin: Sync + Send {
+EditConnectionCostPlugin in sudachi::plugin::connect_cost - Rust
pub trait EditConnectionCostPlugin: Sync + Send {
     // Required methods
     fn set_up(
         &mut self,
         settings: &Value,
         config: &Config,
         grammar: &Grammar<'_>
-    ) -> SudachiResult<()>;
+    ) -> SudachiResult<()>;
     fn edit(&self, grammar: &mut Grammar<'_>);
 }
Expand description

Trait of plugin to edit connection cost in the grammar

Required Methods§

source

fn set_up( @@ -13,16 +13,16 @@ settings: &Value, config: &Config, grammar: &Grammar<'_> -) -> SudachiResult<()>

Loads necessary information for the plugin

+) -> SudachiResult<()>

Loads necessary information for the plugin

source

fn edit(&self, grammar: &mut Grammar<'_>)

Edits the grammar

-

Trait Implementations§

source§

impl PluginCategory for dyn EditConnectionCostPlugin

§

type BoxType = Box<dyn EditConnectionCostPlugin + Sync + Send, Global>

Boxed type of the plugin. Should be Box.
§

type InitFnType = unsafe fn() -> Result<<dyn EditConnectionCostPlugin as PluginCategory>::BoxType, SudachiError>

Type of the initialization function. -It must take 0 arguments and return SudachiResult<Self::BoxType>.
source§

fn configurations(cfg: &Config) -> &[Value]

Extract plugin configurations from the config
source§

fn bundled_impl(name: &str) -> Option<Self::BoxType>

Create bundled plugin for plugin name +

Trait Implementations§

source§

impl PluginCategory for dyn EditConnectionCostPlugin

§

type BoxType = Box<dyn EditConnectionCostPlugin + Send + Sync>

Boxed type of the plugin. Should be Box.
§

type InitFnType = unsafe fn() -> Result<<dyn EditConnectionCostPlugin as PluginCategory>::BoxType, SudachiError>

Type of the initialization function. +It must take 0 arguments and return SudachiResult<Self::BoxType>.
source§

fn configurations(cfg: &Config) -> &[Value]

Extract plugin configurations from the config
source§

fn bundled_impl(name: &str) -> Option<Self::BoxType>

Create bundled plugin for plugin name Instead of full name like com.worksap.nlp.sudachi.ProlongedSoundMarkPlugin should handle only the short one: ProlongedSoundMarkPlugin Read more
source§

fn do_setup( ptr: &mut Self::BoxType, settings: &Value, config: &Config, grammar: &mut Grammar<'_> -) -> SudachiResult<()>

Perform initial setup. +) -> SudachiResult<()>
Perform initial setup. We can’t call set_up of the plugin directly in the default implementation -of this method because we do not know the specific type yet

Implementors§

\ No newline at end of file +of this method because we do not know the specific type yet

Implementors§

\ No newline at end of file diff --git a/rust/sudachi/plugin/dso/index.html b/rust/sudachi/plugin/dso/index.html index 5a75bcdb..24c06527 100644 --- a/rust/sudachi/plugin/dso/index.html +++ b/rust/sudachi/plugin/dso/index.html @@ -1 +1 @@ -sudachi::plugin::dso - Rust

Module sudachi::plugin::dso

source ·
\ No newline at end of file +sudachi::plugin::dso - Rust

Module sudachi::plugin::dso

source ·
\ No newline at end of file diff --git a/rust/sudachi/plugin/enum.PluginError.html b/rust/sudachi/plugin/enum.PluginError.html index 17bcaac7..6ca6135e 100644 --- a/rust/sudachi/plugin/enum.PluginError.html +++ b/rust/sudachi/plugin/enum.PluginError.html @@ -1,20 +1,20 @@ -PluginError in sudachi::plugin - Rust
pub enum PluginError {
-    Io(Error),
+PluginError in sudachi::plugin - Rust
pub enum PluginError {
+    Io(Error),
     Libloading {
         source: Error,
-        message: String,
+        message: String,
     },
     SerdeError(Error),
-    InvalidDataFormat(String),
-}

Variants§

§

Io(Error)

§

Libloading

Fields

§source: Error
§message: String
§

SerdeError(Error)

§

InvalidDataFormat(String)

Trait Implementations§

source§

impl Debug for PluginError

source§

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

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

impl Display for PluginError

source§

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

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

impl Error for PluginError

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()
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, request: &mut Request<'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<Error> for PluginError

source§

fn from(source: Error) -> Self

Converts to this type from the input type.
source§

impl From<Error> for PluginError

source§

fn from(e: LLError) -> Self

Converts to this type from the input type.
source§

impl From<Error> for PluginError

source§

fn from(source: Error) -> Self

Converts to this type from the input type.
source§

impl From<PluginError> for SudachiError

source§

fn from(source: PluginError) -> 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,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

source§

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

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

-
source§

impl<T, U> Into<U> for Twhere - U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

+ InvalidDataFormat(String), +}

Variants§

§

Io(Error)

§

Libloading

Fields

§source: Error
§message: String
§

SerdeError(Error)

§

InvalidDataFormat(String)

Trait Implementations§

source§

impl Debug for PluginError

source§

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

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

impl Display for PluginError

source§

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

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

impl Error for PluginError

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()
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, request: &mut Request<'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<Error> for PluginError

source§

fn from(source: Error) -> Self

Converts to this type from the input type.
source§

impl From<Error> for PluginError

source§

fn from(e: LLError) -> Self

Converts to this type from the input type.
source§

impl From<Error> for PluginError

source§

fn from(source: Error) -> Self

Converts to this type from the input type.
source§

impl From<PluginError> for SudachiError

source§

fn from(source: PluginError) -> 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,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

source§

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

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

+
source§

impl<T, U> Into<U> for Twhere + U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of -From<T> for U chooses to do.

-
source§

impl<T> ToString for Twhere - T: Display + ?Sized,

source§

default fn to_string(&self) -> String

Converts the given value to a String. Read more
source§

impl<T, U> TryFrom<U> for Twhere - U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
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.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
\ No newline at end of file +From<T> for U chooses to do.

+
source§

impl<T> ToString for Twhere + T: Display + ?Sized,

source§

default fn to_string(&self) -> String

Converts the given value to a String. Read more
source§

impl<T, U> TryFrom<U> for Twhere + U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
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.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
\ No newline at end of file diff --git a/rust/sudachi/plugin/index.html b/rust/sudachi/plugin/index.html index d840fc5b..b180cf9d 100644 --- a/rust/sudachi/plugin/index.html +++ b/rust/sudachi/plugin/index.html @@ -1 +1 @@ -sudachi::plugin - Rust
\ No newline at end of file +sudachi::plugin - Rust
\ No newline at end of file diff --git a/rust/sudachi/plugin/input_text/default_input_text/index.html b/rust/sudachi/plugin/input_text/default_input_text/index.html index 7433f1e0..625b2710 100644 --- a/rust/sudachi/plugin/input_text/default_input_text/index.html +++ b/rust/sudachi/plugin/input_text/default_input_text/index.html @@ -1 +1 @@ -sudachi::plugin::input_text::default_input_text - Rust

Structs

\ No newline at end of file +sudachi::plugin::input_text::default_input_text - Rust

Structs

\ No newline at end of file diff --git a/rust/sudachi/plugin/input_text/default_input_text/struct.DefaultInputTextPlugin.html b/rust/sudachi/plugin/input_text/default_input_text/struct.DefaultInputTextPlugin.html index 580f65ac..d1f2c538 100644 --- a/rust/sudachi/plugin/input_text/default_input_text/struct.DefaultInputTextPlugin.html +++ b/rust/sudachi/plugin/input_text/default_input_text/struct.DefaultInputTextPlugin.html @@ -1,21 +1,21 @@ -DefaultInputTextPlugin in sudachi::plugin::input_text::default_input_text - Rust
pub struct DefaultInputTextPlugin { /* private fields */ }
Expand description

Provides basic normalization of the input text

-

Trait Implementations§

source§

impl Default for DefaultInputTextPlugin

source§

fn default() -> DefaultInputTextPlugin

Returns the “default value” for a type. Read more
source§

impl InputTextPlugin for DefaultInputTextPlugin

source§

fn set_up( +DefaultInputTextPlugin in sudachi::plugin::input_text::default_input_text - Rust
pub struct DefaultInputTextPlugin { /* private fields */ }
Expand description

Provides basic normalization of the input text

+

Trait Implementations§

source§

impl Default for DefaultInputTextPlugin

source§

fn default() -> DefaultInputTextPlugin

Returns the “default value” for a type. Read more
source§

impl InputTextPlugin for DefaultInputTextPlugin

source§

fn set_up( &mut self, settings: &Value, config: &Config, _grammar: &Grammar<'_> -) -> SudachiResult<()>

Loads necessary information for the plugin
source§

fn uses_chars(&self) -> bool

Whether the rewrite process uses chars
source§

fn rewrite_impl<'a>( +) -> SudachiResult<()>

Loads necessary information for the plugin
source§

fn uses_chars(&self) -> bool

Whether the rewrite process uses chars
source§

fn rewrite_impl<'a>( &'a self, buffer: &InputBuffer, edit: InputEditor<'a> -) -> SudachiResult<InputEditor<'a>>

👎Deprecated: call rewrite instead
Actual implementation of rewriting. Call apply_rewrite instead.
source§

fn rewrite(&self, input: &mut InputBuffer) -> SudachiResult<()>

Perform rewrites

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,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

source§

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

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

-
source§

impl<T, U> Into<U> for Twhere - U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

+) -> SudachiResult<InputEditor<'a>>

👎Deprecated: call rewrite instead
Actual implementation of rewriting. Call apply_rewrite instead.
source§

fn rewrite(&self, input: &mut InputBuffer) -> SudachiResult<()>

Perform rewrites

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,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

source§

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

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

+
source§

impl<T, U> Into<U> for Twhere + U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of -From<T> for U chooses to do.

-
source§

impl<T, U> TryFrom<U> for Twhere - U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
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.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
\ No newline at end of file +From<T> for U chooses to do.

+
source§

impl<T, U> TryFrom<U> for Twhere + U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
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.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
\ No newline at end of file diff --git a/rust/sudachi/plugin/input_text/index.html b/rust/sudachi/plugin/input_text/index.html index 365e3c0e..adfebcf0 100644 --- a/rust/sudachi/plugin/input_text/index.html +++ b/rust/sudachi/plugin/input_text/index.html @@ -1 +1 @@ -sudachi::plugin::input_text - Rust

Module sudachi::plugin::input_text

source ·

Modules

Traits

  • Trait of plugin to modify the input text before tokenization
\ No newline at end of file +sudachi::plugin::input_text - Rust

Module sudachi::plugin::input_text

source ·

Modules

Traits

  • Trait of plugin to modify the input text before tokenization
\ No newline at end of file diff --git a/rust/sudachi/plugin/input_text/trait.InputTextPlugin.html b/rust/sudachi/plugin/input_text/trait.InputTextPlugin.html index ce5c4867..17adbd5d 100644 --- a/rust/sudachi/plugin/input_text/trait.InputTextPlugin.html +++ b/rust/sudachi/plugin/input_text/trait.InputTextPlugin.html @@ -1,11 +1,11 @@ -InputTextPlugin in sudachi::plugin::input_text - Rust
pub trait InputTextPlugin: Sync + Send {
+InputTextPlugin in sudachi::plugin::input_text - Rust
pub trait InputTextPlugin: Sync + Send {
     // Required methods
     fn set_up(
         &mut self,
         settings: &Value,
         config: &Config,
         grammar: &Grammar<'_>
-    ) -> SudachiResult<()>;
+    ) -> SudachiResult<()>;
     fn rewrite_impl<'a>(
         &'a self,
         input: &InputBuffer,
@@ -13,30 +13,30 @@
     ) -> SudachiResult<InputEditor<'a>>;
 
     // Provided methods
-    fn uses_chars(&self) -> bool { ... }
-    fn rewrite(&self, input: &mut InputBuffer) -> SudachiResult<()> { ... }
+    fn uses_chars(&self) -> bool { ... }
+    fn rewrite(&self, input: &mut InputBuffer) -> SudachiResult<()> { ... }
 }
Expand description

Trait of plugin to modify the input text before tokenization

Required Methods§

source

fn set_up( &mut self, settings: &Value, config: &Config, grammar: &Grammar<'_> -) -> SudachiResult<()>

Loads necessary information for the plugin

+) -> SudachiResult<()>

Loads necessary information for the plugin

source

fn rewrite_impl<'a>( &'a self, input: &InputBuffer, edit: InputEditor<'a> ) -> SudachiResult<InputEditor<'a>>

👎Deprecated: call rewrite instead

Actual implementation of rewriting. Call apply_rewrite instead.

-

Provided Methods§

source

fn uses_chars(&self) -> bool

Whether the rewrite process uses chars

-
source

fn rewrite(&self, input: &mut InputBuffer) -> SudachiResult<()>

Perform rewrites

-

Trait Implementations§

source§

impl PluginCategory for dyn InputTextPlugin

§

type BoxType = Box<dyn InputTextPlugin + Sync + Send, Global>

Boxed type of the plugin. Should be Box.
§

type InitFnType = unsafe fn() -> Result<<dyn InputTextPlugin as PluginCategory>::BoxType, SudachiError>

Type of the initialization function. -It must take 0 arguments and return SudachiResult<Self::BoxType>.
source§

fn configurations(cfg: &Config) -> &[Value]

Extract plugin configurations from the config
source§

fn bundled_impl(name: &str) -> Option<Self::BoxType>

Create bundled plugin for plugin name +

Provided Methods§

source

fn uses_chars(&self) -> bool

Whether the rewrite process uses chars

+
source

fn rewrite(&self, input: &mut InputBuffer) -> SudachiResult<()>

Perform rewrites

+

Trait Implementations§

source§

impl PluginCategory for dyn InputTextPlugin

§

type BoxType = Box<dyn InputTextPlugin + Send + Sync>

Boxed type of the plugin. Should be Box.
§

type InitFnType = unsafe fn() -> Result<<dyn InputTextPlugin as PluginCategory>::BoxType, SudachiError>

Type of the initialization function. +It must take 0 arguments and return SudachiResult<Self::BoxType>.
source§

fn configurations(cfg: &Config) -> &[Value]

Extract plugin configurations from the config
source§

fn bundled_impl(name: &str) -> Option<Self::BoxType>

Create bundled plugin for plugin name Instead of full name like com.worksap.nlp.sudachi.ProlongedSoundMarkPlugin should handle only the short one: ProlongedSoundMarkPlugin Read more
source§

fn do_setup( ptr: &mut Self::BoxType, settings: &Value, config: &Config, grammar: &mut Grammar<'_> -) -> SudachiResult<()>

Perform initial setup. +) -> SudachiResult<()>
Perform initial setup. We can’t call set_up of the plugin directly in the default implementation -of this method because we do not know the specific type yet

Implementors§

\ No newline at end of file +of this method because we do not know the specific type yet

Implementors§

\ No newline at end of file diff --git a/rust/sudachi/plugin/oov/index.html b/rust/sudachi/plugin/oov/index.html index 81e72d8f..b5a1d338 100644 --- a/rust/sudachi/plugin/oov/index.html +++ b/rust/sudachi/plugin/oov/index.html @@ -1 +1 @@ -sudachi::plugin::oov - Rust

Module sudachi::plugin::oov

source ·

Modules

Traits

\ No newline at end of file +sudachi::plugin::oov - Rust

Module sudachi::plugin::oov

source ·

Modules

Traits

\ No newline at end of file diff --git a/rust/sudachi/plugin/oov/mecab_oov/index.html b/rust/sudachi/plugin/oov/mecab_oov/index.html index b374fc2c..bca44306 100644 --- a/rust/sudachi/plugin/oov/mecab_oov/index.html +++ b/rust/sudachi/plugin/oov/mecab_oov/index.html @@ -1 +1 @@ -sudachi::plugin::oov::mecab_oov - Rust

Module sudachi::plugin::oov::mecab_oov

source ·

Structs

\ No newline at end of file +sudachi::plugin::oov::mecab_oov - Rust

Module sudachi::plugin::oov::mecab_oov

source ·

Structs

\ No newline at end of file diff --git a/rust/sudachi/plugin/oov/mecab_oov/struct.MeCabOovPlugin.html b/rust/sudachi/plugin/oov/mecab_oov/struct.MeCabOovPlugin.html index da6eaecf..87a6eafc 100644 --- a/rust/sudachi/plugin/oov/mecab_oov/struct.MeCabOovPlugin.html +++ b/rust/sudachi/plugin/oov/mecab_oov/struct.MeCabOovPlugin.html @@ -1,24 +1,24 @@ -MeCabOovPlugin in sudachi::plugin::oov::mecab_oov - Rust
pub struct MeCabOovPlugin { /* private fields */ }
Expand description

provides MeCab oov nodes

-

Trait Implementations§

source§

impl Default for MeCabOovPlugin

source§

fn default() -> MeCabOovPlugin

Returns the “default value” for a type. Read more
source§

impl OovProviderPlugin for MeCabOovPlugin

source§

fn set_up( +MeCabOovPlugin in sudachi::plugin::oov::mecab_oov - Rust
pub struct MeCabOovPlugin { /* private fields */ }
Expand description

provides MeCab oov nodes

+

Trait Implementations§

source§

impl Default for MeCabOovPlugin

source§

fn default() -> MeCabOovPlugin

Returns the “default value” for a type. Read more
source§

impl OovProviderPlugin for MeCabOovPlugin

source§

fn set_up( &mut self, settings: &Value, config: &Config, grammar: &mut Grammar<'_> -) -> SudachiResult<()>

Loads necessary information for the plugin
source§

fn provide_oov( +) -> SudachiResult<()>

Loads necessary information for the plugin
source§

fn provide_oov( &self, input_text: &InputBuffer, - offset: usize, + offset: usize, other_words: CreatedWords, - result: &mut Vec<Node> -) -> SudachiResult<usize>

Generate a list of oov nodes -offset - char idx

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,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

source§

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

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

-
source§

impl<T, U> Into<U> for Twhere - U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

+ result: &mut Vec<Node> +) -> SudachiResult<usize>

Generate a list of oov nodes +offset - char idx

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,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

source§

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

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

+
source§

impl<T, U> Into<U> for Twhere + U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of -From<T> for U chooses to do.

-
source§

impl<T, U> TryFrom<U> for Twhere - U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
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.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
\ No newline at end of file +From<T> for U chooses to do.

+
source§

impl<T, U> TryFrom<U> for Twhere + U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
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.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
\ No newline at end of file diff --git a/rust/sudachi/plugin/oov/regex_oov/enum.BoundaryMode.html b/rust/sudachi/plugin/oov/regex_oov/enum.BoundaryMode.html index dee841e9..162a5704 100644 --- a/rust/sudachi/plugin/oov/regex_oov/enum.BoundaryMode.html +++ b/rust/sudachi/plugin/oov/regex_oov/enum.BoundaryMode.html @@ -1,23 +1,23 @@ -BoundaryMode in sudachi::plugin::oov::regex_oov - Rust
pub enum BoundaryMode {
+BoundaryMode in sudachi::plugin::oov::regex_oov - Rust
pub enum BoundaryMode {
     Strict,
     Relaxed,
-}

Variants§

§

Strict

§

Relaxed

Trait Implementations§

source§

impl Clone for BoundaryMode

source§

fn clone(&self) -> BoundaryMode

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 BoundaryMode

source§

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

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

impl Default for BoundaryMode

source§

fn default() -> Self

Returns the “default value” for a type. Read more
source§

impl<'de> Deserialize<'de> for BoundaryMode

source§

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where - __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer. Read more
source§

impl PartialEq<BoundaryMode> for BoundaryMode

source§

fn eq(&self, other: &BoundaryMode) -> 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 Copy for BoundaryMode

source§

impl Eq for BoundaryMode

source§

impl StructuralEq for BoundaryMode

source§

impl StructuralPartialEq for BoundaryMode

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,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

source§

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

Mutably borrows from an owned value. Read more
§

impl<Q, K> Equivalent<K> for Qwhere - Q: Eq + ?Sized, - K: Borrow<Q> + ?Sized,

§

fn equivalent(&self, key: &K) -> bool

Checks if this value is equivalent to the given key. Read more
§

impl<Q, K> Equivalent<K> for Qwhere - Q: Eq + ?Sized, - K: Borrow<Q> + ?Sized,

§

fn equivalent(&self, key: &K) -> bool

Compare self to key and return true if they are equal.
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

-
source§

impl<T, U> Into<U> for Twhere - U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

+}

Variants§

§

Strict

§

Relaxed

Trait Implementations§

source§

impl Clone for BoundaryMode

source§

fn clone(&self) -> BoundaryMode

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 BoundaryMode

source§

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

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

impl Default for BoundaryMode

source§

fn default() -> Self

Returns the “default value” for a type. Read more
source§

impl<'de> Deserialize<'de> for BoundaryMode

source§

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where + __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer. Read more
source§

impl PartialEq for BoundaryMode

source§

fn eq(&self, other: &BoundaryMode) -> 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 Copy for BoundaryMode

source§

impl Eq for BoundaryMode

source§

impl StructuralEq for BoundaryMode

source§

impl StructuralPartialEq for BoundaryMode

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,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

source§

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

Mutably borrows from an owned value. Read more
§

impl<Q, K> Equivalent<K> for Qwhere + Q: Eq + ?Sized, + K: Borrow<Q> + ?Sized,

§

fn equivalent(&self, key: &K) -> bool

Checks if this value is equivalent to the given key. Read more
§

impl<Q, K> Equivalent<K> for Qwhere + Q: Eq + ?Sized, + K: Borrow<Q> + ?Sized,

§

fn equivalent(&self, key: &K) -> bool

Compare self to key and return true if they are equal.
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

+
source§

impl<T, U> Into<U> for Twhere + U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of -From<T> for U chooses to do.

-
source§

impl<T> ToOwned for Twhere - T: Clone,

§

type Owned = T

The resulting type after obtaining ownership.
source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
source§

impl<T, U> TryFrom<U> for Twhere - U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
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.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
source§

impl<T> DeserializeOwned for Twhere +From<T> for U chooses to do.

+

source§

impl<T> ToOwned for Twhere + T: Clone,

§

type Owned = T

The resulting type after obtaining ownership.
source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
source§

impl<T, U> TryFrom<U> for Twhere + U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
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.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
source§

impl<T> DeserializeOwned for Twhere T: for<'de> Deserialize<'de>,

\ No newline at end of file diff --git a/rust/sudachi/plugin/oov/regex_oov/index.html b/rust/sudachi/plugin/oov/regex_oov/index.html index c030d56b..2af39f5e 100644 --- a/rust/sudachi/plugin/oov/regex_oov/index.html +++ b/rust/sudachi/plugin/oov/regex_oov/index.html @@ -1 +1 @@ -sudachi::plugin::oov::regex_oov - Rust
\ No newline at end of file +sudachi::plugin::oov::regex_oov - Rust
\ No newline at end of file diff --git a/rust/sudachi/plugin/oov/simple_oov/index.html b/rust/sudachi/plugin/oov/simple_oov/index.html index 87aeeb49..57aab57c 100644 --- a/rust/sudachi/plugin/oov/simple_oov/index.html +++ b/rust/sudachi/plugin/oov/simple_oov/index.html @@ -1 +1 @@ -sudachi::plugin::oov::simple_oov - Rust

Module sudachi::plugin::oov::simple_oov

source ·

Structs

  • Provides a OOV node with single character if no words found in the dictionary
\ No newline at end of file +sudachi::plugin::oov::simple_oov - Rust

Module sudachi::plugin::oov::simple_oov

source ·

Structs

  • Provides a OOV node with single character if no words found in the dictionary
\ No newline at end of file diff --git a/rust/sudachi/plugin/oov/simple_oov/struct.SimpleOovPlugin.html b/rust/sudachi/plugin/oov/simple_oov/struct.SimpleOovPlugin.html index 64fedb32..c6293103 100644 --- a/rust/sudachi/plugin/oov/simple_oov/struct.SimpleOovPlugin.html +++ b/rust/sudachi/plugin/oov/simple_oov/struct.SimpleOovPlugin.html @@ -1,24 +1,24 @@ -SimpleOovPlugin in sudachi::plugin::oov::simple_oov - Rust
pub struct SimpleOovPlugin { /* private fields */ }
Expand description

Provides a OOV node with single character if no words found in the dictionary

-

Trait Implementations§

source§

impl Default for SimpleOovPlugin

source§

fn default() -> SimpleOovPlugin

Returns the “default value” for a type. Read more
source§

impl OovProviderPlugin for SimpleOovPlugin

source§

fn set_up( +SimpleOovPlugin in sudachi::plugin::oov::simple_oov - Rust
pub struct SimpleOovPlugin { /* private fields */ }
Expand description

Provides a OOV node with single character if no words found in the dictionary

+

Trait Implementations§

source§

impl Default for SimpleOovPlugin

source§

fn default() -> SimpleOovPlugin

Returns the “default value” for a type. Read more
source§

impl OovProviderPlugin for SimpleOovPlugin

source§

fn set_up( &mut self, settings: &Value, _config: &Config, grammar: &mut Grammar<'_> -) -> SudachiResult<()>

Loads necessary information for the plugin
source§

fn provide_oov( +) -> SudachiResult<()>

Loads necessary information for the plugin
source§

fn provide_oov( &self, input_text: &InputBuffer, - offset: usize, + offset: usize, other_words: CreatedWords, - result: &mut Vec<Node> -) -> SudachiResult<usize>

Generate a list of oov nodes -offset - char idx

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,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

source§

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

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

-
source§

impl<T, U> Into<U> for Twhere - U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

+ result: &mut Vec<Node> +) -> SudachiResult<usize>

Generate a list of oov nodes +offset - char idx

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,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

source§

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

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

+
source§

impl<T, U> Into<U> for Twhere + U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of -From<T> for U chooses to do.

-
source§

impl<T, U> TryFrom<U> for Twhere - U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
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.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
\ No newline at end of file +From<T> for U chooses to do.

+
source§

impl<T, U> TryFrom<U> for Twhere + U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
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.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
\ No newline at end of file diff --git a/rust/sudachi/plugin/oov/trait.OovProviderPlugin.html b/rust/sudachi/plugin/oov/trait.OovProviderPlugin.html index ebb64a83..33cb3347 100644 --- a/rust/sudachi/plugin/oov/trait.OovProviderPlugin.html +++ b/rust/sudachi/plugin/oov/trait.OovProviderPlugin.html @@ -1,41 +1,41 @@ -OovProviderPlugin in sudachi::plugin::oov - Rust
pub trait OovProviderPlugin: Sync + Send {
+OovProviderPlugin in sudachi::plugin::oov - Rust
pub trait OovProviderPlugin: Sync + Send {
     // Required methods
     fn set_up(
         &mut self,
         settings: &Value,
         config: &Config,
         grammar: &mut Grammar<'_>
-    ) -> SudachiResult<()>;
+    ) -> SudachiResult<()>;
     fn provide_oov(
         &self,
         input_text: &InputBuffer,
-        offset: usize,
+        offset: usize,
         other_words: CreatedWords,
-        result: &mut Vec<Node>
-    ) -> SudachiResult<usize>;
+        result: &mut Vec<Node>
+    ) -> SudachiResult<usize>;
 }
Expand description

Trait of plugin to provide oov node during tokenization

Required Methods§

source

fn set_up( &mut self, settings: &Value, config: &Config, grammar: &mut Grammar<'_> -) -> SudachiResult<()>

Loads necessary information for the plugin

+) -> SudachiResult<()>

Loads necessary information for the plugin

source

fn provide_oov( &self, input_text: &InputBuffer, - offset: usize, + offset: usize, other_words: CreatedWords, - result: &mut Vec<Node> -) -> SudachiResult<usize>

Generate a list of oov nodes + result: &mut Vec<Node> +) -> SudachiResult<usize>

Generate a list of oov nodes offset - char idx

-

Trait Implementations§

source§

impl PluginCategory for dyn OovProviderPlugin

§

type BoxType = Box<dyn OovProviderPlugin + Sync + Send, Global>

Boxed type of the plugin. Should be Box.
§

type InitFnType = unsafe fn() -> Result<<dyn OovProviderPlugin as PluginCategory>::BoxType, SudachiError>

Type of the initialization function. -It must take 0 arguments and return SudachiResult<Self::BoxType>.
source§

fn configurations(cfg: &Config) -> &[Value]

Extract plugin configurations from the config
source§

fn bundled_impl(name: &str) -> Option<Self::BoxType>

Create bundled plugin for plugin name +

Trait Implementations§

source§

impl PluginCategory for dyn OovProviderPlugin

§

type BoxType = Box<dyn OovProviderPlugin + Send + Sync>

Boxed type of the plugin. Should be Box.
§

type InitFnType = unsafe fn() -> Result<<dyn OovProviderPlugin as PluginCategory>::BoxType, SudachiError>

Type of the initialization function. +It must take 0 arguments and return SudachiResult<Self::BoxType>.
source§

fn configurations(cfg: &Config) -> &[Value]

Extract plugin configurations from the config
source§

fn bundled_impl(name: &str) -> Option<Self::BoxType>

Create bundled plugin for plugin name Instead of full name like com.worksap.nlp.sudachi.ProlongedSoundMarkPlugin should handle only the short one: ProlongedSoundMarkPlugin Read more
source§

fn do_setup( ptr: &mut Self::BoxType, settings: &Value, config: &Config, grammar: &mut Grammar<'_> -) -> SudachiResult<()>

Perform initial setup. +) -> SudachiResult<()>
Perform initial setup. We can’t call set_up of the plugin directly in the default implementation -of this method because we do not know the specific type yet

Implementors§

\ No newline at end of file +of this method because we do not know the specific type yet

Implementors§

\ No newline at end of file diff --git a/rust/sudachi/plugin/path_rewrite/index.html b/rust/sudachi/plugin/path_rewrite/index.html index 2129e00a..ce39a469 100644 --- a/rust/sudachi/plugin/path_rewrite/index.html +++ b/rust/sudachi/plugin/path_rewrite/index.html @@ -1 +1 @@ -sudachi::plugin::path_rewrite - Rust

Modules

Traits

\ No newline at end of file +sudachi::plugin::path_rewrite - Rust

Modules

Traits

\ No newline at end of file diff --git a/rust/sudachi/plugin/path_rewrite/join_katakana_oov/index.html b/rust/sudachi/plugin/path_rewrite/join_katakana_oov/index.html index 9ee23011..156e2206 100644 --- a/rust/sudachi/plugin/path_rewrite/join_katakana_oov/index.html +++ b/rust/sudachi/plugin/path_rewrite/join_katakana_oov/index.html @@ -1 +1 @@ -sudachi::plugin::path_rewrite::join_katakana_oov - Rust

Structs

\ No newline at end of file +sudachi::plugin::path_rewrite::join_katakana_oov - Rust

Structs

\ No newline at end of file diff --git a/rust/sudachi/plugin/path_rewrite/join_katakana_oov/struct.JoinKatakanaOovPlugin.html b/rust/sudachi/plugin/path_rewrite/join_katakana_oov/struct.JoinKatakanaOovPlugin.html index fc2ee729..26a0d52a 100644 --- a/rust/sudachi/plugin/path_rewrite/join_katakana_oov/struct.JoinKatakanaOovPlugin.html +++ b/rust/sudachi/plugin/path_rewrite/join_katakana_oov/struct.JoinKatakanaOovPlugin.html @@ -1,22 +1,22 @@ -JoinKatakanaOovPlugin in sudachi::plugin::path_rewrite::join_katakana_oov - Rust
pub struct JoinKatakanaOovPlugin { /* private fields */ }
Expand description

Concatenates katakana oov nodes into one

-

Trait Implementations§

source§

impl Default for JoinKatakanaOovPlugin

source§

fn default() -> JoinKatakanaOovPlugin

Returns the “default value” for a type. Read more
source§

impl PathRewritePlugin for JoinKatakanaOovPlugin

source§

fn set_up( +JoinKatakanaOovPlugin in sudachi::plugin::path_rewrite::join_katakana_oov - Rust
pub struct JoinKatakanaOovPlugin { /* private fields */ }
Expand description

Concatenates katakana oov nodes into one

+

Trait Implementations§

source§

impl Default for JoinKatakanaOovPlugin

source§

fn default() -> JoinKatakanaOovPlugin

Returns the “default value” for a type. Read more
source§

impl PathRewritePlugin for JoinKatakanaOovPlugin

source§

fn set_up( &mut self, settings: &Value, _config: &Config, grammar: &Grammar<'_> -) -> SudachiResult<()>

Loads necessary information for the plugin
source§

fn rewrite( +) -> SudachiResult<()>

Loads necessary information for the plugin
source§

fn rewrite( &self, text: &InputBuffer, - path: Vec<ResultNode>, + path: Vec<ResultNode>, lattice: &Lattice -) -> SudachiResult<Vec<ResultNode>>

Returns a rewritten path

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,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

source§

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

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

-
source§

impl<T, U> Into<U> for Twhere - U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

+) -> SudachiResult<Vec<ResultNode>>

Returns a rewritten path

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,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

source§

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

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

+
source§

impl<T, U> Into<U> for Twhere + U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of -From<T> for U chooses to do.

-
source§

impl<T, U> TryFrom<U> for Twhere - U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
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.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
\ No newline at end of file +From<T> for U chooses to do.

+
source§

impl<T, U> TryFrom<U> for Twhere + U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
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.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
\ No newline at end of file diff --git a/rust/sudachi/plugin/path_rewrite/join_numeric/index.html b/rust/sudachi/plugin/path_rewrite/join_numeric/index.html index ee6753bd..8968b176 100644 --- a/rust/sudachi/plugin/path_rewrite/join_numeric/index.html +++ b/rust/sudachi/plugin/path_rewrite/join_numeric/index.html @@ -1 +1 @@ -sudachi::plugin::path_rewrite::join_numeric - Rust

Structs

\ No newline at end of file +sudachi::plugin::path_rewrite::join_numeric - Rust

Structs

\ No newline at end of file diff --git a/rust/sudachi/plugin/path_rewrite/join_numeric/struct.JoinNumericPlugin.html b/rust/sudachi/plugin/path_rewrite/join_numeric/struct.JoinNumericPlugin.html index e989f2fd..da74413a 100644 --- a/rust/sudachi/plugin/path_rewrite/join_numeric/struct.JoinNumericPlugin.html +++ b/rust/sudachi/plugin/path_rewrite/join_numeric/struct.JoinNumericPlugin.html @@ -1,22 +1,22 @@ -JoinNumericPlugin in sudachi::plugin::path_rewrite::join_numeric - Rust
pub struct JoinNumericPlugin { /* private fields */ }
Expand description

Concatenates numeric nodes as one

-

Trait Implementations§

source§

impl Default for JoinNumericPlugin

source§

fn default() -> JoinNumericPlugin

Returns the “default value” for a type. Read more
source§

impl PathRewritePlugin for JoinNumericPlugin

source§

fn set_up( +JoinNumericPlugin in sudachi::plugin::path_rewrite::join_numeric - Rust
pub struct JoinNumericPlugin { /* private fields */ }
Expand description

Concatenates numeric nodes as one

+

Trait Implementations§

source§

impl Default for JoinNumericPlugin

source§

fn default() -> JoinNumericPlugin

Returns the “default value” for a type. Read more
source§

impl PathRewritePlugin for JoinNumericPlugin

source§

fn set_up( &mut self, settings: &Value, _config: &Config, grammar: &Grammar<'_> -) -> SudachiResult<()>

Loads necessary information for the plugin
source§

fn rewrite( +) -> SudachiResult<()>

Loads necessary information for the plugin
source§

fn rewrite( &self, text: &InputBuffer, - path: Vec<ResultNode>, + path: Vec<ResultNode>, _lattice: &Lattice -) -> SudachiResult<Vec<ResultNode>>

Returns a rewritten path

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,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

source§

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

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

-
source§

impl<T, U> Into<U> for Twhere - U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

+) -> SudachiResult<Vec<ResultNode>>

Returns a rewritten path

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,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

source§

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

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

+
source§

impl<T, U> Into<U> for Twhere + U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of -From<T> for U chooses to do.

-
source§

impl<T, U> TryFrom<U> for Twhere - U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
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.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
\ No newline at end of file +From<T> for U chooses to do.

+
source§

impl<T, U> TryFrom<U> for Twhere + U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
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.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
\ No newline at end of file diff --git a/rust/sudachi/plugin/path_rewrite/trait.PathRewritePlugin.html b/rust/sudachi/plugin/path_rewrite/trait.PathRewritePlugin.html index b69a2ec8..083be9cd 100644 --- a/rust/sudachi/plugin/path_rewrite/trait.PathRewritePlugin.html +++ b/rust/sudachi/plugin/path_rewrite/trait.PathRewritePlugin.html @@ -1,38 +1,38 @@ -PathRewritePlugin in sudachi::plugin::path_rewrite - Rust
pub trait PathRewritePlugin: Sync + Send {
+PathRewritePlugin in sudachi::plugin::path_rewrite - Rust
pub trait PathRewritePlugin: Sync + Send {
     // Required methods
     fn set_up(
         &mut self,
         settings: &Value,
         config: &Config,
         grammar: &Grammar<'_>
-    ) -> SudachiResult<()>;
+    ) -> SudachiResult<()>;
     fn rewrite(
         &self,
         text: &InputBuffer,
-        path: Vec<ResultNode>,
+        path: Vec<ResultNode>,
         lattice: &Lattice
-    ) -> SudachiResult<Vec<ResultNode>>;
+    ) -> SudachiResult<Vec<ResultNode>>;
 }
Expand description

Trait of plugin to rewrite the path from lattice

Required Methods§

source

fn set_up( &mut self, settings: &Value, config: &Config, grammar: &Grammar<'_> -) -> SudachiResult<()>

Loads necessary information for the plugin

+) -> SudachiResult<()>

Loads necessary information for the plugin

source

fn rewrite( &self, text: &InputBuffer, - path: Vec<ResultNode>, + path: Vec<ResultNode>, lattice: &Lattice -) -> SudachiResult<Vec<ResultNode>>

Returns a rewritten path

-

Trait Implementations§

source§

impl PluginCategory for dyn PathRewritePlugin

§

type BoxType = Box<dyn PathRewritePlugin + Sync + Send, Global>

Boxed type of the plugin. Should be Box.
§

type InitFnType = unsafe fn() -> Result<<dyn PathRewritePlugin as PluginCategory>::BoxType, SudachiError>

Type of the initialization function. -It must take 0 arguments and return SudachiResult<Self::BoxType>.
source§

fn configurations(cfg: &Config) -> &[Value]

Extract plugin configurations from the config
source§

fn bundled_impl(name: &str) -> Option<Self::BoxType>

Create bundled plugin for plugin name +) -> SudachiResult<Vec<ResultNode>>

Returns a rewritten path

+

Trait Implementations§

source§

impl PluginCategory for dyn PathRewritePlugin

§

type BoxType = Box<dyn PathRewritePlugin + Send + Sync>

Boxed type of the plugin. Should be Box.
§

type InitFnType = unsafe fn() -> Result<<dyn PathRewritePlugin as PluginCategory>::BoxType, SudachiError>

Type of the initialization function. +It must take 0 arguments and return SudachiResult<Self::BoxType>.
source§

fn configurations(cfg: &Config) -> &[Value]

Extract plugin configurations from the config
source§

fn bundled_impl(name: &str) -> Option<Self::BoxType>

Create bundled plugin for plugin name Instead of full name like com.worksap.nlp.sudachi.ProlongedSoundMarkPlugin should handle only the short one: ProlongedSoundMarkPlugin Read more
source§

fn do_setup( ptr: &mut Self::BoxType, settings: &Value, config: &Config, grammar: &mut Grammar<'_> -) -> SudachiResult<()>

Perform initial setup. +) -> SudachiResult<()>
Perform initial setup. We can’t call set_up of the plugin directly in the default implementation -of this method because we do not know the specific type yet

Implementors§

\ No newline at end of file +of this method because we do not know the specific type yet

Implementors§

\ No newline at end of file diff --git a/rust/sudachi/plugin/trait.PluginCategory.html b/rust/sudachi/plugin/trait.PluginCategory.html index f0627725..73a46076 100644 --- a/rust/sudachi/plugin/trait.PluginCategory.html +++ b/rust/sudachi/plugin/trait.PluginCategory.html @@ -1,22 +1,22 @@ -PluginCategory in sudachi::plugin - Rust
pub trait PluginCategory {
+PluginCategory in sudachi::plugin - Rust
pub trait PluginCategory {
     type BoxType;
     type InitFnType;
 
     // Required methods
     fn configurations(cfg: &Config) -> &[Value];
-    fn bundled_impl(name: &str) -> Option<Self::BoxType>;
+    fn bundled_impl(name: &str) -> Option<Self::BoxType>;
     fn do_setup(
         ptr: &mut Self::BoxType,
         settings: &Value,
         config: &Config,
         grammar: &mut Grammar<'_>
-    ) -> SudachiResult<()>;
+    ) -> SudachiResult<()>;
 }
Expand description

A category of Plugins

Required Associated Types§

source

type BoxType

Boxed type of the plugin. Should be Box.

source

type InitFnType

Type of the initialization function. It must take 0 arguments and return SudachiResult<Self::BoxType>.

Required Methods§

source

fn configurations(cfg: &Config) -> &[Value]

Extract plugin configurations from the config

-
source

fn bundled_impl(name: &str) -> Option<Self::BoxType>

Create bundled plugin for plugin name +

source

fn bundled_impl(name: &str) -> Option<Self::BoxType>

Create bundled plugin for plugin name Instead of full name like com.worksap.nlp.sudachi.ProlongedSoundMarkPlugin should handle only the short one: ProlongedSoundMarkPlugin

com.worksap.nlp.sudachi. (last dot included) will be stripped automatically @@ -26,7 +26,7 @@ settings: &Value, config: &Config, grammar: &mut Grammar<'_> -) -> SudachiResult<()>

Perform initial setup. +) -> SudachiResult<()>

Perform initial setup. We can’t call set_up of the plugin directly in the default implementation of this method because we do not know the specific type yet

-

Implementors§

\ No newline at end of file +

Object Safety§

This trait is not object safe.

Implementors§

\ No newline at end of file diff --git a/rust/sudachi/pos/index.html b/rust/sudachi/pos/index.html index faa96a25..21d255c4 100644 --- a/rust/sudachi/pos/index.html +++ b/rust/sudachi/pos/index.html @@ -1 +1 @@ -sudachi::pos - Rust
\ No newline at end of file +sudachi::pos - Rust
\ No newline at end of file diff --git a/rust/sudachi/pos/struct.PosMatcher.html b/rust/sudachi/pos/struct.PosMatcher.html index 2dfe7f57..800612ae 100644 --- a/rust/sudachi/pos/struct.PosMatcher.html +++ b/rust/sudachi/pos/struct.PosMatcher.html @@ -1,12 +1,12 @@ -PosMatcher in sudachi::pos - Rust

Struct sudachi::pos::PosMatcher

source ·
pub struct PosMatcher { /* private fields */ }

Implementations§

source§

impl PosMatcher

source

pub fn new<I: IntoIterator<Item = u16>>(pos: I) -> Self

source

pub fn matches_id(&self, pos_id: u16) -> bool

source

pub fn num_entries(&self) -> usize

source

pub fn entries(&self) -> impl Iterator<Item = u16> + '_

source

pub fn union(&self, other: &PosMatcher) -> PosMatcher

source

pub fn intersection(&self, other: &PosMatcher) -> PosMatcher

source

pub fn difference(&self, other: &PosMatcher) -> PosMatcher

Trait Implementations§

source§

impl Clone for PosMatcher

source§

fn clone(&self) -> PosMatcher

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

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,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

source§

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

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

-
source§

impl<T, U> Into<U> for Twhere - U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

+PosMatcher in sudachi::pos - Rust

Struct sudachi::pos::PosMatcher

source ·
pub struct PosMatcher { /* private fields */ }

Implementations§

source§

impl PosMatcher

source

pub fn new<I: IntoIterator<Item = u16>>(pos: I) -> Self

source

pub fn matches_id(&self, pos_id: u16) -> bool

source

pub fn num_entries(&self) -> usize

source

pub fn entries(&self) -> impl Iterator<Item = u16> + '_

source

pub fn union(&self, other: &PosMatcher) -> PosMatcher

source

pub fn intersection(&self, other: &PosMatcher) -> PosMatcher

source

pub fn difference(&self, other: &PosMatcher) -> PosMatcher

Trait Implementations§

source§

impl Clone for PosMatcher

source§

fn clone(&self) -> PosMatcher

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

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,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

source§

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

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

+
source§

impl<T, U> Into<U> for Twhere + U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of -From<T> for U chooses to do.

-
source§

impl<T> ToOwned for Twhere - T: Clone,

§

type Owned = T

The resulting type after obtaining ownership.
source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
source§

impl<T, U> TryFrom<U> for Twhere - U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
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.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
\ No newline at end of file +From<T> for U chooses to do.

+
source§

impl<T> ToOwned for Twhere + T: Clone,

§

type Owned = T

The resulting type after obtaining ownership.
source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
source§

impl<T, U> TryFrom<U> for Twhere + U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
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.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
\ No newline at end of file diff --git a/rust/sudachi/prelude/index.html b/rust/sudachi/prelude/index.html index a2662865..4d3caa2e 100644 --- a/rust/sudachi/prelude/index.html +++ b/rust/sudachi/prelude/index.html @@ -1 +1 @@ -sudachi::prelude - Rust

Module sudachi::prelude

source ·

Re-exports

\ No newline at end of file +sudachi::prelude - Rust

Module sudachi::prelude

source ·

Re-exports

\ No newline at end of file diff --git a/rust/sudachi/sentence_detector/index.html b/rust/sudachi/sentence_detector/index.html index e604ba72..4206f34a 100644 --- a/rust/sudachi/sentence_detector/index.html +++ b/rust/sudachi/sentence_detector/index.html @@ -1 +1 @@ -sudachi::sentence_detector - Rust

Structs

\ No newline at end of file +sudachi::sentence_detector - Rust

Structs

\ No newline at end of file diff --git a/rust/sudachi/sentence_detector/struct.NonBreakChecker.html b/rust/sudachi/sentence_detector/struct.NonBreakChecker.html index 05fb0e69..0cb2b9e8 100644 --- a/rust/sudachi/sentence_detector/struct.NonBreakChecker.html +++ b/rust/sudachi/sentence_detector/struct.NonBreakChecker.html @@ -1,15 +1,15 @@ -NonBreakChecker in sudachi::sentence_detector - Rust
pub struct NonBreakChecker<'a> {
-    pub bos: usize,
+NonBreakChecker in sudachi::sentence_detector - Rust
pub struct NonBreakChecker<'a> {
+    pub bos: usize,
     /* private fields */
 }
Expand description

A checker for words that cross boundaries

-

Fields§

§bos: usize

Implementations§

source§

impl<'a> NonBreakChecker<'a>

source

pub fn new(lexicon: &'a LexiconSet<'a>) -> Self

Auto Trait Implementations§

§

impl<'a> RefUnwindSafe for NonBreakChecker<'a>

§

impl<'a> Send for NonBreakChecker<'a>

§

impl<'a> Sync for NonBreakChecker<'a>

§

impl<'a> Unpin for NonBreakChecker<'a>

§

impl<'a> UnwindSafe for NonBreakChecker<'a>

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,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

source§

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

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

-
source§

impl<T, U> Into<U> for Twhere - U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

+

Fields§

§bos: usize

Implementations§

source§

impl<'a> NonBreakChecker<'a>

source

pub fn new(lexicon: &'a LexiconSet<'a>) -> Self

Auto Trait Implementations§

§

impl<'a> RefUnwindSafe for NonBreakChecker<'a>

§

impl<'a> Send for NonBreakChecker<'a>

§

impl<'a> Sync for NonBreakChecker<'a>

§

impl<'a> Unpin for NonBreakChecker<'a>

§

impl<'a> UnwindSafe for NonBreakChecker<'a>

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,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

source§

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

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

+
source§

impl<T, U> Into<U> for Twhere + U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of -From<T> for U chooses to do.

-
source§

impl<T, U> TryFrom<U> for Twhere - U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
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.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
\ No newline at end of file +From<T> for U chooses to do.

+
source§

impl<T, U> TryFrom<U> for Twhere + U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
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.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
\ No newline at end of file diff --git a/rust/sudachi/sentence_detector/struct.SentenceDetector.html b/rust/sudachi/sentence_detector/struct.SentenceDetector.html index 7adf9b7a..f5c5ad46 100644 --- a/rust/sudachi/sentence_detector/struct.SentenceDetector.html +++ b/rust/sudachi/sentence_detector/struct.SentenceDetector.html @@ -1,9 +1,9 @@ -SentenceDetector in sudachi::sentence_detector - Rust
pub struct SentenceDetector { /* private fields */ }
Expand description

A sentence boundary detector

-

Implementations§

source§

impl SentenceDetector

source

pub fn new() -> Self

source

pub fn with_limit(limit: usize) -> Self

source

pub fn get_eos( +SentenceDetector in sudachi::sentence_detector - Rust
pub struct SentenceDetector { /* private fields */ }
Expand description

A sentence boundary detector

+

Implementations§

source§

impl SentenceDetector

source

pub fn new() -> Self

source

pub fn with_limit(limit: usize) -> Self

source

pub fn get_eos( &self, - input: &str, - checker: Option<&NonBreakChecker<'_>> -) -> SudachiResult<isize>

Returns the byte index of the detected end of the sentence.

+ input: &str, + checker: Option<&NonBreakChecker<'_>> +) -> SudachiResult<isize>

Returns the byte index of the detected end of the sentence.

If NonBreakChecker is given, it is used to determine if there is a word that crosses the detected boundary, and if so, the next boundary is returned.

@@ -13,14 +13,14 @@
Examples
let sd = sudachi::sentence_detector::SentenceDetector::new();
 assert_eq!(12, sd.get_eos("あいう。えお", None).unwrap());
 assert_eq!(-15, sd.get_eos("あいうえお", None).unwrap());
-

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,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

source§

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

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

-
source§

impl<T, U> Into<U> for Twhere - U: From<T>,

source§

fn into(self) -> U

Calls U::from(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,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

source§

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

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

+
source§

impl<T, U> Into<U> for Twhere + U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of -From<T> for U chooses to do.

-
source§

impl<T, U> TryFrom<U> for Twhere - U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
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.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
\ No newline at end of file +From<T> for U chooses to do.

+
source§

impl<T, U> TryFrom<U> for Twhere + U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
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.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
\ No newline at end of file diff --git a/rust/sudachi/sentence_splitter/index.html b/rust/sudachi/sentence_splitter/index.html index 5a00fe4b..28be02d1 100644 --- a/rust/sudachi/sentence_splitter/index.html +++ b/rust/sudachi/sentence_splitter/index.html @@ -1 +1 @@ -sudachi::sentence_splitter - Rust
\ No newline at end of file +sudachi::sentence_splitter - Rust
\ No newline at end of file diff --git a/rust/sudachi/sentence_splitter/struct.SentenceIter.html b/rust/sudachi/sentence_splitter/struct.SentenceIter.html index 8422e41e..091f3afa 100644 --- a/rust/sudachi/sentence_splitter/struct.SentenceIter.html +++ b/rust/sudachi/sentence_splitter/struct.SentenceIter.html @@ -1,594 +1,591 @@ -SentenceIter in sudachi::sentence_splitter - Rust
pub struct SentenceIter<'s, 'x> { /* private fields */ }

Trait Implementations§

source§

impl<'s, 'x> Iterator for SentenceIter<'s, 'x>

§

type Item = (Range<usize>, &'s str)

The type of the elements being iterated over.
source§

fn next(&mut self) -> Option<Self::Item>

Advances the iterator and returns the next value. Read more
source§

fn next_chunk<const N: usize>( +SentenceIter in sudachi::sentence_splitter - Rust
pub struct SentenceIter<'s, 'x> { /* private fields */ }

Trait Implementations§

source§

impl<'s, 'x> Iterator for SentenceIter<'s, 'x>

§

type Item = (Range<usize>, &'s str)

The type of the elements being iterated over.
source§

fn next(&mut self) -> Option<Self::Item>

Advances the iterator and returns the next value. Read more
source§

fn next_chunk<const N: usize>( &mut self -) -> Result<[Self::Item; N], IntoIter<Self::Item, N>>where - Self: Sized,

🔬This is a nightly-only experimental API. (iter_next_chunk)
Advances the iterator and returns an array containing the next N values. Read more
1.0.0 · source§

fn size_hint(&self) -> (usize, Option<usize>)

Returns the bounds on the remaining length of the iterator. Read more
1.0.0 · source§

fn count(self) -> usizewhere - Self: Sized,

Consumes the iterator, counting the number of iterations and returning it. Read more
1.0.0 · source§

fn last(self) -> Option<Self::Item>where - Self: Sized,

Consumes the iterator, returning the last element. Read more
source§

fn advance_by(&mut self, n: usize) -> Result<(), NonZeroUsize>

🔬This is a nightly-only experimental API. (iter_advance_by)
Advances the iterator by n elements. Read more
1.0.0 · source§

fn nth(&mut self, n: usize) -> Option<Self::Item>

Returns the nth element of the iterator. Read more
1.28.0 · source§

fn step_by(self, step: usize) -> StepBy<Self>where - Self: Sized,

Creates an iterator starting at the same point, but stepping by -the given amount at each iteration. Read more
1.0.0 · source§

fn chain<U>(self, other: U) -> Chain<Self, <U as IntoIterator>::IntoIter>where - Self: Sized, - U: IntoIterator<Item = Self::Item>,

Takes two iterators and creates a new iterator over both in sequence. Read more
1.0.0 · source§

fn zip<U>(self, other: U) -> Zip<Self, <U as IntoIterator>::IntoIter>where - Self: Sized, - U: IntoIterator,

‘Zips up’ two iterators into a single iterator of pairs. Read more
source§

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

🔬This is a nightly-only experimental API. (iter_intersperse)
Creates a new iterator which places an item generated by separator -between adjacent items of the original iterator. Read more
1.0.0 · source§

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

Takes a closure and creates an iterator which calls that closure on each -element. Read more
1.21.0 · source§

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

Calls a closure on each element of an iterator. Read more
1.0.0 · source§

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

Creates an iterator which uses a closure to determine if an element -should be yielded. Read more
1.0.0 · source§

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

Creates an iterator that both filters and maps. Read more
1.0.0 · source§

fn enumerate(self) -> Enumerate<Self>where - Self: Sized,

Creates an iterator which gives the current iteration count as well as -the next value. Read more
1.0.0 · source§

fn peekable(self) -> Peekable<Self>where - Self: Sized,

Creates an iterator which can use the peek and peek_mut methods +) -> Result<[Self::Item; N], IntoIter<Self::Item, N>>where + Self: Sized,

🔬This is a nightly-only experimental API. (iter_next_chunk)
Advances the iterator and returns an array containing the next N values. Read more
1.0.0 · source§

fn size_hint(&self) -> (usize, Option<usize>)

Returns the bounds on the remaining length of the iterator. Read more
1.0.0 · source§

fn count(self) -> usizewhere + Self: Sized,

Consumes the iterator, counting the number of iterations and returning it. Read more
1.0.0 · source§

fn last(self) -> Option<Self::Item>where + Self: Sized,

Consumes the iterator, returning the last element. Read more
source§

fn advance_by(&mut self, n: usize) -> Result<(), NonZeroUsize>

🔬This is a nightly-only experimental API. (iter_advance_by)
Advances the iterator by n elements. Read more
1.0.0 · source§

fn nth(&mut self, n: usize) -> Option<Self::Item>

Returns the nth element of the iterator. Read more
1.28.0 · source§

fn step_by(self, step: usize) -> StepBy<Self>where + Self: Sized,

Creates an iterator starting at the same point, but stepping by +the given amount at each iteration. Read more
1.0.0 · source§

fn chain<U>(self, other: U) -> Chain<Self, <U as IntoIterator>::IntoIter>where + Self: Sized, + U: IntoIterator<Item = Self::Item>,

Takes two iterators and creates a new iterator over both in sequence. Read more
1.0.0 · source§

fn zip<U>(self, other: U) -> Zip<Self, <U as IntoIterator>::IntoIter>where + Self: Sized, + U: IntoIterator,

‘Zips up’ two iterators into a single iterator of pairs. Read more
source§

fn intersperse_with<G>(self, separator: G) -> IntersperseWith<Self, G>where + Self: Sized, + G: FnMut() -> Self::Item,

🔬This is a nightly-only experimental API. (iter_intersperse)
Creates a new iterator which places an item generated by separator +between adjacent items of the original iterator. Read more
1.0.0 · source§

fn map<B, F>(self, f: F) -> Map<Self, F>where + Self: Sized, + F: FnMut(Self::Item) -> B,

Takes a closure and creates an iterator which calls that closure on each +element. Read more
1.21.0 · source§

fn for_each<F>(self, f: F)where + Self: Sized, + F: FnMut(Self::Item),

Calls a closure on each element of an iterator. Read more
1.0.0 · source§

fn filter<P>(self, predicate: P) -> Filter<Self, P>where + Self: Sized, + P: FnMut(&Self::Item) -> bool,

Creates an iterator which uses a closure to determine if an element +should be yielded. Read more
1.0.0 · source§

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F>where + Self: Sized, + F: FnMut(Self::Item) -> Option<B>,

Creates an iterator that both filters and maps. Read more
1.0.0 · source§

fn enumerate(self) -> Enumerate<Self>where + Self: Sized,

Creates an iterator which gives the current iteration count as well as +the next value. Read more
1.0.0 · source§

fn peekable(self) -> Peekable<Self>where + Self: Sized,

Creates an iterator which can use the peek and peek_mut methods to look at the next element of the iterator without consuming it. See -their documentation for more information. Read more
1.0.0 · source§

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

Creates an iterator that skips elements based on a predicate. Read more
1.0.0 · source§

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

Creates an iterator that yields elements based on a predicate. Read more
1.57.0 · source§

fn map_while<B, P>(self, predicate: P) -> MapWhile<Self, P>where - Self: Sized, - P: FnMut(Self::Item) -> Option<B>,

Creates an iterator that both yields elements based on a predicate and maps. Read more
1.0.0 · source§

fn skip(self, n: usize) -> Skip<Self>where - Self: Sized,

Creates an iterator that skips the first n elements. Read more
1.0.0 · source§

fn take(self, n: usize) -> Take<Self>where - Self: Sized,

Creates an iterator that yields the first n elements, or fewer -if the underlying iterator ends sooner. Read more
1.0.0 · source§

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F>where - Self: Sized, - F: FnMut(&mut St, Self::Item) -> Option<B>,

An iterator adapter which, like fold, holds internal state, but -unlike fold, produces a new iterator. Read more
1.0.0 · source§

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F>where - Self: Sized, - U: IntoIterator, - F: FnMut(Self::Item) -> U,

Creates an iterator that works like map, but flattens nested structure. Read more
source§

fn map_windows<F, R, const N: usize>(self, f: F) -> MapWindows<Self, F, N>where - Self: Sized, - F: FnMut(&[Self::Item; N]) -> R,

🔬This is a nightly-only experimental API. (iter_map_windows)
Calls the given function f for each contiguous window of size N over -self and returns an iterator over the outputs of f. Like slice::windows(), -the windows during mapping overlap as well. Read more
1.0.0 · source§

fn fuse(self) -> Fuse<Self>where - Self: Sized,

Creates an iterator which ends after the first None. Read more
1.0.0 · source§

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

Does something with each element of an iterator, passing the value on. Read more
1.0.0 · source§

fn by_ref(&mut self) -> &mut Selfwhere - Self: Sized,

Borrows an iterator, rather than consuming it. Read more
1.0.0 · source§

fn collect<B>(self) -> Bwhere - B: FromIterator<Self::Item>, - Self: Sized,

Transforms an iterator into a collection. Read more
source§

fn collect_into<E>(self, collection: &mut E) -> &mut Ewhere - E: Extend<Self::Item>, - Self: Sized,

🔬This is a nightly-only experimental API. (iter_collect_into)
Collects all the items from an iterator into a collection. Read more
1.0.0 · source§

fn partition<B, F>(self, f: F) -> (B, B)where - Self: Sized, - B: Default + Extend<Self::Item>, - F: FnMut(&Self::Item) -> bool,

Consumes an iterator, creating two collections from it. Read more
source§

fn is_partitioned<P>(self, predicate: P) -> boolwhere - Self: Sized, - P: FnMut(Self::Item) -> bool,

🔬This is a nightly-only experimental API. (iter_is_partitioned)
Checks if the elements of this iterator are partitioned according to the given predicate, -such that all those that return true precede all those that return false. Read more
1.27.0 · source§

fn try_fold<B, F, R>(&mut self, init: B, f: F) -> Rwhere - Self: Sized, - F: FnMut(B, Self::Item) -> R, - R: Try<Output = B>,

An iterator method that applies a function as long as it returns -successfully, producing a single, final value. Read more
1.27.0 · source§

fn try_for_each<F, R>(&mut self, f: F) -> Rwhere - Self: Sized, - F: FnMut(Self::Item) -> R, - R: Try<Output = ()>,

An iterator method that applies a fallible function to each item in the -iterator, stopping at the first error and returning that error. Read more
1.0.0 · source§

fn fold<B, F>(self, init: B, f: F) -> Bwhere - Self: Sized, - F: FnMut(B, Self::Item) -> B,

Folds every element into an accumulator by applying an operation, -returning the final result. Read more
1.51.0 · source§

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

Reduces the elements to a single one, by repeatedly applying a reducing -operation. Read more
source§

fn try_reduce<F, R>( +their documentation for more information. Read more

1.0.0 · source§

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P>where + Self: Sized, + P: FnMut(&Self::Item) -> bool,

Creates an iterator that skips elements based on a predicate. Read more
1.0.0 · source§

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P>where + Self: Sized, + P: FnMut(&Self::Item) -> bool,

Creates an iterator that yields elements based on a predicate. Read more
1.57.0 · source§

fn map_while<B, P>(self, predicate: P) -> MapWhile<Self, P>where + Self: Sized, + P: FnMut(Self::Item) -> Option<B>,

Creates an iterator that both yields elements based on a predicate and maps. Read more
1.0.0 · source§

fn skip(self, n: usize) -> Skip<Self>where + Self: Sized,

Creates an iterator that skips the first n elements. Read more
1.0.0 · source§

fn take(self, n: usize) -> Take<Self>where + Self: Sized,

Creates an iterator that yields the first n elements, or fewer +if the underlying iterator ends sooner. Read more
1.0.0 · source§

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F>where + Self: Sized, + F: FnMut(&mut St, Self::Item) -> Option<B>,

An iterator adapter which, like fold, holds internal state, but +unlike fold, produces a new iterator. Read more
1.0.0 · source§

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F>where + Self: Sized, + U: IntoIterator, + F: FnMut(Self::Item) -> U,

Creates an iterator that works like map, but flattens nested structure. Read more
source§

fn map_windows<F, R, const N: usize>(self, f: F) -> MapWindows<Self, F, N>where + Self: Sized, + F: FnMut(&[Self::Item; N]) -> R,

🔬This is a nightly-only experimental API. (iter_map_windows)
Calls the given function f for each contiguous window of size N over +self and returns an iterator over the outputs of f. Like slice::windows(), +the windows during mapping overlap as well. Read more
1.0.0 · source§

fn fuse(self) -> Fuse<Self>where + Self: Sized,

Creates an iterator which ends after the first None. Read more
1.0.0 · source§

fn inspect<F>(self, f: F) -> Inspect<Self, F>where + Self: Sized, + F: FnMut(&Self::Item),

Does something with each element of an iterator, passing the value on. Read more
1.0.0 · source§

fn by_ref(&mut self) -> &mut Selfwhere + Self: Sized,

Borrows an iterator, rather than consuming it. Read more
1.0.0 · source§

fn collect<B>(self) -> Bwhere + B: FromIterator<Self::Item>, + Self: Sized,

Transforms an iterator into a collection. Read more
source§

fn collect_into<E>(self, collection: &mut E) -> &mut Ewhere + E: Extend<Self::Item>, + Self: Sized,

🔬This is a nightly-only experimental API. (iter_collect_into)
Collects all the items from an iterator into a collection. Read more
1.0.0 · source§

fn partition<B, F>(self, f: F) -> (B, B)where + Self: Sized, + B: Default + Extend<Self::Item>, + F: FnMut(&Self::Item) -> bool,

Consumes an iterator, creating two collections from it. Read more
source§

fn is_partitioned<P>(self, predicate: P) -> boolwhere + Self: Sized, + P: FnMut(Self::Item) -> bool,

🔬This is a nightly-only experimental API. (iter_is_partitioned)
Checks if the elements of this iterator are partitioned according to the given predicate, +such that all those that return true precede all those that return false. Read more
1.27.0 · source§

fn try_fold<B, F, R>(&mut self, init: B, f: F) -> Rwhere + Self: Sized, + F: FnMut(B, Self::Item) -> R, + R: Try<Output = B>,

An iterator method that applies a function as long as it returns +successfully, producing a single, final value. Read more
1.27.0 · source§

fn try_for_each<F, R>(&mut self, f: F) -> Rwhere + Self: Sized, + F: FnMut(Self::Item) -> R, + R: Try<Output = ()>,

An iterator method that applies a fallible function to each item in the +iterator, stopping at the first error and returning that error. Read more
1.0.0 · source§

fn fold<B, F>(self, init: B, f: F) -> Bwhere + Self: Sized, + F: FnMut(B, Self::Item) -> B,

Folds every element into an accumulator by applying an operation, +returning the final result. Read more
1.51.0 · source§

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

Reduces the elements to a single one, by repeatedly applying a reducing +operation. Read more
source§

fn try_reduce<F, R>( &mut self, f: F -) -> <<R as Try>::Residual as Residual<Option<<R as Try>::Output>>>::TryTypewhere - Self: Sized, - F: FnMut(Self::Item, Self::Item) -> R, - R: Try<Output = Self::Item>, - <R as Try>::Residual: Residual<Option<Self::Item>>,

🔬This is a nightly-only experimental API. (iterator_try_reduce)
Reduces the elements to a single one by repeatedly applying a reducing operation. If the -closure returns a failure, the failure is propagated back to the caller immediately. Read more
1.0.0 · source§

fn all<F>(&mut self, f: F) -> boolwhere - Self: Sized, - F: FnMut(Self::Item) -> bool,

Tests if every element of the iterator matches a predicate. Read more
1.0.0 · source§

fn any<F>(&mut self, f: F) -> boolwhere - Self: Sized, - F: FnMut(Self::Item) -> bool,

Tests if any element of the iterator matches a predicate. Read more
1.0.0 · source§

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

Searches for an element of an iterator that satisfies a predicate. Read more
1.30.0 · source§

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

Applies function to the elements of iterator and returns -the first non-none result. Read more
source§

fn try_find<F, R>( +) -> <<R as Try>::Residual as Residual<Option<<R as Try>::Output>>>::TryTypewhere + Self: Sized, + F: FnMut(Self::Item, Self::Item) -> R, + R: Try<Output = Self::Item>, + <R as Try>::Residual: Residual<Option<Self::Item>>,

🔬This is a nightly-only experimental API. (iterator_try_reduce)
Reduces the elements to a single one by repeatedly applying a reducing operation. If the +closure returns a failure, the failure is propagated back to the caller immediately. Read more
1.0.0 · source§

fn all<F>(&mut self, f: F) -> boolwhere + Self: Sized, + F: FnMut(Self::Item) -> bool,

Tests if every element of the iterator matches a predicate. Read more
1.0.0 · source§

fn any<F>(&mut self, f: F) -> boolwhere + Self: Sized, + F: FnMut(Self::Item) -> bool,

Tests if any element of the iterator matches a predicate. Read more
1.0.0 · source§

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

Searches for an element of an iterator that satisfies a predicate. Read more
1.30.0 · source§

fn find_map<B, F>(&mut self, f: F) -> Option<B>where + Self: Sized, + F: FnMut(Self::Item) -> Option<B>,

Applies function to the elements of iterator and returns +the first non-none result. Read more
source§

fn try_find<F, R>( &mut self, f: F -) -> <<R as Try>::Residual as Residual<Option<Self::Item>>>::TryTypewhere - Self: Sized, - F: FnMut(&Self::Item) -> R, - R: Try<Output = bool>, - <R as Try>::Residual: Residual<Option<Self::Item>>,

🔬This is a nightly-only experimental API. (try_find)
Applies function to the elements of iterator and returns -the first true result or the first error. Read more
1.0.0 · source§

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

Searches for an element in an iterator, returning its index. Read more
1.6.0 · source§

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item>where - B: Ord, - Self: Sized, - F: FnMut(&Self::Item) -> B,

Returns the element that gives the maximum value from the -specified function. Read more
1.15.0 · source§

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

Returns the element that gives the maximum value with respect to the -specified comparison function. Read more
1.6.0 · source§

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item>where - B: Ord, - Self: Sized, - F: FnMut(&Self::Item) -> B,

Returns the element that gives the minimum value from the -specified function. Read more
1.15.0 · source§

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

Returns the element that gives the minimum value with respect to the -specified comparison function. Read more
1.0.0 · source§

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB)where - FromA: Default + Extend<A>, - FromB: Default + Extend<B>, - Self: Sized + Iterator<Item = (A, B)>,

Converts an iterator of pairs into a pair of containers. Read more
1.36.0 · source§

fn copied<'a, T>(self) -> Copied<Self>where - T: 'a + Copy, - Self: Sized + Iterator<Item = &'a T>,

Creates an iterator which copies all of its elements. Read more
1.0.0 · source§

fn cloned<'a, T>(self) -> Cloned<Self>where - T: 'a + Clone, - Self: Sized + Iterator<Item = &'a T>,

Creates an iterator which clones all of its elements. Read more
source§

fn array_chunks<const N: usize>(self) -> ArrayChunks<Self, N>where - Self: Sized,

🔬This is a nightly-only experimental API. (iter_array_chunks)
Returns an iterator over N elements of the iterator at a time. Read more
1.11.0 · source§

fn sum<S>(self) -> Swhere - Self: Sized, - S: Sum<Self::Item>,

Sums the elements of an iterator. Read more
1.11.0 · source§

fn product<P>(self) -> Pwhere - Self: Sized, - P: Product<Self::Item>,

Iterates over the entire iterator, multiplying all the elements Read more
source§

fn cmp_by<I, F>(self, other: I, cmp: F) -> Orderingwhere - Self: Sized, - I: IntoIterator, - F: FnMut(Self::Item, <I as IntoIterator>::Item) -> Ordering,

🔬This is a nightly-only experimental API. (iter_order_by)
Lexicographically compares the elements of this Iterator with those -of another with respect to the specified comparison function. Read more
1.5.0 · source§

fn partial_cmp<I>(self, other: I) -> Option<Ordering>where - I: IntoIterator, - Self::Item: PartialOrd<<I as IntoIterator>::Item>, - Self: Sized,

Lexicographically compares the PartialOrd elements of -this Iterator with those of another. The comparison works like short-circuit +) -> <<R as Try>::Residual as Residual<Option<Self::Item>>>::TryTypewhere + Self: Sized, + F: FnMut(&Self::Item) -> R, + R: Try<Output = bool>, + <R as Try>::Residual: Residual<Option<Self::Item>>,
🔬This is a nightly-only experimental API. (try_find)
Applies function to the elements of iterator and returns +the first true result or the first error. Read more
1.0.0 · source§

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

Searches for an element in an iterator, returning its index. Read more
1.6.0 · source§

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item>where + B: Ord, + Self: Sized, + F: FnMut(&Self::Item) -> B,

Returns the element that gives the maximum value from the +specified function. Read more
1.15.0 · source§

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

Returns the element that gives the maximum value with respect to the +specified comparison function. Read more
1.6.0 · source§

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item>where + B: Ord, + Self: Sized, + F: FnMut(&Self::Item) -> B,

Returns the element that gives the minimum value from the +specified function. Read more
1.15.0 · source§

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

Returns the element that gives the minimum value with respect to the +specified comparison function. Read more
1.0.0 · source§

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB)where + FromA: Default + Extend<A>, + FromB: Default + Extend<B>, + Self: Sized + Iterator<Item = (A, B)>,

Converts an iterator of pairs into a pair of containers. Read more
1.36.0 · source§

fn copied<'a, T>(self) -> Copied<Self>where + T: 'a + Copy, + Self: Sized + Iterator<Item = &'a T>,

Creates an iterator which copies all of its elements. Read more
1.0.0 · source§

fn cloned<'a, T>(self) -> Cloned<Self>where + T: 'a + Clone, + Self: Sized + Iterator<Item = &'a T>,

Creates an iterator which clones all of its elements. Read more
source§

fn array_chunks<const N: usize>(self) -> ArrayChunks<Self, N>where + Self: Sized,

🔬This is a nightly-only experimental API. (iter_array_chunks)
Returns an iterator over N elements of the iterator at a time. Read more
1.11.0 · source§

fn sum<S>(self) -> Swhere + Self: Sized, + S: Sum<Self::Item>,

Sums the elements of an iterator. Read more
1.11.0 · source§

fn product<P>(self) -> Pwhere + Self: Sized, + P: Product<Self::Item>,

Iterates over the entire iterator, multiplying all the elements Read more
source§

fn cmp_by<I, F>(self, other: I, cmp: F) -> Orderingwhere + Self: Sized, + I: IntoIterator, + F: FnMut(Self::Item, <I as IntoIterator>::Item) -> Ordering,

🔬This is a nightly-only experimental API. (iter_order_by)
Lexicographically compares the elements of this Iterator with those +of another with respect to the specified comparison function. Read more
1.5.0 · source§

fn partial_cmp<I>(self, other: I) -> Option<Ordering>where + I: IntoIterator, + Self::Item: PartialOrd<<I as IntoIterator>::Item>, + Self: Sized,

Lexicographically compares the PartialOrd elements of +this Iterator with those of another. The comparison works like short-circuit evaluation, returning a result without comparing the remaining elements. -As soon as an order can be determined, the evaluation stops and a result is returned. Read more
source§

fn partial_cmp_by<I, F>(self, other: I, partial_cmp: F) -> Option<Ordering>where - Self: Sized, - I: IntoIterator, - F: FnMut(Self::Item, <I as IntoIterator>::Item) -> Option<Ordering>,

🔬This is a nightly-only experimental API. (iter_order_by)
Lexicographically compares the elements of this Iterator with those -of another with respect to the specified comparison function. Read more
1.5.0 · source§

fn eq<I>(self, other: I) -> boolwhere - I: IntoIterator, - Self::Item: PartialEq<<I as IntoIterator>::Item>, - Self: Sized,

Determines if the elements of this Iterator are equal to those of -another. Read more
source§

fn eq_by<I, F>(self, other: I, eq: F) -> boolwhere - Self: Sized, - I: IntoIterator, - F: FnMut(Self::Item, <I as IntoIterator>::Item) -> bool,

🔬This is a nightly-only experimental API. (iter_order_by)
Determines if the elements of this Iterator are equal to those of -another with respect to the specified equality function. Read more
1.5.0 · source§

fn ne<I>(self, other: I) -> boolwhere - I: IntoIterator, - Self::Item: PartialEq<<I as IntoIterator>::Item>, - Self: Sized,

Determines if the elements of this Iterator are not equal to those of -another. Read more
1.5.0 · source§

fn lt<I>(self, other: I) -> boolwhere - I: IntoIterator, - Self::Item: PartialOrd<<I as IntoIterator>::Item>, - Self: Sized,

Determines if the elements of this Iterator are lexicographically -less than those of another. Read more
1.5.0 · source§

fn le<I>(self, other: I) -> boolwhere - I: IntoIterator, - Self::Item: PartialOrd<<I as IntoIterator>::Item>, - Self: Sized,

Determines if the elements of this Iterator are lexicographically -less or equal to those of another. Read more
1.5.0 · source§

fn gt<I>(self, other: I) -> boolwhere - I: IntoIterator, - Self::Item: PartialOrd<<I as IntoIterator>::Item>, - Self: Sized,

Determines if the elements of this Iterator are lexicographically -greater than those of another. Read more
1.5.0 · source§

fn ge<I>(self, other: I) -> boolwhere - I: IntoIterator, - Self::Item: PartialOrd<<I as IntoIterator>::Item>, - Self: Sized,

Determines if the elements of this Iterator are lexicographically -greater than or equal to those of another. Read more
source§

fn is_sorted_by<F>(self, compare: F) -> boolwhere - Self: Sized, - F: FnMut(&Self::Item, &Self::Item) -> Option<Ordering>,

🔬This is a nightly-only experimental API. (is_sorted)
Checks if the elements of this iterator are sorted using the given comparator function. Read more
source§

fn is_sorted_by_key<F, K>(self, f: F) -> boolwhere - Self: Sized, - F: FnMut(Self::Item) -> K, - K: PartialOrd<K>,

🔬This is a nightly-only experimental API. (is_sorted)
Checks if the elements of this iterator are sorted using the given key extraction -function. Read more

Auto Trait Implementations§

§

impl<'s, 'x> RefUnwindSafe for SentenceIter<'s, 'x>

§

impl<'s, 'x> Send for SentenceIter<'s, 'x>

§

impl<'s, 'x> Sync for SentenceIter<'s, 'x>

§

impl<'s, 'x> Unpin for SentenceIter<'s, 'x>

§

impl<'s, 'x> UnwindSafe for SentenceIter<'s, 'x>

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,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

source§

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

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

-
source§

impl<T, U> Into<U> for Twhere - U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

+As soon as an order can be determined, the evaluation stops and a result is returned. Read more
source§

fn partial_cmp_by<I, F>(self, other: I, partial_cmp: F) -> Option<Ordering>where + Self: Sized, + I: IntoIterator, + F: FnMut(Self::Item, <I as IntoIterator>::Item) -> Option<Ordering>,

🔬This is a nightly-only experimental API. (iter_order_by)
Lexicographically compares the elements of this Iterator with those +of another with respect to the specified comparison function. Read more
1.5.0 · source§

fn eq<I>(self, other: I) -> boolwhere + I: IntoIterator, + Self::Item: PartialEq<<I as IntoIterator>::Item>, + Self: Sized,

Determines if the elements of this Iterator are equal to those of +another. Read more
source§

fn eq_by<I, F>(self, other: I, eq: F) -> boolwhere + Self: Sized, + I: IntoIterator, + F: FnMut(Self::Item, <I as IntoIterator>::Item) -> bool,

🔬This is a nightly-only experimental API. (iter_order_by)
Determines if the elements of this Iterator are equal to those of +another with respect to the specified equality function. Read more
1.5.0 · source§

fn ne<I>(self, other: I) -> boolwhere + I: IntoIterator, + Self::Item: PartialEq<<I as IntoIterator>::Item>, + Self: Sized,

Determines if the elements of this Iterator are not equal to those of +another. Read more
1.5.0 · source§

fn lt<I>(self, other: I) -> boolwhere + I: IntoIterator, + Self::Item: PartialOrd<<I as IntoIterator>::Item>, + Self: Sized,

Determines if the elements of this Iterator are lexicographically +less than those of another. Read more
1.5.0 · source§

fn le<I>(self, other: I) -> boolwhere + I: IntoIterator, + Self::Item: PartialOrd<<I as IntoIterator>::Item>, + Self: Sized,

Determines if the elements of this Iterator are lexicographically +less or equal to those of another. Read more
1.5.0 · source§

fn gt<I>(self, other: I) -> boolwhere + I: IntoIterator, + Self::Item: PartialOrd<<I as IntoIterator>::Item>, + Self: Sized,

Determines if the elements of this Iterator are lexicographically +greater than those of another. Read more
1.5.0 · source§

fn ge<I>(self, other: I) -> boolwhere + I: IntoIterator, + Self::Item: PartialOrd<<I as IntoIterator>::Item>, + Self: Sized,

Determines if the elements of this Iterator are lexicographically +greater than or equal to those of another. Read more
source§

fn is_sorted_by<F>(self, compare: F) -> boolwhere + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> Option<Ordering>,

🔬This is a nightly-only experimental API. (is_sorted)
Checks if the elements of this iterator are sorted using the given comparator function. Read more
source§

fn is_sorted_by_key<F, K>(self, f: F) -> boolwhere + Self: Sized, + F: FnMut(Self::Item) -> K, + K: PartialOrd,

🔬This is a nightly-only experimental API. (is_sorted)
Checks if the elements of this iterator are sorted using the given key extraction +function. Read more

Auto Trait Implementations§

§

impl<'s, 'x> RefUnwindSafe for SentenceIter<'s, 'x>

§

impl<'s, 'x> Send for SentenceIter<'s, 'x>

§

impl<'s, 'x> Sync for SentenceIter<'s, 'x>

§

impl<'s, 'x> Unpin for SentenceIter<'s, 'x>

§

impl<'s, 'x> UnwindSafe for SentenceIter<'s, 'x>

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,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

source§

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

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

+
source§

impl<T, U> Into<U> for Twhere + U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of -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>( +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>( 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>( +) -> 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, 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 +) -> 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( self, - element: Self::Item -) -> IntersperseWith<Self, IntersperseElementSimple<Self::Item>>where - Self: Sized, - Self::Item: Clone,

An iterator adaptor to insert a particular value + 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 - Self: Sized, - F: FnMut() -> Self::Item,

An iterator adaptor to insert a particular value created by a function + 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>( 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 - J: IntoIterator, - Self: Sized,

Create an iterator which iterates over both this and the specified +) -> 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 + 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 - F: FnMut(&mut Self) -> Option<B>, - Self: Sized,

A “meta iterator adaptor”. Its closure receives a reference to the + 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 - Self: Sized, - F: FnMut(&Self::Item) -> K, - K: PartialEq<K>,

Return an iterable that can group iterator elements. + Self: Sized, + F: FnMut(&Self::Item) -> K, + K: PartialEq,
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 - Self: Sized + Iterator<Item = <T as TupleCollect>::Item>, +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 + <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 - 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 + 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 - Self: Sized + Iterator<Item = <T as TupleCollect>::Item>, + 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 - 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 - Self: Sized,

👎Deprecated since 0.8.0: Use std .step_by() instead
Return an iterator adaptor that steps n elements in the base iterator + 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 + 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 - 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: 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, 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
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 + Self: Iterator<Item = Result<T, E>> + Sized, + F: FnMut(T) -> U,
👎Deprecated since 0.10.0: Use .map_ok() instead
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 - Self: Iterator<Item = Result<T, E>> + Sized, - F: FnMut(&T) -> bool,

Return an iterator adaptor that filters every Result::Ok + 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 - Self: Iterator<Item = Result<T, E>> + Sized, - F: FnMut(T) -> Option<U>,

Return an iterator adaptor that filters and transforms every + 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 - 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 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 + 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 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 - Self: Sized, - Self::Item: PartialOrd<Self::Item>, - J: IntoIterator<Item = Self::Item>,

Return an iterator adaptor that merges the two base iterators in +) -> MergeBy<Self, <J as IntoIterator>::IntoIter, MergeLte>where + Self: Sized, + Self::Item: PartialOrd, + 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>( self, other: J, is_first: F -) -> MergeBy<Self, <J as IntoIterator>::IntoIter, F>where - Self: 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. +) -> MergeBy<Self, <J as IntoIterator>::IntoIter, F>where + Self: 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, T>( self, other: J, cmp_fn: F -) -> MergeBy<Self, <J as IntoIterator>::IntoIter, MergeFuncLR<F, <F as FuncLR<Self::Item, <<J as IntoIterator>::IntoIter as Iterator>::Item>>::T>>where - J: IntoIterator, - F: FnMut(&Self::Item, &<J as IntoIterator>::Item) -> T, - 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 - 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 +) -> MergeBy<Self, <J as IntoIterator>::IntoIter, MergeFuncLR<F, <F as FuncLR<Self::Item, <<J as IntoIterator>::IntoIter as Iterator>::Item>>::T>>where + J: IntoIterator, + F: FnMut(&Self::Item, &<J as IntoIterator>::Item) -> T, + 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 + Self: Sized, + Self::Item: IntoIterator, + <Self::Item as IntoIterator>::Item: PartialOrd,

Return an iterator adaptor that flattens an iterator of iterators by 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 +) -> 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>( self, other: J -) -> Product<Self, <J as IntoIterator>::IntoIter>where - Self: Sized, - Self::Item: Clone, - J: IntoIterator, - <J as IntoIterator>::IntoIter: Clone,

Return an iterator adaptor that iterates over the cartesian product of +) -> Product<Self, <J as IntoIterator>::IntoIter>where + Self: Sized, + Self::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( 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 - 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 - Self: Sized, - Self::Item: PartialEq<Self::Item>,

Remove duplicates from sections of consecutive identical elements. +) -> 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 + 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 + Self: Sized, + Self::Item: PartialEq,

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>( 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, +) -> 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( self -) -> CoalesceBy<Self, DedupPredWithCount2CoalescePred<DedupEq>, (usize, Self::Item)>where - Self: Sized,

Remove duplicates from sections of consecutive identical elements, while keeping a count of +) -> 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>( self, cmp: Cmp -) -> CoalesceBy<Self, DedupPredWithCount2CoalescePred<Cmp>, (usize, Self::Item)>where - Self: Sized, - Cmp: FnMut(&Self::Item, &Self::Item) -> bool,

Remove duplicates from sections of consecutive identical elements, while keeping a count of +) -> CoalesceBy<Self, DedupPredWithCount2CoalescePred<Cmp>, (usize, Self::Item)>where + Self: Sized, + Cmp: 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 - Self: Sized, - Self::Item: Eq + Hash,

Return an iterator adaptor that produces elements that appear more than once during the +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 - Self: Sized, - V: Eq + Hash, - F: FnMut(&Self::Item) -> V,

Return an iterator adaptor that produces elements that appear more than once during the + 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 - Self: Sized, - Self::Item: Clone + Eq + Hash,

Return an iterator adaptor that filters out elements that have + 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 - Self: Sized, - V: Eq + Hash, - F: FnMut(&Self::Item) -> V,

Return an iterator adaptor that filters out elements that have + 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 - Self: Sized + PeekingNext, - F: FnMut(&Self::Item) -> bool,

Return an iterator adaptor that borrows from this iterator and + 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 - Self: Clone, - F: FnMut(&Self::Item) -> bool,

Return an iterator adaptor that borrows from a Clone-able iterator + 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 take_while_inclusive<F>(self, accept: F) -> TakeWhileInclusive<Self, F>where - Self: Sized, - F: FnMut(&Self::Item) -> bool,

Returns an iterator adaptor that consumes elements while the given + 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 + 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 - Self: Sized + Clone, - Self::Item: Clone, + 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 - Self: Sized, - Self::Item: Clone,

Return an iterator adaptor that iterates over the k-length combinations of +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( self, - k: usize + 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 - Self: Sized, - Self::Item: Clone,

Return an iterator adaptor that iterates over all k-permutations of the + 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 + 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 - 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 - Self: Sized, - F: FnMut(usize) -> Self::Item,

Return an iterator adaptor that pads the sequence to a minimum length of + 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 + 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 combines each element with a Position to + 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 + 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 - 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 - Self: Sized + Iterator<Item = <T as TupleCollect>::Item>, + 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 + 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 - Self: Sized + Iterator<Item = <T as TupleCollect>::Item>, +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 - 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 - 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 - 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 - Self: Sized, - Self::Item: PartialEq<Self::Item>,

Check whether all elements compare equal. Read more
source§

fn all_equal_value( +(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 + 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 + Self: Sized, + Self::Item: Borrow<Q>, + Q: PartialEq,

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,

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: PartialEq<Self::Item>,

If there are elements and they are all equal, return a single copy of that element. +) -> Result<Self::Item, Option<(Self::Item, Self::Item)>>where + Self: Sized, + Self::Item: PartialEq,
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 - Self: Sized + DoubleEndedIterator,

Consume the last n elements from the iterator eagerly, +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 + 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 - 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, - 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 - 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 + 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, + 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>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 + 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 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 - 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 - Self: Iterator<Item = Result<A, E>>, - F: FnMut(B, A) -> B,

👎Deprecated since 0.10.0: Use .fold_ok() instead
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 - 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(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 - 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, - 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 - 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 - 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: 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 - 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 - 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: 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 - 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 - 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 - 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: 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 - 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 - 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>( - 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 + 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 + 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 + Self: Iterator<Item = Result<A, E>>, + F: FnMut(B, A) -> B,

👎Deprecated since 0.10.0: Use .fold_ok() instead
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 + 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(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 + 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, + 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 + 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>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>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>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>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>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>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>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>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: 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 + 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>>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>(self, f: F) -> HashMap<K, Vec<V>>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 - Self: Iterator<Item = (K, V)> + Sized, - K: Hash + Eq,

Constructs a GroupingMap to be used later with one of the efficient + 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>( 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 - 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: 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 - 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 - 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: 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 - Self: Sized, - K: Ord, - 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: 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 - 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 - 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: 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 - 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 - 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: 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 - 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 - 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 - 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 - 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 - Self: Sized,

If the iterator yields exactly one element, that element will be returned, otherwise + 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>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>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>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>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>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>where + Self: Sized, + K: Ord, + 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,

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, + 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 + 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 + 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: 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 + 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 + 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: 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 + 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 + Self: Sized, + Self::Item: PartialOrd,

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 + Self: Sized, + K: PartialOrd, + 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 + 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 + 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 - Self: Sized,

If the iterator yields no elements, Ok(None) will be returned. If the iterator yields +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 - 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 - Self: Sized, - Self::Item: Eq + Hash,

Collect the items in this iterator and return a HashMap which + 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>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 - Self: Sized, - K: Eq + Hash, - F: FnMut(Self::Item) -> K,

Collect the items in this iterator and return a HashMap which +of times it appears. Read more
source§

fn counts_by<K, F>(self, f: F) -> HashMap<K, usize>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 - Self: Sized + MultiUnzip<FromI>,

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

fn try_len(&self) -> Result<usize, (usize, Option<usize>)>

Returns the length of the iterator if one exists. -Otherwise return self.size_hint(). Read more
source§

impl<IT, A, FromA, B, FromB> MultiUnzip<(FromA, FromB)> for ITwhere - IT: Iterator<Item = (A, B)>, - FromA: Default + Extend<A>, - FromB: Default + Extend<B>,

source§

fn multiunzip(self) -> (FromA, FromB)

Unzip this iterator into multiple collections.
source§

impl<T, U> TryFrom<U> for Twhere - U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
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.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
\ No newline at end of file +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§

fn try_len(&self) -> Result<usize, (usize, Option<usize>)>

Returns the length of the iterator if one exists. +Otherwise return self.size_hint(). Read more
source§

impl<IT, A, FromA, B, FromB> MultiUnzip<(FromA, FromB)> for ITwhere + IT: Iterator<Item = (A, B)>, + FromA: Default + Extend<A>, + FromB: Default + Extend<B>,

source§

fn multiunzip(self) -> (FromA, FromB)

Unzip this iterator into multiple collections.
source§

impl<T, U> TryFrom<U> for Twhere + U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
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.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
\ No newline at end of file diff --git a/rust/sudachi/sentence_splitter/struct.SentenceSplitter.html b/rust/sudachi/sentence_splitter/struct.SentenceSplitter.html index 2452e97c..951435fd 100644 --- a/rust/sudachi/sentence_splitter/struct.SentenceSplitter.html +++ b/rust/sudachi/sentence_splitter/struct.SentenceSplitter.html @@ -1,14 +1,14 @@ -SentenceSplitter in sudachi::sentence_splitter - Rust
pub struct SentenceSplitter<'a> { /* private fields */ }

Implementations§

source§

impl SentenceSplitter<'_>

source

pub fn new() -> Self

source

pub fn with_limit(limit: usize) -> Self

source

pub fn with_checker<'a>( +SentenceSplitter in sudachi::sentence_splitter - Rust
pub struct SentenceSplitter<'a> { /* private fields */ }

Implementations§

source§

impl SentenceSplitter<'_>

source

pub fn new() -> Self

source

pub fn with_limit(limit: usize) -> Self

source

pub fn with_checker<'a>( self, lexicon: &'a LexiconSet<'a> -) -> SentenceSplitter<'a>

Trait Implementations§

source§

impl SplitSentences for SentenceSplitter<'_>

source§

fn split<'a, 'b>(&'b self, data: &'a str) -> SentenceIter<'a, 'b>

Auto Trait Implementations§

§

impl<'a> RefUnwindSafe for SentenceSplitter<'a>

§

impl<'a> Send for SentenceSplitter<'a>

§

impl<'a> Sync for SentenceSplitter<'a>

§

impl<'a> Unpin for SentenceSplitter<'a>

§

impl<'a> UnwindSafe for SentenceSplitter<'a>

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,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

source§

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

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

-
source§

impl<T, U> Into<U> for Twhere - U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

+) -> SentenceSplitter<'a>

Trait Implementations§

source§

impl SplitSentences for SentenceSplitter<'_>

source§

fn split<'a, 'b>(&'b self, data: &'a str) -> SentenceIter<'a, 'b>

Auto Trait Implementations§

§

impl<'a> RefUnwindSafe for SentenceSplitter<'a>

§

impl<'a> Send for SentenceSplitter<'a>

§

impl<'a> Sync for SentenceSplitter<'a>

§

impl<'a> Unpin for SentenceSplitter<'a>

§

impl<'a> UnwindSafe for SentenceSplitter<'a>

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,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

source§

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

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

+
source§

impl<T, U> Into<U> for Twhere + U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of -From<T> for U chooses to do.

-
source§

impl<T, U> TryFrom<U> for Twhere - U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
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.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
\ No newline at end of file +From<T> for U chooses to do.

+
source§

impl<T, U> TryFrom<U> for Twhere + U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
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.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
\ No newline at end of file diff --git a/rust/sudachi/sentence_splitter/trait.SplitSentences.html b/rust/sudachi/sentence_splitter/trait.SplitSentences.html index 7caae3ce..a15d0c33 100644 --- a/rust/sudachi/sentence_splitter/trait.SplitSentences.html +++ b/rust/sudachi/sentence_splitter/trait.SplitSentences.html @@ -1,4 +1,4 @@ -SplitSentences in sudachi::sentence_splitter - Rust
pub trait SplitSentences {
+SplitSentences in sudachi::sentence_splitter - Rust
pub trait SplitSentences {
     // Required method
-    fn split<'a, 'b>(&'b self, data: &'a str) -> SentenceIter<'a, 'b> ;
-}

Required Methods§

source

fn split<'a, 'b>(&'b self, data: &'a str) -> SentenceIter<'a, 'b>

Implementors§

\ No newline at end of file + fn split<'a, 'b>(&'b self, data: &'a str) -> SentenceIter<'a, 'b> ; +}

Required Methods§

source

fn split<'a, 'b>(&'b self, data: &'a str) -> SentenceIter<'a, 'b>

Implementors§

\ No newline at end of file diff --git a/rust/trait.impl/bitflags/traits/trait.Flags.js b/rust/trait.impl/bitflags/traits/trait.Flags.js new file mode 100644 index 00000000..238fa6c7 --- /dev/null +++ b/rust/trait.impl/bitflags/traits/trait.Flags.js @@ -0,0 +1,3 @@ +(function() {var implementors = { +"sudachi":[["impl Flags for InfoSubset"],["impl Flags for CategoryType"]] +};if (window.register_implementors) {window.register_implementors(implementors);} else {window.pending_implementors = implementors;}})() \ No newline at end of file diff --git a/rust/trait.impl/bitflags/traits/trait.PublicFlags.js b/rust/trait.impl/bitflags/traits/trait.PublicFlags.js new file mode 100644 index 00000000..91cdff9a --- /dev/null +++ b/rust/trait.impl/bitflags/traits/trait.PublicFlags.js @@ -0,0 +1,3 @@ +(function() {var implementors = { +"sudachi":[["impl PublicFlags for InfoSubset"],["impl PublicFlags for CategoryType"]] +};if (window.register_implementors) {window.register_implementors(implementors);} else {window.pending_implementors = implementors;}})() \ No newline at end of file diff --git a/rust/trait.impl/core/clone/trait.Clone.js b/rust/trait.impl/core/clone/trait.Clone.js new file mode 100644 index 00000000..7d2d9c4e --- /dev/null +++ b/rust/trait.impl/core/clone/trait.Clone.js @@ -0,0 +1,3 @@ +(function() {var implementors = { +"sudachi":[["impl Clone for Node"],["impl Clone for UserDictVersion"],["impl Clone for CharacterCategory"],["impl Clone for TrieEntry"],["impl Clone for HasWord"],["impl Clone for HeaderVersion"],["impl Clone for WordInfo"],["impl Clone for InputBuffer"],["impl Clone for Config"],["impl Clone for WordInfoData"],["impl Clone for ConfigBuilder"],["impl Clone for CreatedWords"],["impl Clone for InfoSubset"],["impl Clone for Mode"],["impl Clone for ResultNode"],["impl Clone for CategoryType"],["impl Clone for SystemDictVersion"],["impl Clone for SurfaceProjection"],["impl Clone for WordId"],["impl Clone for PosMatcher"],["impl Clone for Header"],["impl Clone for BoundaryMode"]] +};if (window.register_implementors) {window.register_implementors(implementors);} else {window.pending_implementors = implementors;}})() \ No newline at end of file diff --git a/rust/trait.impl/core/cmp/trait.Eq.js b/rust/trait.impl/core/cmp/trait.Eq.js new file mode 100644 index 00000000..c8da7825 --- /dev/null +++ b/rust/trait.impl/core/cmp/trait.Eq.js @@ -0,0 +1,3 @@ +(function() {var implementors = { +"sudachi":[["impl Eq for HasWord"],["impl Eq for CategoryType"],["impl Eq for HeaderVersion"],["impl Eq for Mode"],["impl Eq for InfoSubset"],["impl Eq for LexiconSetError"],["impl Eq for Error"],["impl Eq for HeaderError"],["impl Eq for Header"],["impl Eq for CreatedWords"],["impl Eq for BoundaryMode"],["impl Eq for SurfaceProjection"],["impl Eq for LexiconEntry"],["impl Eq for UserDictVersion"],["impl Eq for SystemDictVersion"],["impl Eq for WordId"],["impl Eq for TrieEntry"]] +};if (window.register_implementors) {window.register_implementors(implementors);} else {window.pending_implementors = implementors;}})() \ No newline at end of file diff --git a/rust/implementors/core/cmp/trait.Ord.js b/rust/trait.impl/core/cmp/trait.Ord.js similarity index 85% rename from rust/implementors/core/cmp/trait.Ord.js rename to rust/trait.impl/core/cmp/trait.Ord.js index d9960b15..8727fff6 100644 --- a/rust/implementors/core/cmp/trait.Ord.js +++ b/rust/trait.impl/core/cmp/trait.Ord.js @@ -1,3 +1,3 @@ (function() {var implementors = { -"sudachi":[["impl Ord for WordId"]] +"sudachi":[["impl Ord for WordId"]] };if (window.register_implementors) {window.register_implementors(implementors);} else {window.pending_implementors = implementors;}})() \ No newline at end of file diff --git a/rust/trait.impl/core/cmp/trait.PartialEq.js b/rust/trait.impl/core/cmp/trait.PartialEq.js new file mode 100644 index 00000000..c9fe0b1a --- /dev/null +++ b/rust/trait.impl/core/cmp/trait.PartialEq.js @@ -0,0 +1,3 @@ +(function() {var implementors = { +"sudachi":[["impl PartialEq for HeaderVersion"],["impl PartialEq for TrieEntry"],["impl PartialEq for LexiconSetError"],["impl PartialEq for BoundaryMode"],["impl PartialEq for Error"],["impl<I: PartialEq> PartialEq for SudachiNomError<I>"],["impl PartialEq for LexiconEntry"],["impl PartialEq for SurfaceProjection"],["impl PartialEq for SystemDictVersion"],["impl PartialEq for HasWord"],["impl PartialEq for WordId"],["impl PartialEq for InfoSubset"],["impl PartialEq for Header"],["impl PartialEq for CreatedWords"],["impl PartialEq for CategoryType"],["impl PartialEq for HeaderError"],["impl PartialEq for Mode"],["impl PartialEq for UserDictVersion"]] +};if (window.register_implementors) {window.register_implementors(implementors);} else {window.pending_implementors = implementors;}})() \ No newline at end of file diff --git a/rust/trait.impl/core/cmp/trait.PartialOrd.js b/rust/trait.impl/core/cmp/trait.PartialOrd.js new file mode 100644 index 00000000..57750c60 --- /dev/null +++ b/rust/trait.impl/core/cmp/trait.PartialOrd.js @@ -0,0 +1,3 @@ +(function() {var implementors = { +"sudachi":[["impl PartialOrd for WordId"]] +};if (window.register_implementors) {window.register_implementors(implementors);} else {window.pending_implementors = implementors;}})() \ No newline at end of file diff --git a/rust/implementors/core/convert/trait.AsRef.js b/rust/trait.impl/core/convert/trait.AsRef.js similarity index 77% rename from rust/implementors/core/convert/trait.AsRef.js rename to rust/trait.impl/core/convert/trait.AsRef.js index 5a84cbf3..d820bff4 100644 --- a/rust/implementors/core/convert/trait.AsRef.js +++ b/rust/trait.impl/core/convert/trait.AsRef.js @@ -1,3 +1,3 @@ (function() {var implementors = { -"sudachi":[["impl AsRef<[u8]> for Storage"]] +"sudachi":[["impl AsRef<[u8]> for Storage"]] };if (window.register_implementors) {window.register_implementors(implementors);} else {window.pending_implementors = implementors;}})() \ No newline at end of file diff --git a/rust/trait.impl/core/convert/trait.From.js b/rust/trait.impl/core/convert/trait.From.js new file mode 100644 index 00000000..2a437254 --- /dev/null +++ b/rust/trait.impl/core/convert/trait.From.js @@ -0,0 +1,3 @@ +(function() {var implementors = { +"sudachi":[["impl From<Error> for SudachiError"],["impl From<HeaderError> for SudachiError"],["impl From<Error> for ConfigError"],["impl From<WordInfoData> for WordInfo"],["impl From<DicBuildError> for SudachiError"],["impl From<Error> for SudachiError"],["impl From<Error> for PluginError"],["impl From<Error> for SudachiError"],["impl From<ConfigError> for SudachiError"],["impl From<ParseIntError> for SudachiError"],["impl From<Error> for SudachiError"],["impl From<FromUtf16Error> for SudachiError"],["impl From<Error> for PluginError"],["impl From<PluginError> for SudachiError"],["impl From<Error> for BuildFailure"],["impl From<WordInfo> for WordInfoData"],["impl From<Error> for ConfigError"],["impl From<Error> for PluginError"],["impl From<LexiconSetError> for SudachiError"],["impl<I: Debug> From<Err<SudachiNomError<I>>> for SudachiError"]] +};if (window.register_implementors) {window.register_implementors(implementors);} else {window.pending_implementors = implementors;}})() \ No newline at end of file diff --git a/rust/implementors/core/convert/trait.TryFrom.js b/rust/trait.impl/core/convert/trait.TryFrom.js similarity index 78% rename from rust/implementors/core/convert/trait.TryFrom.js rename to rust/trait.impl/core/convert/trait.TryFrom.js index f423b308..87156f28 100644 --- a/rust/implementors/core/convert/trait.TryFrom.js +++ b/rust/trait.impl/core/convert/trait.TryFrom.js @@ -1,3 +1,3 @@ (function() {var implementors = { -"sudachi":[["impl TryFrom<&str> for SurfaceProjection"]] +"sudachi":[["impl TryFrom<&str> for SurfaceProjection"]] };if (window.register_implementors) {window.register_implementors(implementors);} else {window.pending_implementors = implementors;}})() \ No newline at end of file diff --git a/rust/trait.impl/core/default/trait.Default.js b/rust/trait.impl/core/default/trait.Default.js new file mode 100644 index 00000000..ed751e67 --- /dev/null +++ b/rust/trait.impl/core/default/trait.Default.js @@ -0,0 +1,3 @@ +(function() {var implementors = { +"sudachi":[["impl Default for WordInfoData"],["impl Default for Config"],["impl Default for SimpleOovPlugin"],["impl Default for CreatedWords"],["impl Default for CharacterCategory"],["impl Default for InputBuffer"],["impl Default for BoundaryMode"],["impl Default for DefaultInputTextPlugin"],["impl Default for CategoryType"],["impl Default for MeCabOovPlugin"],["impl Default for JoinKatakanaOovPlugin"],["impl Default for WordInfo"],["impl Default for JoinNumericPlugin"],["impl Default for SurfaceProjection"],["impl Default for Lattice"],["impl Default for InfoSubset"]] +};if (window.register_implementors) {window.register_implementors(implementors);} else {window.pending_implementors = implementors;}})() \ No newline at end of file diff --git a/rust/trait.impl/core/error/trait.Error.js b/rust/trait.impl/core/error/trait.Error.js new file mode 100644 index 00000000..09b2ec5f --- /dev/null +++ b/rust/trait.impl/core/error/trait.Error.js @@ -0,0 +1,3 @@ +(function() {var implementors = { +"sudachi":[["impl Error for DicBuildError"],["impl Error for PluginError"],["impl Error for ConfigError"],["impl Error for SudachiError"],["impl Error for BuildFailure"],["impl Error for Error"],["impl Error for LexiconSetError"],["impl Error for HeaderError"]] +};if (window.register_implementors) {window.register_implementors(implementors);} else {window.pending_implementors = implementors;}})() \ No newline at end of file diff --git a/rust/trait.impl/core/fmt/trait.Binary.js b/rust/trait.impl/core/fmt/trait.Binary.js new file mode 100644 index 00000000..c9f513c3 --- /dev/null +++ b/rust/trait.impl/core/fmt/trait.Binary.js @@ -0,0 +1,3 @@ +(function() {var implementors = { +"sudachi":[["impl Binary for InfoSubset"],["impl Binary for CategoryType"]] +};if (window.register_implementors) {window.register_implementors(implementors);} else {window.pending_implementors = implementors;}})() \ No newline at end of file diff --git a/rust/trait.impl/core/fmt/trait.Debug.js b/rust/trait.impl/core/fmt/trait.Debug.js new file mode 100644 index 00000000..2dbbe54d --- /dev/null +++ b/rust/trait.impl/core/fmt/trait.Debug.js @@ -0,0 +1,3 @@ +(function() {var implementors = { +"sudachi":[["impl<I: Debug> Debug for SudachiNomError<I>"],["impl Debug for HeaderVersion"],["impl Debug for Error"],["impl Debug for TrieEntry"],["impl Debug for WordInfoData"],["impl Debug for SurfaceProjection"],["impl Debug for CategoryType"],["impl Debug for Header"],["impl<T: DictionaryAccess> Debug for Morpheme<'_, T>"],["impl Debug for LexiconEntry"],["impl Debug for InfoSubset"],["impl Debug for Mode"],["impl Debug for HasWord"],["impl Debug for PluginError"],["impl Debug for ConfigError"],["impl Debug for CharacterCategory"],["impl Debug for BoundaryMode"],["impl Debug for CreatedWords"],["impl Debug for SystemDictVersion"],["impl Debug for SudachiError"],["impl Debug for BuildFailure"],["impl Debug for UserDictVersion"],["impl Debug for LexiconSetError"],["impl Debug for Node"],["impl Debug for DicBuildError"],["impl Debug for HeaderError"],["impl Debug for Config"],["impl Debug for WordId"],["impl Debug for ConfigBuilder"]] +};if (window.register_implementors) {window.register_implementors(implementors);} else {window.pending_implementors = implementors;}})() \ No newline at end of file diff --git a/rust/trait.impl/core/fmt/trait.Display.js b/rust/trait.impl/core/fmt/trait.Display.js new file mode 100644 index 00000000..03579d5e --- /dev/null +++ b/rust/trait.impl/core/fmt/trait.Display.js @@ -0,0 +1,3 @@ +(function() {var implementors = { +"sudachi":[["impl Display for Mode"],["impl Display for SudachiError"],["impl Display for LexiconSetError"],["impl Display for WordId"],["impl Display for ResultNode"],["impl Display for BuildFailure"],["impl Display for Error"],["impl Display for DicBuildError"],["impl Display for ConfigError"],["impl Display for HeaderError"],["impl Display for PluginError"]] +};if (window.register_implementors) {window.register_implementors(implementors);} else {window.pending_implementors = implementors;}})() \ No newline at end of file diff --git a/rust/implementors/core/fmt/trait.UpperHex.js b/rust/trait.impl/core/fmt/trait.LowerHex.js similarity index 67% rename from rust/implementors/core/fmt/trait.UpperHex.js rename to rust/trait.impl/core/fmt/trait.LowerHex.js index 582c2ba1..f5c7eb3b 100644 --- a/rust/implementors/core/fmt/trait.UpperHex.js +++ b/rust/trait.impl/core/fmt/trait.LowerHex.js @@ -1,3 +1,3 @@ (function() {var implementors = { -"sudachi":[["impl UpperHex for InfoSubset"],["impl UpperHex for CategoryType"]] +"sudachi":[["impl LowerHex for InfoSubset"],["impl LowerHex for CategoryType"]] };if (window.register_implementors) {window.register_implementors(implementors);} else {window.pending_implementors = implementors;}})() \ No newline at end of file diff --git a/rust/implementors/core/fmt/trait.Octal.js b/rust/trait.impl/core/fmt/trait.Octal.js similarity index 83% rename from rust/implementors/core/fmt/trait.Octal.js rename to rust/trait.impl/core/fmt/trait.Octal.js index 8d792b75..e7f220f3 100644 --- a/rust/implementors/core/fmt/trait.Octal.js +++ b/rust/trait.impl/core/fmt/trait.Octal.js @@ -1,3 +1,3 @@ (function() {var implementors = { -"sudachi":[["impl Octal for InfoSubset"],["impl Octal for CategoryType"]] +"sudachi":[["impl Octal for InfoSubset"],["impl Octal for CategoryType"]] };if (window.register_implementors) {window.register_implementors(implementors);} else {window.pending_implementors = implementors;}})() \ No newline at end of file diff --git a/rust/implementors/core/fmt/trait.LowerHex.js b/rust/trait.impl/core/fmt/trait.UpperHex.js similarity index 58% rename from rust/implementors/core/fmt/trait.LowerHex.js rename to rust/trait.impl/core/fmt/trait.UpperHex.js index 6e2f69d8..8e3a0233 100644 --- a/rust/implementors/core/fmt/trait.LowerHex.js +++ b/rust/trait.impl/core/fmt/trait.UpperHex.js @@ -1,3 +1,3 @@ (function() {var implementors = { -"sudachi":[["impl LowerHex for CategoryType"],["impl LowerHex for InfoSubset"]] +"sudachi":[["impl UpperHex for CategoryType"],["impl UpperHex for InfoSubset"]] };if (window.register_implementors) {window.register_implementors(implementors);} else {window.pending_implementors = implementors;}})() \ No newline at end of file diff --git a/rust/implementors/core/hash/trait.Hash.js b/rust/trait.impl/core/hash/trait.Hash.js similarity index 82% rename from rust/implementors/core/hash/trait.Hash.js rename to rust/trait.impl/core/hash/trait.Hash.js index 5e36120b..5e3e2fed 100644 --- a/rust/implementors/core/hash/trait.Hash.js +++ b/rust/trait.impl/core/hash/trait.Hash.js @@ -1,3 +1,3 @@ (function() {var implementors = { -"sudachi":[["impl Hash for CategoryType"],["impl Hash for WordId"]] +"sudachi":[["impl Hash for CategoryType"],["impl Hash for WordId"]] };if (window.register_implementors) {window.register_implementors(implementors);} else {window.pending_implementors = implementors;}})() \ No newline at end of file diff --git a/rust/trait.impl/core/iter/traits/collect/trait.Extend.js b/rust/trait.impl/core/iter/traits/collect/trait.Extend.js new file mode 100644 index 00000000..ddd231ff --- /dev/null +++ b/rust/trait.impl/core/iter/traits/collect/trait.Extend.js @@ -0,0 +1,3 @@ +(function() {var implementors = { +"sudachi":[["impl Extend<InfoSubset> for InfoSubset"],["impl Extend<CategoryType> for CategoryType"]] +};if (window.register_implementors) {window.register_implementors(implementors);} else {window.pending_implementors = implementors;}})() \ No newline at end of file diff --git a/rust/implementors/core/iter/traits/collect/trait.FromIterator.js b/rust/trait.impl/core/iter/traits/collect/trait.FromIterator.js similarity index 89% rename from rust/implementors/core/iter/traits/collect/trait.FromIterator.js rename to rust/trait.impl/core/iter/traits/collect/trait.FromIterator.js index 010ca760..04cb7758 100644 --- a/rust/implementors/core/iter/traits/collect/trait.FromIterator.js +++ b/rust/trait.impl/core/iter/traits/collect/trait.FromIterator.js @@ -1,3 +1,3 @@ (function() {var implementors = { -"sudachi":[["impl FromIterator<CategoryType> for CategoryType"],["impl FromIterator<InfoSubset> for InfoSubset"]] +"sudachi":[["impl FromIterator<CategoryType> for CategoryType"],["impl FromIterator<InfoSubset> for InfoSubset"]] };if (window.register_implementors) {window.register_implementors(implementors);} else {window.pending_implementors = implementors;}})() \ No newline at end of file diff --git a/rust/implementors/core/iter/traits/collect/trait.IntoIterator.js b/rust/trait.impl/core/iter/traits/collect/trait.IntoIterator.js similarity index 85% rename from rust/implementors/core/iter/traits/collect/trait.IntoIterator.js rename to rust/trait.impl/core/iter/traits/collect/trait.IntoIterator.js index e4fb98e4..ce3afca9 100644 --- a/rust/implementors/core/iter/traits/collect/trait.IntoIterator.js +++ b/rust/trait.impl/core/iter/traits/collect/trait.IntoIterator.js @@ -1,3 +1,3 @@ (function() {var implementors = { -"sudachi":[["impl IntoIterator for CategoryType"],["impl IntoIterator for InfoSubset"]] +"sudachi":[["impl IntoIterator for CategoryType"],["impl IntoIterator for InfoSubset"]] };if (window.register_implementors) {window.register_implementors(implementors);} else {window.pending_implementors = implementors;}})() \ No newline at end of file diff --git a/rust/implementors/core/iter/traits/exact_size/trait.ExactSizeIterator.js b/rust/trait.impl/core/iter/traits/exact_size/trait.ExactSizeIterator.js similarity index 91% rename from rust/implementors/core/iter/traits/exact_size/trait.ExactSizeIterator.js rename to rust/trait.impl/core/iter/traits/exact_size/trait.ExactSizeIterator.js index 4d7c39f5..5fbc7b2a 100644 --- a/rust/implementors/core/iter/traits/exact_size/trait.ExactSizeIterator.js +++ b/rust/trait.impl/core/iter/traits/exact_size/trait.ExactSizeIterator.js @@ -1,3 +1,3 @@ (function() {var implementors = { -"sudachi":[["impl<'a, T: DictionaryAccess> ExactSizeIterator for MorphemeIter<'a, T>"]] +"sudachi":[["impl<'a, T: DictionaryAccess> ExactSizeIterator for MorphemeIter<'a, T>"]] };if (window.register_implementors) {window.register_implementors(implementors);} else {window.pending_implementors = implementors;}})() \ No newline at end of file diff --git a/rust/trait.impl/core/iter/traits/iterator/trait.Iterator.js b/rust/trait.impl/core/iter/traits/iterator/trait.Iterator.js new file mode 100644 index 00000000..9ba771b3 --- /dev/null +++ b/rust/trait.impl/core/iter/traits/iterator/trait.Iterator.js @@ -0,0 +1,3 @@ +(function() {var implementors = { +"sudachi":[["impl Iterator for CharCategoryIter<'_>"],["impl Iterator for WordIdIter"],["impl Iterator for NodeSplitIterator<'_>"],["impl<'s, 'x> Iterator for SentenceIter<'s, 'x>"],["impl<'a, T: DictionaryAccess> Iterator for MorphemeIter<'a, T>"],["impl<'a> Iterator for TrieEntryIter<'a>"]] +};if (window.register_implementors) {window.register_implementors(implementors);} else {window.pending_implementors = implementors;}})() \ No newline at end of file diff --git a/rust/trait.impl/core/iter/traits/marker/trait.FusedIterator.js b/rust/trait.impl/core/iter/traits/marker/trait.FusedIterator.js new file mode 100644 index 00000000..1bd0c0c0 --- /dev/null +++ b/rust/trait.impl/core/iter/traits/marker/trait.FusedIterator.js @@ -0,0 +1,3 @@ +(function() {var implementors = { +"sudachi":[["impl<'a, T: DictionaryAccess> FusedIterator for MorphemeIter<'a, T>"],["impl FusedIterator for TrieEntryIter<'_>"],["impl FusedIterator for CharCategoryIter<'_>"],["impl FusedIterator for WordIdIter"],["impl FusedIterator for NodeSplitIterator<'_>"]] +};if (window.register_implementors) {window.register_implementors(implementors);} else {window.pending_implementors = implementors;}})() \ No newline at end of file diff --git a/rust/trait.impl/core/marker/trait.Copy.js b/rust/trait.impl/core/marker/trait.Copy.js new file mode 100644 index 00000000..9d4006a3 --- /dev/null +++ b/rust/trait.impl/core/marker/trait.Copy.js @@ -0,0 +1,3 @@ +(function() {var implementors = { +"sudachi":[["impl Copy for BoundaryMode"],["impl Copy for InfoSubset"],["impl Copy for CategoryType"],["impl Copy for SurfaceProjection"],["impl Copy for CreatedWords"],["impl Copy for Mode"],["impl Copy for WordId"],["impl Copy for HasWord"]] +};if (window.register_implementors) {window.register_implementors(implementors);} else {window.pending_implementors = implementors;}})() \ No newline at end of file diff --git a/rust/implementors/core/marker/trait.Freeze.js b/rust/trait.impl/core/marker/trait.Freeze.js similarity index 100% rename from rust/implementors/core/marker/trait.Freeze.js rename to rust/trait.impl/core/marker/trait.Freeze.js diff --git a/rust/implementors/core/marker/trait.Send.js b/rust/trait.impl/core/marker/trait.Send.js similarity index 81% rename from rust/implementors/core/marker/trait.Send.js rename to rust/trait.impl/core/marker/trait.Send.js index 09f5a910..90e5517b 100644 --- a/rust/implementors/core/marker/trait.Send.js +++ b/rust/trait.impl/core/marker/trait.Send.js @@ -1,3 +1,3 @@ (function() {var implementors = { -"sudachi":[["impl Send for CreatedWords",1,["sudachi::analysis::created::CreatedWords"]],["impl Send for HasWord",1,["sudachi::analysis::created::HasWord"]],["impl Send for Node",1,["sudachi::analysis::inner::Node"]],["impl Send for Lattice",1,["sudachi::analysis::lattice::Lattice"]],["impl<T> !Send for MorphemeList<T>",1,["sudachi::analysis::mlist::MorphemeList"]],["impl<'a, T> !Send for MorphemeIter<'a, T>",1,["sudachi::analysis::mlist::MorphemeIter"]],["impl<'a, T> !Send for Morpheme<'a, T>",1,["sudachi::analysis::morpheme::Morpheme"]],["impl Send for ResultNode",1,["sudachi::analysis::node::ResultNode"]],["impl<'a> Send for NodeSplitIterator<'a>",1,["sudachi::analysis::node::NodeSplitIterator"]],["impl<D> Send for StatefulTokenizer<D>where\n D: Send,",1,["sudachi::analysis::stateful_tokenizer::StatefulTokenizer"]],["impl<T> Send for StatelessTokenizer<T>where\n T: Send,",1,["sudachi::analysis::stateless_tokenizer::StatelessTokenizer"]],["impl Send for Mode",1,["sudachi::analysis::Mode"]],["impl Send for ConfigError",1,["sudachi::config::ConfigError"]],["impl Send for SurfaceProjection",1,["sudachi::config::SurfaceProjection"]],["impl Send for Config",1,["sudachi::config::Config"]],["impl Send for ConfigBuilder",1,["sudachi::config::ConfigBuilder"]],["impl Send for DicBuildError",1,["sudachi::dic::build::error::DicBuildError"]],["impl Send for BuildFailure",1,["sudachi::dic::build::error::BuildFailure"]],["impl Send for DictPartReport",1,["sudachi::dic::build::report::DictPartReport"]],["impl<'a> Send for DataSource<'a>",1,["sudachi::dic::build::DataSource"]],["impl Send for NoDic",1,["sudachi::dic::build::NoDic"]],["impl<D> Send for DictBuilder<D>where\n D: Send,",1,["sudachi::dic::build::DictBuilder"]],["impl Send for CategoryType",1,["sudachi::dic::category_type::CategoryType"]],["impl Send for Error",1,["sudachi::dic::character_category::Error"]],["impl Send for CharacterCategory",1,["sudachi::dic::character_category::CharacterCategory"]],["impl<'a> Send for CharCategoryIter<'a>",1,["sudachi::dic::character_category::CharCategoryIter"]],["impl<'a> Send for ConnectionMatrix<'a>",1,["sudachi::dic::connect::ConnectionMatrix"]],["impl Send for JapaneseDictionary",1,["sudachi::dic::dictionary::JapaneseDictionary"]],["impl<'a> Send for Grammar<'a>",1,["sudachi::dic::grammar::Grammar"]],["impl Send for HeaderError",1,["sudachi::dic::header::HeaderError"]],["impl Send for HeaderVersion",1,["sudachi::dic::header::HeaderVersion"]],["impl Send for SystemDictVersion",1,["sudachi::dic::header::SystemDictVersion"]],["impl Send for UserDictVersion",1,["sudachi::dic::header::UserDictVersion"]],["impl Send for Header",1,["sudachi::dic::header::Header"]],["impl Send for TrieEntry",1,["sudachi::dic::lexicon::trie::TrieEntry"]],["impl<'a> Send for Trie<'a>",1,["sudachi::dic::lexicon::trie::Trie"]],["impl<'a> Send for TrieEntryIter<'a>",1,["sudachi::dic::lexicon::trie::TrieEntryIter"]],["impl<'a> Send for WordIdTable<'a>",1,["sudachi::dic::lexicon::word_id_table::WordIdTable"]],["impl !Send for WordIdIter",1,["sudachi::dic::lexicon::word_id_table::WordIdIter"]],["impl<'a> Send for WordInfos<'a>",1,["sudachi::dic::lexicon::word_infos::WordInfos"]],["impl Send for WordInfoData",1,["sudachi::dic::lexicon::word_infos::WordInfoData"]],["impl Send for WordInfo",1,["sudachi::dic::lexicon::word_infos::WordInfo"]],["impl<'a> Send for WordParams<'a>",1,["sudachi::dic::lexicon::word_params::WordParams"]],["impl<'a> Send for Lexicon<'a>",1,["sudachi::dic::lexicon::Lexicon"]],["impl Send for LexiconEntry",1,["sudachi::dic::lexicon::LexiconEntry"]],["impl Send for LexiconSetError",1,["sudachi::dic::lexicon_set::LexiconSetError"]],["impl<'a> Send for LexiconSet<'a>",1,["sudachi::dic::lexicon_set::LexiconSet"]],["impl Send for Storage",1,["sudachi::dic::storage::Storage"]],["impl Send for SudachiDicData",1,["sudachi::dic::storage::SudachiDicData"]],["impl Send for InfoSubset",1,["sudachi::dic::subset::InfoSubset"]],["impl Send for WordId",1,["sudachi::dic::word_id::WordId"]],["impl<'a> Send for LoadedDictionary<'a>",1,["sudachi::dic::LoadedDictionary"]],["impl<'a> Send for DictionaryLoader<'a>",1,["sudachi::dic::DictionaryLoader"]],["impl Send for SudachiError",1,["sudachi::error::SudachiError"]],["impl<I> Send for SudachiNomError<I>where\n I: Send,",1,["sudachi::error::SudachiNomError"]],["impl<'a> Send for InputEditor<'a>",1,["sudachi::input_text::buffer::edit::InputEditor"]],["impl Send for InputBuffer",1,["sudachi::input_text::buffer::InputBuffer"]],["impl Send for DefaultInputTextPlugin",1,["sudachi::plugin::input_text::default_input_text::DefaultInputTextPlugin"]],["impl Send for MeCabOovPlugin",1,["sudachi::plugin::oov::mecab_oov::MeCabOovPlugin"]],["impl Send for BoundaryMode",1,["sudachi::plugin::oov::regex_oov::BoundaryMode"]],["impl Send for SimpleOovPlugin",1,["sudachi::plugin::oov::simple_oov::SimpleOovPlugin"]],["impl Send for JoinKatakanaOovPlugin",1,["sudachi::plugin::path_rewrite::join_katakana_oov::JoinKatakanaOovPlugin"]],["impl Send for JoinNumericPlugin",1,["sudachi::plugin::path_rewrite::join_numeric::JoinNumericPlugin"]],["impl Send for PluginError",1,["sudachi::plugin::PluginError"]],["impl<'a> Send for NonBreakChecker<'a>",1,["sudachi::sentence_detector::NonBreakChecker"]],["impl Send for SentenceDetector",1,["sudachi::sentence_detector::SentenceDetector"]],["impl<'s, 'x> Send for SentenceIter<'s, 'x>",1,["sudachi::sentence_splitter::SentenceIter"]],["impl<'a> Send for SentenceSplitter<'a>",1,["sudachi::sentence_splitter::SentenceSplitter"]],["impl Send for PosMatcher",1,["sudachi::pos::PosMatcher"]]] +"sudachi":[["impl Send for CreatedWords",1,["sudachi::analysis::created::CreatedWords"]],["impl Send for HasWord",1,["sudachi::analysis::created::HasWord"]],["impl Send for Node",1,["sudachi::analysis::inner::Node"]],["impl Send for Lattice",1,["sudachi::analysis::lattice::Lattice"]],["impl<T> !Send for MorphemeList<T>",1,["sudachi::analysis::mlist::MorphemeList"]],["impl<'a, T> !Send for MorphemeIter<'a, T>",1,["sudachi::analysis::mlist::MorphemeIter"]],["impl<'a, T> !Send for Morpheme<'a, T>",1,["sudachi::analysis::morpheme::Morpheme"]],["impl Send for ResultNode",1,["sudachi::analysis::node::ResultNode"]],["impl<'a> Send for NodeSplitIterator<'a>",1,["sudachi::analysis::node::NodeSplitIterator"]],["impl<D> Send for StatefulTokenizer<D>where\n D: Send,",1,["sudachi::analysis::stateful_tokenizer::StatefulTokenizer"]],["impl<T> Send for StatelessTokenizer<T>where\n T: Send,",1,["sudachi::analysis::stateless_tokenizer::StatelessTokenizer"]],["impl Send for Mode",1,["sudachi::analysis::Mode"]],["impl Send for ConfigError",1,["sudachi::config::ConfigError"]],["impl Send for SurfaceProjection",1,["sudachi::config::SurfaceProjection"]],["impl Send for Config",1,["sudachi::config::Config"]],["impl Send for ConfigBuilder",1,["sudachi::config::ConfigBuilder"]],["impl Send for DicBuildError",1,["sudachi::dic::build::error::DicBuildError"]],["impl Send for BuildFailure",1,["sudachi::dic::build::error::BuildFailure"]],["impl Send for DictPartReport",1,["sudachi::dic::build::report::DictPartReport"]],["impl<'a> Send for DataSource<'a>",1,["sudachi::dic::build::DataSource"]],["impl Send for NoDic",1,["sudachi::dic::build::NoDic"]],["impl<D> Send for DictBuilder<D>where\n D: Send,",1,["sudachi::dic::build::DictBuilder"]],["impl Send for CategoryType",1,["sudachi::dic::category_type::CategoryType"]],["impl Send for Error",1,["sudachi::dic::character_category::Error"]],["impl Send for CharacterCategory",1,["sudachi::dic::character_category::CharacterCategory"]],["impl<'a> Send for CharCategoryIter<'a>",1,["sudachi::dic::character_category::CharCategoryIter"]],["impl<'a> Send for ConnectionMatrix<'a>",1,["sudachi::dic::connect::ConnectionMatrix"]],["impl Send for JapaneseDictionary",1,["sudachi::dic::dictionary::JapaneseDictionary"]],["impl<'a> Send for Grammar<'a>",1,["sudachi::dic::grammar::Grammar"]],["impl Send for HeaderError",1,["sudachi::dic::header::HeaderError"]],["impl Send for HeaderVersion",1,["sudachi::dic::header::HeaderVersion"]],["impl Send for SystemDictVersion",1,["sudachi::dic::header::SystemDictVersion"]],["impl Send for UserDictVersion",1,["sudachi::dic::header::UserDictVersion"]],["impl Send for Header",1,["sudachi::dic::header::Header"]],["impl Send for TrieEntry",1,["sudachi::dic::lexicon::trie::TrieEntry"]],["impl<'a> Send for Trie<'a>",1,["sudachi::dic::lexicon::trie::Trie"]],["impl<'a> Send for TrieEntryIter<'a>",1,["sudachi::dic::lexicon::trie::TrieEntryIter"]],["impl<'a> Send for WordIdTable<'a>",1,["sudachi::dic::lexicon::word_id_table::WordIdTable"]],["impl !Send for WordIdIter",1,["sudachi::dic::lexicon::word_id_table::WordIdIter"]],["impl<'a> Send for WordInfos<'a>",1,["sudachi::dic::lexicon::word_infos::WordInfos"]],["impl Send for WordInfoData",1,["sudachi::dic::lexicon::word_infos::WordInfoData"]],["impl Send for WordInfo",1,["sudachi::dic::lexicon::word_infos::WordInfo"]],["impl<'a> Send for WordParams<'a>",1,["sudachi::dic::lexicon::word_params::WordParams"]],["impl<'a> Send for Lexicon<'a>",1,["sudachi::dic::lexicon::Lexicon"]],["impl Send for LexiconEntry",1,["sudachi::dic::lexicon::LexiconEntry"]],["impl Send for LexiconSetError",1,["sudachi::dic::lexicon_set::LexiconSetError"]],["impl<'a> Send for LexiconSet<'a>",1,["sudachi::dic::lexicon_set::LexiconSet"]],["impl Send for Storage",1,["sudachi::dic::storage::Storage"]],["impl Send for SudachiDicData",1,["sudachi::dic::storage::SudachiDicData"]],["impl Send for InfoSubset",1,["sudachi::dic::subset::InfoSubset"]],["impl Send for WordId",1,["sudachi::dic::word_id::WordId"]],["impl<'a> Send for LoadedDictionary<'a>",1,["sudachi::dic::LoadedDictionary"]],["impl<'a> Send for DictionaryLoader<'a>",1,["sudachi::dic::DictionaryLoader"]],["impl Send for SudachiError",1,["sudachi::error::SudachiError"]],["impl<I> Send for SudachiNomError<I>where\n I: Send,",1,["sudachi::error::SudachiNomError"]],["impl<'a> Send for InputEditor<'a>",1,["sudachi::input_text::buffer::edit::InputEditor"]],["impl Send for InputBuffer",1,["sudachi::input_text::buffer::InputBuffer"]],["impl Send for DefaultInputTextPlugin",1,["sudachi::plugin::input_text::default_input_text::DefaultInputTextPlugin"]],["impl Send for MeCabOovPlugin",1,["sudachi::plugin::oov::mecab_oov::MeCabOovPlugin"]],["impl Send for BoundaryMode",1,["sudachi::plugin::oov::regex_oov::BoundaryMode"]],["impl Send for SimpleOovPlugin",1,["sudachi::plugin::oov::simple_oov::SimpleOovPlugin"]],["impl Send for JoinKatakanaOovPlugin",1,["sudachi::plugin::path_rewrite::join_katakana_oov::JoinKatakanaOovPlugin"]],["impl Send for JoinNumericPlugin",1,["sudachi::plugin::path_rewrite::join_numeric::JoinNumericPlugin"]],["impl Send for PluginError",1,["sudachi::plugin::PluginError"]],["impl<'a> Send for NonBreakChecker<'a>",1,["sudachi::sentence_detector::NonBreakChecker"]],["impl Send for SentenceDetector",1,["sudachi::sentence_detector::SentenceDetector"]],["impl<'s, 'x> Send for SentenceIter<'s, 'x>",1,["sudachi::sentence_splitter::SentenceIter"]],["impl<'a> Send for SentenceSplitter<'a>",1,["sudachi::sentence_splitter::SentenceSplitter"]],["impl Send for PosMatcher",1,["sudachi::pos::PosMatcher"]]] };if (window.register_implementors) {window.register_implementors(implementors);} else {window.pending_implementors = implementors;}})() \ No newline at end of file diff --git a/rust/trait.impl/core/marker/trait.StructuralEq.js b/rust/trait.impl/core/marker/trait.StructuralEq.js new file mode 100644 index 00000000..673547fb --- /dev/null +++ b/rust/trait.impl/core/marker/trait.StructuralEq.js @@ -0,0 +1,3 @@ +(function() {var implementors = { +"sudachi":[["impl StructuralEq for SystemDictVersion"],["impl StructuralEq for CategoryType"],["impl StructuralEq for LexiconSetError"],["impl StructuralEq for UserDictVersion"],["impl StructuralEq for BoundaryMode"],["impl StructuralEq for Error"],["impl StructuralEq for InfoSubset"],["impl StructuralEq for Header"],["impl StructuralEq for HeaderVersion"],["impl StructuralEq for HeaderError"],["impl StructuralEq for HasWord"],["impl StructuralEq for CreatedWords"],["impl StructuralEq for SurfaceProjection"],["impl StructuralEq for WordId"],["impl StructuralEq for TrieEntry"],["impl StructuralEq for Mode"],["impl StructuralEq for LexiconEntry"]] +};if (window.register_implementors) {window.register_implementors(implementors);} else {window.pending_implementors = implementors;}})() \ No newline at end of file diff --git a/rust/trait.impl/core/marker/trait.StructuralPartialEq.js b/rust/trait.impl/core/marker/trait.StructuralPartialEq.js new file mode 100644 index 00000000..a2587b63 --- /dev/null +++ b/rust/trait.impl/core/marker/trait.StructuralPartialEq.js @@ -0,0 +1,3 @@ +(function() {var implementors = { +"sudachi":[["impl StructuralPartialEq for HeaderVersion"],["impl StructuralPartialEq for BoundaryMode"],["impl StructuralPartialEq for LexiconSetError"],["impl StructuralPartialEq for HeaderError"],["impl StructuralPartialEq for SurfaceProjection"],["impl StructuralPartialEq for TrieEntry"],["impl StructuralPartialEq for SystemDictVersion"],["impl StructuralPartialEq for LexiconEntry"],["impl StructuralPartialEq for InfoSubset"],["impl StructuralPartialEq for CategoryType"],["impl StructuralPartialEq for WordId"],["impl StructuralPartialEq for CreatedWords"],["impl StructuralPartialEq for HasWord"],["impl StructuralPartialEq for UserDictVersion"],["impl StructuralPartialEq for Error"],["impl<I> StructuralPartialEq for SudachiNomError<I>"],["impl StructuralPartialEq for Header"],["impl StructuralPartialEq for Mode"]] +};if (window.register_implementors) {window.register_implementors(implementors);} else {window.pending_implementors = implementors;}})() \ No newline at end of file diff --git a/rust/implementors/core/marker/trait.Sync.js b/rust/trait.impl/core/marker/trait.Sync.js similarity index 81% rename from rust/implementors/core/marker/trait.Sync.js rename to rust/trait.impl/core/marker/trait.Sync.js index cce0c1dd..0e3f6720 100644 --- a/rust/implementors/core/marker/trait.Sync.js +++ b/rust/trait.impl/core/marker/trait.Sync.js @@ -1,3 +1,3 @@ (function() {var implementors = { -"sudachi":[["impl Sync for CreatedWords",1,["sudachi::analysis::created::CreatedWords"]],["impl Sync for HasWord",1,["sudachi::analysis::created::HasWord"]],["impl Sync for Node",1,["sudachi::analysis::inner::Node"]],["impl Sync for Lattice",1,["sudachi::analysis::lattice::Lattice"]],["impl<T> !Sync for MorphemeList<T>",1,["sudachi::analysis::mlist::MorphemeList"]],["impl<'a, T> !Sync for MorphemeIter<'a, T>",1,["sudachi::analysis::mlist::MorphemeIter"]],["impl<'a, T> !Sync for Morpheme<'a, T>",1,["sudachi::analysis::morpheme::Morpheme"]],["impl Sync for ResultNode",1,["sudachi::analysis::node::ResultNode"]],["impl<'a> Sync for NodeSplitIterator<'a>",1,["sudachi::analysis::node::NodeSplitIterator"]],["impl<D> Sync for StatefulTokenizer<D>where\n D: Sync,",1,["sudachi::analysis::stateful_tokenizer::StatefulTokenizer"]],["impl<T> Sync for StatelessTokenizer<T>where\n T: Sync,",1,["sudachi::analysis::stateless_tokenizer::StatelessTokenizer"]],["impl Sync for Mode",1,["sudachi::analysis::Mode"]],["impl Sync for ConfigError",1,["sudachi::config::ConfigError"]],["impl Sync for SurfaceProjection",1,["sudachi::config::SurfaceProjection"]],["impl Sync for Config",1,["sudachi::config::Config"]],["impl Sync for ConfigBuilder",1,["sudachi::config::ConfigBuilder"]],["impl Sync for DicBuildError",1,["sudachi::dic::build::error::DicBuildError"]],["impl Sync for BuildFailure",1,["sudachi::dic::build::error::BuildFailure"]],["impl Sync for DictPartReport",1,["sudachi::dic::build::report::DictPartReport"]],["impl<'a> Sync for DataSource<'a>",1,["sudachi::dic::build::DataSource"]],["impl Sync for NoDic",1,["sudachi::dic::build::NoDic"]],["impl<D> Sync for DictBuilder<D>where\n D: Sync,",1,["sudachi::dic::build::DictBuilder"]],["impl Sync for CategoryType",1,["sudachi::dic::category_type::CategoryType"]],["impl Sync for Error",1,["sudachi::dic::character_category::Error"]],["impl Sync for CharacterCategory",1,["sudachi::dic::character_category::CharacterCategory"]],["impl<'a> Sync for CharCategoryIter<'a>",1,["sudachi::dic::character_category::CharCategoryIter"]],["impl<'a> Sync for ConnectionMatrix<'a>",1,["sudachi::dic::connect::ConnectionMatrix"]],["impl Sync for JapaneseDictionary",1,["sudachi::dic::dictionary::JapaneseDictionary"]],["impl<'a> Sync for Grammar<'a>",1,["sudachi::dic::grammar::Grammar"]],["impl Sync for HeaderError",1,["sudachi::dic::header::HeaderError"]],["impl Sync for HeaderVersion",1,["sudachi::dic::header::HeaderVersion"]],["impl Sync for SystemDictVersion",1,["sudachi::dic::header::SystemDictVersion"]],["impl Sync for UserDictVersion",1,["sudachi::dic::header::UserDictVersion"]],["impl Sync for Header",1,["sudachi::dic::header::Header"]],["impl Sync for TrieEntry",1,["sudachi::dic::lexicon::trie::TrieEntry"]],["impl<'a> Sync for Trie<'a>",1,["sudachi::dic::lexicon::trie::Trie"]],["impl<'a> Sync for TrieEntryIter<'a>",1,["sudachi::dic::lexicon::trie::TrieEntryIter"]],["impl<'a> Sync for WordIdTable<'a>",1,["sudachi::dic::lexicon::word_id_table::WordIdTable"]],["impl !Sync for WordIdIter",1,["sudachi::dic::lexicon::word_id_table::WordIdIter"]],["impl<'a> Sync for WordInfos<'a>",1,["sudachi::dic::lexicon::word_infos::WordInfos"]],["impl Sync for WordInfoData",1,["sudachi::dic::lexicon::word_infos::WordInfoData"]],["impl Sync for WordInfo",1,["sudachi::dic::lexicon::word_infos::WordInfo"]],["impl<'a> Sync for WordParams<'a>",1,["sudachi::dic::lexicon::word_params::WordParams"]],["impl<'a> Sync for Lexicon<'a>",1,["sudachi::dic::lexicon::Lexicon"]],["impl Sync for LexiconEntry",1,["sudachi::dic::lexicon::LexiconEntry"]],["impl Sync for LexiconSetError",1,["sudachi::dic::lexicon_set::LexiconSetError"]],["impl<'a> Sync for LexiconSet<'a>",1,["sudachi::dic::lexicon_set::LexiconSet"]],["impl Sync for Storage",1,["sudachi::dic::storage::Storage"]],["impl Sync for SudachiDicData",1,["sudachi::dic::storage::SudachiDicData"]],["impl Sync for InfoSubset",1,["sudachi::dic::subset::InfoSubset"]],["impl Sync for WordId",1,["sudachi::dic::word_id::WordId"]],["impl<'a> Sync for LoadedDictionary<'a>",1,["sudachi::dic::LoadedDictionary"]],["impl<'a> Sync for DictionaryLoader<'a>",1,["sudachi::dic::DictionaryLoader"]],["impl Sync for SudachiError",1,["sudachi::error::SudachiError"]],["impl<I> Sync for SudachiNomError<I>where\n I: Sync,",1,["sudachi::error::SudachiNomError"]],["impl<'a> Sync for InputEditor<'a>",1,["sudachi::input_text::buffer::edit::InputEditor"]],["impl Sync for InputBuffer",1,["sudachi::input_text::buffer::InputBuffer"]],["impl Sync for DefaultInputTextPlugin",1,["sudachi::plugin::input_text::default_input_text::DefaultInputTextPlugin"]],["impl Sync for MeCabOovPlugin",1,["sudachi::plugin::oov::mecab_oov::MeCabOovPlugin"]],["impl Sync for BoundaryMode",1,["sudachi::plugin::oov::regex_oov::BoundaryMode"]],["impl Sync for SimpleOovPlugin",1,["sudachi::plugin::oov::simple_oov::SimpleOovPlugin"]],["impl Sync for JoinKatakanaOovPlugin",1,["sudachi::plugin::path_rewrite::join_katakana_oov::JoinKatakanaOovPlugin"]],["impl Sync for JoinNumericPlugin",1,["sudachi::plugin::path_rewrite::join_numeric::JoinNumericPlugin"]],["impl Sync for PluginError",1,["sudachi::plugin::PluginError"]],["impl<'a> Sync for NonBreakChecker<'a>",1,["sudachi::sentence_detector::NonBreakChecker"]],["impl Sync for SentenceDetector",1,["sudachi::sentence_detector::SentenceDetector"]],["impl<'s, 'x> Sync for SentenceIter<'s, 'x>",1,["sudachi::sentence_splitter::SentenceIter"]],["impl<'a> Sync for SentenceSplitter<'a>",1,["sudachi::sentence_splitter::SentenceSplitter"]],["impl Sync for PosMatcher",1,["sudachi::pos::PosMatcher"]]] +"sudachi":[["impl Sync for CreatedWords",1,["sudachi::analysis::created::CreatedWords"]],["impl Sync for HasWord",1,["sudachi::analysis::created::HasWord"]],["impl Sync for Node",1,["sudachi::analysis::inner::Node"]],["impl Sync for Lattice",1,["sudachi::analysis::lattice::Lattice"]],["impl<T> !Sync for MorphemeList<T>",1,["sudachi::analysis::mlist::MorphemeList"]],["impl<'a, T> !Sync for MorphemeIter<'a, T>",1,["sudachi::analysis::mlist::MorphemeIter"]],["impl<'a, T> !Sync for Morpheme<'a, T>",1,["sudachi::analysis::morpheme::Morpheme"]],["impl Sync for ResultNode",1,["sudachi::analysis::node::ResultNode"]],["impl<'a> Sync for NodeSplitIterator<'a>",1,["sudachi::analysis::node::NodeSplitIterator"]],["impl<D> Sync for StatefulTokenizer<D>where\n D: Sync,",1,["sudachi::analysis::stateful_tokenizer::StatefulTokenizer"]],["impl<T> Sync for StatelessTokenizer<T>where\n T: Sync,",1,["sudachi::analysis::stateless_tokenizer::StatelessTokenizer"]],["impl Sync for Mode",1,["sudachi::analysis::Mode"]],["impl Sync for ConfigError",1,["sudachi::config::ConfigError"]],["impl Sync for SurfaceProjection",1,["sudachi::config::SurfaceProjection"]],["impl Sync for Config",1,["sudachi::config::Config"]],["impl Sync for ConfigBuilder",1,["sudachi::config::ConfigBuilder"]],["impl Sync for DicBuildError",1,["sudachi::dic::build::error::DicBuildError"]],["impl Sync for BuildFailure",1,["sudachi::dic::build::error::BuildFailure"]],["impl Sync for DictPartReport",1,["sudachi::dic::build::report::DictPartReport"]],["impl<'a> Sync for DataSource<'a>",1,["sudachi::dic::build::DataSource"]],["impl Sync for NoDic",1,["sudachi::dic::build::NoDic"]],["impl<D> Sync for DictBuilder<D>where\n D: Sync,",1,["sudachi::dic::build::DictBuilder"]],["impl Sync for CategoryType",1,["sudachi::dic::category_type::CategoryType"]],["impl Sync for Error",1,["sudachi::dic::character_category::Error"]],["impl Sync for CharacterCategory",1,["sudachi::dic::character_category::CharacterCategory"]],["impl<'a> Sync for CharCategoryIter<'a>",1,["sudachi::dic::character_category::CharCategoryIter"]],["impl<'a> Sync for ConnectionMatrix<'a>",1,["sudachi::dic::connect::ConnectionMatrix"]],["impl Sync for JapaneseDictionary",1,["sudachi::dic::dictionary::JapaneseDictionary"]],["impl<'a> Sync for Grammar<'a>",1,["sudachi::dic::grammar::Grammar"]],["impl Sync for HeaderError",1,["sudachi::dic::header::HeaderError"]],["impl Sync for HeaderVersion",1,["sudachi::dic::header::HeaderVersion"]],["impl Sync for SystemDictVersion",1,["sudachi::dic::header::SystemDictVersion"]],["impl Sync for UserDictVersion",1,["sudachi::dic::header::UserDictVersion"]],["impl Sync for Header",1,["sudachi::dic::header::Header"]],["impl Sync for TrieEntry",1,["sudachi::dic::lexicon::trie::TrieEntry"]],["impl<'a> Sync for Trie<'a>",1,["sudachi::dic::lexicon::trie::Trie"]],["impl<'a> Sync for TrieEntryIter<'a>",1,["sudachi::dic::lexicon::trie::TrieEntryIter"]],["impl<'a> Sync for WordIdTable<'a>",1,["sudachi::dic::lexicon::word_id_table::WordIdTable"]],["impl !Sync for WordIdIter",1,["sudachi::dic::lexicon::word_id_table::WordIdIter"]],["impl<'a> Sync for WordInfos<'a>",1,["sudachi::dic::lexicon::word_infos::WordInfos"]],["impl Sync for WordInfoData",1,["sudachi::dic::lexicon::word_infos::WordInfoData"]],["impl Sync for WordInfo",1,["sudachi::dic::lexicon::word_infos::WordInfo"]],["impl<'a> Sync for WordParams<'a>",1,["sudachi::dic::lexicon::word_params::WordParams"]],["impl<'a> Sync for Lexicon<'a>",1,["sudachi::dic::lexicon::Lexicon"]],["impl Sync for LexiconEntry",1,["sudachi::dic::lexicon::LexiconEntry"]],["impl Sync for LexiconSetError",1,["sudachi::dic::lexicon_set::LexiconSetError"]],["impl<'a> Sync for LexiconSet<'a>",1,["sudachi::dic::lexicon_set::LexiconSet"]],["impl Sync for Storage",1,["sudachi::dic::storage::Storage"]],["impl Sync for SudachiDicData",1,["sudachi::dic::storage::SudachiDicData"]],["impl Sync for InfoSubset",1,["sudachi::dic::subset::InfoSubset"]],["impl Sync for WordId",1,["sudachi::dic::word_id::WordId"]],["impl<'a> Sync for LoadedDictionary<'a>",1,["sudachi::dic::LoadedDictionary"]],["impl<'a> Sync for DictionaryLoader<'a>",1,["sudachi::dic::DictionaryLoader"]],["impl Sync for SudachiError",1,["sudachi::error::SudachiError"]],["impl<I> Sync for SudachiNomError<I>where\n I: Sync,",1,["sudachi::error::SudachiNomError"]],["impl<'a> Sync for InputEditor<'a>",1,["sudachi::input_text::buffer::edit::InputEditor"]],["impl Sync for InputBuffer",1,["sudachi::input_text::buffer::InputBuffer"]],["impl Sync for DefaultInputTextPlugin",1,["sudachi::plugin::input_text::default_input_text::DefaultInputTextPlugin"]],["impl Sync for MeCabOovPlugin",1,["sudachi::plugin::oov::mecab_oov::MeCabOovPlugin"]],["impl Sync for BoundaryMode",1,["sudachi::plugin::oov::regex_oov::BoundaryMode"]],["impl Sync for SimpleOovPlugin",1,["sudachi::plugin::oov::simple_oov::SimpleOovPlugin"]],["impl Sync for JoinKatakanaOovPlugin",1,["sudachi::plugin::path_rewrite::join_katakana_oov::JoinKatakanaOovPlugin"]],["impl Sync for JoinNumericPlugin",1,["sudachi::plugin::path_rewrite::join_numeric::JoinNumericPlugin"]],["impl Sync for PluginError",1,["sudachi::plugin::PluginError"]],["impl<'a> Sync for NonBreakChecker<'a>",1,["sudachi::sentence_detector::NonBreakChecker"]],["impl Sync for SentenceDetector",1,["sudachi::sentence_detector::SentenceDetector"]],["impl<'s, 'x> Sync for SentenceIter<'s, 'x>",1,["sudachi::sentence_splitter::SentenceIter"]],["impl<'a> Sync for SentenceSplitter<'a>",1,["sudachi::sentence_splitter::SentenceSplitter"]],["impl Sync for PosMatcher",1,["sudachi::pos::PosMatcher"]]] };if (window.register_implementors) {window.register_implementors(implementors);} else {window.pending_implementors = implementors;}})() \ No newline at end of file diff --git a/rust/implementors/core/marker/trait.Unpin.js b/rust/trait.impl/core/marker/trait.Unpin.js similarity index 81% rename from rust/implementors/core/marker/trait.Unpin.js rename to rust/trait.impl/core/marker/trait.Unpin.js index 0a87b654..4d340af6 100644 --- a/rust/implementors/core/marker/trait.Unpin.js +++ b/rust/trait.impl/core/marker/trait.Unpin.js @@ -1,3 +1,3 @@ (function() {var implementors = { -"sudachi":[["impl Unpin for CreatedWords",1,["sudachi::analysis::created::CreatedWords"]],["impl Unpin for HasWord",1,["sudachi::analysis::created::HasWord"]],["impl Unpin for Node",1,["sudachi::analysis::inner::Node"]],["impl Unpin for Lattice",1,["sudachi::analysis::lattice::Lattice"]],["impl<T> Unpin for MorphemeList<T>where\n T: Unpin,",1,["sudachi::analysis::mlist::MorphemeList"]],["impl<'a, T> Unpin for MorphemeIter<'a, T>",1,["sudachi::analysis::mlist::MorphemeIter"]],["impl<'a, T> Unpin for Morpheme<'a, T>",1,["sudachi::analysis::morpheme::Morpheme"]],["impl Unpin for ResultNode",1,["sudachi::analysis::node::ResultNode"]],["impl<'a> Unpin for NodeSplitIterator<'a>",1,["sudachi::analysis::node::NodeSplitIterator"]],["impl<D> Unpin for StatefulTokenizer<D>where\n D: Unpin,",1,["sudachi::analysis::stateful_tokenizer::StatefulTokenizer"]],["impl<T> Unpin for StatelessTokenizer<T>where\n T: Unpin,",1,["sudachi::analysis::stateless_tokenizer::StatelessTokenizer"]],["impl Unpin for Mode",1,["sudachi::analysis::Mode"]],["impl Unpin for ConfigError",1,["sudachi::config::ConfigError"]],["impl Unpin for SurfaceProjection",1,["sudachi::config::SurfaceProjection"]],["impl Unpin for Config",1,["sudachi::config::Config"]],["impl Unpin for ConfigBuilder",1,["sudachi::config::ConfigBuilder"]],["impl Unpin for DicBuildError",1,["sudachi::dic::build::error::DicBuildError"]],["impl Unpin for BuildFailure",1,["sudachi::dic::build::error::BuildFailure"]],["impl Unpin for DictPartReport",1,["sudachi::dic::build::report::DictPartReport"]],["impl<'a> Unpin for DataSource<'a>",1,["sudachi::dic::build::DataSource"]],["impl Unpin for NoDic",1,["sudachi::dic::build::NoDic"]],["impl<D> Unpin for DictBuilder<D>where\n D: Unpin,",1,["sudachi::dic::build::DictBuilder"]],["impl Unpin for CategoryType",1,["sudachi::dic::category_type::CategoryType"]],["impl Unpin for Error",1,["sudachi::dic::character_category::Error"]],["impl Unpin for CharacterCategory",1,["sudachi::dic::character_category::CharacterCategory"]],["impl<'a> Unpin for CharCategoryIter<'a>",1,["sudachi::dic::character_category::CharCategoryIter"]],["impl<'a> Unpin for ConnectionMatrix<'a>",1,["sudachi::dic::connect::ConnectionMatrix"]],["impl Unpin for JapaneseDictionary",1,["sudachi::dic::dictionary::JapaneseDictionary"]],["impl<'a> Unpin for Grammar<'a>",1,["sudachi::dic::grammar::Grammar"]],["impl Unpin for HeaderError",1,["sudachi::dic::header::HeaderError"]],["impl Unpin for HeaderVersion",1,["sudachi::dic::header::HeaderVersion"]],["impl Unpin for SystemDictVersion",1,["sudachi::dic::header::SystemDictVersion"]],["impl Unpin for UserDictVersion",1,["sudachi::dic::header::UserDictVersion"]],["impl Unpin for Header",1,["sudachi::dic::header::Header"]],["impl Unpin for TrieEntry",1,["sudachi::dic::lexicon::trie::TrieEntry"]],["impl<'a> Unpin for Trie<'a>",1,["sudachi::dic::lexicon::trie::Trie"]],["impl<'a> Unpin for TrieEntryIter<'a>",1,["sudachi::dic::lexicon::trie::TrieEntryIter"]],["impl<'a> Unpin for WordIdTable<'a>",1,["sudachi::dic::lexicon::word_id_table::WordIdTable"]],["impl Unpin for WordIdIter",1,["sudachi::dic::lexicon::word_id_table::WordIdIter"]],["impl<'a> Unpin for WordInfos<'a>",1,["sudachi::dic::lexicon::word_infos::WordInfos"]],["impl Unpin for WordInfoData",1,["sudachi::dic::lexicon::word_infos::WordInfoData"]],["impl Unpin for WordInfo",1,["sudachi::dic::lexicon::word_infos::WordInfo"]],["impl<'a> Unpin for WordParams<'a>",1,["sudachi::dic::lexicon::word_params::WordParams"]],["impl<'a> Unpin for Lexicon<'a>",1,["sudachi::dic::lexicon::Lexicon"]],["impl Unpin for LexiconEntry",1,["sudachi::dic::lexicon::LexiconEntry"]],["impl Unpin for LexiconSetError",1,["sudachi::dic::lexicon_set::LexiconSetError"]],["impl<'a> Unpin for LexiconSet<'a>",1,["sudachi::dic::lexicon_set::LexiconSet"]],["impl Unpin for Storage",1,["sudachi::dic::storage::Storage"]],["impl Unpin for SudachiDicData",1,["sudachi::dic::storage::SudachiDicData"]],["impl Unpin for InfoSubset",1,["sudachi::dic::subset::InfoSubset"]],["impl Unpin for WordId",1,["sudachi::dic::word_id::WordId"]],["impl<'a> Unpin for LoadedDictionary<'a>",1,["sudachi::dic::LoadedDictionary"]],["impl<'a> Unpin for DictionaryLoader<'a>",1,["sudachi::dic::DictionaryLoader"]],["impl Unpin for SudachiError",1,["sudachi::error::SudachiError"]],["impl<I> Unpin for SudachiNomError<I>where\n I: Unpin,",1,["sudachi::error::SudachiNomError"]],["impl<'a> Unpin for InputEditor<'a>",1,["sudachi::input_text::buffer::edit::InputEditor"]],["impl Unpin for InputBuffer",1,["sudachi::input_text::buffer::InputBuffer"]],["impl Unpin for DefaultInputTextPlugin",1,["sudachi::plugin::input_text::default_input_text::DefaultInputTextPlugin"]],["impl Unpin for MeCabOovPlugin",1,["sudachi::plugin::oov::mecab_oov::MeCabOovPlugin"]],["impl Unpin for BoundaryMode",1,["sudachi::plugin::oov::regex_oov::BoundaryMode"]],["impl Unpin for SimpleOovPlugin",1,["sudachi::plugin::oov::simple_oov::SimpleOovPlugin"]],["impl Unpin for JoinKatakanaOovPlugin",1,["sudachi::plugin::path_rewrite::join_katakana_oov::JoinKatakanaOovPlugin"]],["impl Unpin for JoinNumericPlugin",1,["sudachi::plugin::path_rewrite::join_numeric::JoinNumericPlugin"]],["impl Unpin for PluginError",1,["sudachi::plugin::PluginError"]],["impl<'a> Unpin for NonBreakChecker<'a>",1,["sudachi::sentence_detector::NonBreakChecker"]],["impl Unpin for SentenceDetector",1,["sudachi::sentence_detector::SentenceDetector"]],["impl<'s, 'x> Unpin for SentenceIter<'s, 'x>",1,["sudachi::sentence_splitter::SentenceIter"]],["impl<'a> Unpin for SentenceSplitter<'a>",1,["sudachi::sentence_splitter::SentenceSplitter"]],["impl Unpin for PosMatcher",1,["sudachi::pos::PosMatcher"]]] +"sudachi":[["impl Unpin for CreatedWords",1,["sudachi::analysis::created::CreatedWords"]],["impl Unpin for HasWord",1,["sudachi::analysis::created::HasWord"]],["impl Unpin for Node",1,["sudachi::analysis::inner::Node"]],["impl Unpin for Lattice",1,["sudachi::analysis::lattice::Lattice"]],["impl<T> Unpin for MorphemeList<T>where\n T: Unpin,",1,["sudachi::analysis::mlist::MorphemeList"]],["impl<'a, T> Unpin for MorphemeIter<'a, T>",1,["sudachi::analysis::mlist::MorphemeIter"]],["impl<'a, T> Unpin for Morpheme<'a, T>",1,["sudachi::analysis::morpheme::Morpheme"]],["impl Unpin for ResultNode",1,["sudachi::analysis::node::ResultNode"]],["impl<'a> Unpin for NodeSplitIterator<'a>",1,["sudachi::analysis::node::NodeSplitIterator"]],["impl<D> Unpin for StatefulTokenizer<D>where\n D: Unpin,",1,["sudachi::analysis::stateful_tokenizer::StatefulTokenizer"]],["impl<T> Unpin for StatelessTokenizer<T>where\n T: Unpin,",1,["sudachi::analysis::stateless_tokenizer::StatelessTokenizer"]],["impl Unpin for Mode",1,["sudachi::analysis::Mode"]],["impl Unpin for ConfigError",1,["sudachi::config::ConfigError"]],["impl Unpin for SurfaceProjection",1,["sudachi::config::SurfaceProjection"]],["impl Unpin for Config",1,["sudachi::config::Config"]],["impl Unpin for ConfigBuilder",1,["sudachi::config::ConfigBuilder"]],["impl Unpin for DicBuildError",1,["sudachi::dic::build::error::DicBuildError"]],["impl Unpin for BuildFailure",1,["sudachi::dic::build::error::BuildFailure"]],["impl Unpin for DictPartReport",1,["sudachi::dic::build::report::DictPartReport"]],["impl<'a> Unpin for DataSource<'a>",1,["sudachi::dic::build::DataSource"]],["impl Unpin for NoDic",1,["sudachi::dic::build::NoDic"]],["impl<D> Unpin for DictBuilder<D>where\n D: Unpin,",1,["sudachi::dic::build::DictBuilder"]],["impl Unpin for CategoryType",1,["sudachi::dic::category_type::CategoryType"]],["impl Unpin for Error",1,["sudachi::dic::character_category::Error"]],["impl Unpin for CharacterCategory",1,["sudachi::dic::character_category::CharacterCategory"]],["impl<'a> Unpin for CharCategoryIter<'a>",1,["sudachi::dic::character_category::CharCategoryIter"]],["impl<'a> Unpin for ConnectionMatrix<'a>",1,["sudachi::dic::connect::ConnectionMatrix"]],["impl Unpin for JapaneseDictionary",1,["sudachi::dic::dictionary::JapaneseDictionary"]],["impl<'a> Unpin for Grammar<'a>",1,["sudachi::dic::grammar::Grammar"]],["impl Unpin for HeaderError",1,["sudachi::dic::header::HeaderError"]],["impl Unpin for HeaderVersion",1,["sudachi::dic::header::HeaderVersion"]],["impl Unpin for SystemDictVersion",1,["sudachi::dic::header::SystemDictVersion"]],["impl Unpin for UserDictVersion",1,["sudachi::dic::header::UserDictVersion"]],["impl Unpin for Header",1,["sudachi::dic::header::Header"]],["impl Unpin for TrieEntry",1,["sudachi::dic::lexicon::trie::TrieEntry"]],["impl<'a> Unpin for Trie<'a>",1,["sudachi::dic::lexicon::trie::Trie"]],["impl<'a> Unpin for TrieEntryIter<'a>",1,["sudachi::dic::lexicon::trie::TrieEntryIter"]],["impl<'a> Unpin for WordIdTable<'a>",1,["sudachi::dic::lexicon::word_id_table::WordIdTable"]],["impl Unpin for WordIdIter",1,["sudachi::dic::lexicon::word_id_table::WordIdIter"]],["impl<'a> Unpin for WordInfos<'a>",1,["sudachi::dic::lexicon::word_infos::WordInfos"]],["impl Unpin for WordInfoData",1,["sudachi::dic::lexicon::word_infos::WordInfoData"]],["impl Unpin for WordInfo",1,["sudachi::dic::lexicon::word_infos::WordInfo"]],["impl<'a> Unpin for WordParams<'a>",1,["sudachi::dic::lexicon::word_params::WordParams"]],["impl<'a> Unpin for Lexicon<'a>",1,["sudachi::dic::lexicon::Lexicon"]],["impl Unpin for LexiconEntry",1,["sudachi::dic::lexicon::LexiconEntry"]],["impl Unpin for LexiconSetError",1,["sudachi::dic::lexicon_set::LexiconSetError"]],["impl<'a> Unpin for LexiconSet<'a>",1,["sudachi::dic::lexicon_set::LexiconSet"]],["impl Unpin for Storage",1,["sudachi::dic::storage::Storage"]],["impl Unpin for SudachiDicData",1,["sudachi::dic::storage::SudachiDicData"]],["impl Unpin for InfoSubset",1,["sudachi::dic::subset::InfoSubset"]],["impl Unpin for WordId",1,["sudachi::dic::word_id::WordId"]],["impl<'a> Unpin for LoadedDictionary<'a>",1,["sudachi::dic::LoadedDictionary"]],["impl<'a> Unpin for DictionaryLoader<'a>",1,["sudachi::dic::DictionaryLoader"]],["impl Unpin for SudachiError",1,["sudachi::error::SudachiError"]],["impl<I> Unpin for SudachiNomError<I>where\n I: Unpin,",1,["sudachi::error::SudachiNomError"]],["impl<'a> Unpin for InputEditor<'a>",1,["sudachi::input_text::buffer::edit::InputEditor"]],["impl Unpin for InputBuffer",1,["sudachi::input_text::buffer::InputBuffer"]],["impl Unpin for DefaultInputTextPlugin",1,["sudachi::plugin::input_text::default_input_text::DefaultInputTextPlugin"]],["impl Unpin for MeCabOovPlugin",1,["sudachi::plugin::oov::mecab_oov::MeCabOovPlugin"]],["impl Unpin for BoundaryMode",1,["sudachi::plugin::oov::regex_oov::BoundaryMode"]],["impl Unpin for SimpleOovPlugin",1,["sudachi::plugin::oov::simple_oov::SimpleOovPlugin"]],["impl Unpin for JoinKatakanaOovPlugin",1,["sudachi::plugin::path_rewrite::join_katakana_oov::JoinKatakanaOovPlugin"]],["impl Unpin for JoinNumericPlugin",1,["sudachi::plugin::path_rewrite::join_numeric::JoinNumericPlugin"]],["impl Unpin for PluginError",1,["sudachi::plugin::PluginError"]],["impl<'a> Unpin for NonBreakChecker<'a>",1,["sudachi::sentence_detector::NonBreakChecker"]],["impl Unpin for SentenceDetector",1,["sudachi::sentence_detector::SentenceDetector"]],["impl<'s, 'x> Unpin for SentenceIter<'s, 'x>",1,["sudachi::sentence_splitter::SentenceIter"]],["impl<'a> Unpin for SentenceSplitter<'a>",1,["sudachi::sentence_splitter::SentenceSplitter"]],["impl Unpin for PosMatcher",1,["sudachi::pos::PosMatcher"]]] };if (window.register_implementors) {window.register_implementors(implementors);} else {window.pending_implementors = implementors;}})() \ No newline at end of file diff --git a/rust/trait.impl/core/ops/arith/trait.Sub.js b/rust/trait.impl/core/ops/arith/trait.Sub.js new file mode 100644 index 00000000..7a07930d --- /dev/null +++ b/rust/trait.impl/core/ops/arith/trait.Sub.js @@ -0,0 +1,3 @@ +(function() {var implementors = { +"sudachi":[["impl Sub for InfoSubset"],["impl Sub for CategoryType"]] +};if (window.register_implementors) {window.register_implementors(implementors);} else {window.pending_implementors = implementors;}})() \ No newline at end of file diff --git a/rust/trait.impl/core/ops/arith/trait.SubAssign.js b/rust/trait.impl/core/ops/arith/trait.SubAssign.js new file mode 100644 index 00000000..21454a36 --- /dev/null +++ b/rust/trait.impl/core/ops/arith/trait.SubAssign.js @@ -0,0 +1,3 @@ +(function() {var implementors = { +"sudachi":[["impl SubAssign for InfoSubset"],["impl SubAssign for CategoryType"]] +};if (window.register_implementors) {window.register_implementors(implementors);} else {window.pending_implementors = implementors;}})() \ No newline at end of file diff --git a/rust/trait.impl/core/ops/bit/trait.BitAnd.js b/rust/trait.impl/core/ops/bit/trait.BitAnd.js new file mode 100644 index 00000000..40f72398 --- /dev/null +++ b/rust/trait.impl/core/ops/bit/trait.BitAnd.js @@ -0,0 +1,3 @@ +(function() {var implementors = { +"sudachi":[["impl BitAnd for CategoryType"],["impl BitAnd for InfoSubset"]] +};if (window.register_implementors) {window.register_implementors(implementors);} else {window.pending_implementors = implementors;}})() \ No newline at end of file diff --git a/rust/trait.impl/core/ops/bit/trait.BitAndAssign.js b/rust/trait.impl/core/ops/bit/trait.BitAndAssign.js new file mode 100644 index 00000000..3809f655 --- /dev/null +++ b/rust/trait.impl/core/ops/bit/trait.BitAndAssign.js @@ -0,0 +1,3 @@ +(function() {var implementors = { +"sudachi":[["impl BitAndAssign for InfoSubset"],["impl BitAndAssign for CategoryType"]] +};if (window.register_implementors) {window.register_implementors(implementors);} else {window.pending_implementors = implementors;}})() \ No newline at end of file diff --git a/rust/trait.impl/core/ops/bit/trait.BitOr.js b/rust/trait.impl/core/ops/bit/trait.BitOr.js new file mode 100644 index 00000000..5b19079a --- /dev/null +++ b/rust/trait.impl/core/ops/bit/trait.BitOr.js @@ -0,0 +1,3 @@ +(function() {var implementors = { +"sudachi":[["impl BitOr for CategoryType"],["impl BitOr for InfoSubset"]] +};if (window.register_implementors) {window.register_implementors(implementors);} else {window.pending_implementors = implementors;}})() \ No newline at end of file diff --git a/rust/trait.impl/core/ops/bit/trait.BitOrAssign.js b/rust/trait.impl/core/ops/bit/trait.BitOrAssign.js new file mode 100644 index 00000000..18a58744 --- /dev/null +++ b/rust/trait.impl/core/ops/bit/trait.BitOrAssign.js @@ -0,0 +1,3 @@ +(function() {var implementors = { +"sudachi":[["impl BitOrAssign for CategoryType"],["impl BitOrAssign for InfoSubset"]] +};if (window.register_implementors) {window.register_implementors(implementors);} else {window.pending_implementors = implementors;}})() \ No newline at end of file diff --git a/rust/trait.impl/core/ops/bit/trait.BitXor.js b/rust/trait.impl/core/ops/bit/trait.BitXor.js new file mode 100644 index 00000000..093e893c --- /dev/null +++ b/rust/trait.impl/core/ops/bit/trait.BitXor.js @@ -0,0 +1,3 @@ +(function() {var implementors = { +"sudachi":[["impl BitXor for CategoryType"],["impl BitXor for InfoSubset"]] +};if (window.register_implementors) {window.register_implementors(implementors);} else {window.pending_implementors = implementors;}})() \ No newline at end of file diff --git a/rust/trait.impl/core/ops/bit/trait.BitXorAssign.js b/rust/trait.impl/core/ops/bit/trait.BitXorAssign.js new file mode 100644 index 00000000..ab3c106e --- /dev/null +++ b/rust/trait.impl/core/ops/bit/trait.BitXorAssign.js @@ -0,0 +1,3 @@ +(function() {var implementors = { +"sudachi":[["impl BitXorAssign for InfoSubset"],["impl BitXorAssign for CategoryType"]] +};if (window.register_implementors) {window.register_implementors(implementors);} else {window.pending_implementors = implementors;}})() \ No newline at end of file diff --git a/rust/implementors/core/ops/bit/trait.Not.js b/rust/trait.impl/core/ops/bit/trait.Not.js similarity index 83% rename from rust/implementors/core/ops/bit/trait.Not.js rename to rust/trait.impl/core/ops/bit/trait.Not.js index 1b9e987f..42a42b07 100644 --- a/rust/implementors/core/ops/bit/trait.Not.js +++ b/rust/trait.impl/core/ops/bit/trait.Not.js @@ -1,3 +1,3 @@ (function() {var implementors = { -"sudachi":[["impl Not for InfoSubset"],["impl Not for CategoryType"]] +"sudachi":[["impl Not for InfoSubset"],["impl Not for CategoryType"]] };if (window.register_implementors) {window.register_implementors(implementors);} else {window.pending_implementors = implementors;}})() \ No newline at end of file diff --git a/rust/implementors/core/panic/unwind_safe/trait.RefUnwindSafe.js b/rust/trait.impl/core/panic/unwind_safe/trait.RefUnwindSafe.js similarity index 83% rename from rust/implementors/core/panic/unwind_safe/trait.RefUnwindSafe.js rename to rust/trait.impl/core/panic/unwind_safe/trait.RefUnwindSafe.js index a92bc991..4c942da4 100644 --- a/rust/implementors/core/panic/unwind_safe/trait.RefUnwindSafe.js +++ b/rust/trait.impl/core/panic/unwind_safe/trait.RefUnwindSafe.js @@ -1,3 +1,3 @@ (function() {var implementors = { -"sudachi":[["impl RefUnwindSafe for CreatedWords",1,["sudachi::analysis::created::CreatedWords"]],["impl RefUnwindSafe for HasWord",1,["sudachi::analysis::created::HasWord"]],["impl RefUnwindSafe for Node",1,["sudachi::analysis::inner::Node"]],["impl RefUnwindSafe for Lattice",1,["sudachi::analysis::lattice::Lattice"]],["impl<T> !RefUnwindSafe for MorphemeList<T>",1,["sudachi::analysis::mlist::MorphemeList"]],["impl<'a, T> !RefUnwindSafe for MorphemeIter<'a, T>",1,["sudachi::analysis::mlist::MorphemeIter"]],["impl<'a, T> !RefUnwindSafe for Morpheme<'a, T>",1,["sudachi::analysis::morpheme::Morpheme"]],["impl RefUnwindSafe for ResultNode",1,["sudachi::analysis::node::ResultNode"]],["impl<'a> RefUnwindSafe for NodeSplitIterator<'a>",1,["sudachi::analysis::node::NodeSplitIterator"]],["impl<D> RefUnwindSafe for StatefulTokenizer<D>where\n D: RefUnwindSafe,",1,["sudachi::analysis::stateful_tokenizer::StatefulTokenizer"]],["impl<T> RefUnwindSafe for StatelessTokenizer<T>where\n T: RefUnwindSafe,",1,["sudachi::analysis::stateless_tokenizer::StatelessTokenizer"]],["impl RefUnwindSafe for Mode",1,["sudachi::analysis::Mode"]],["impl !RefUnwindSafe for ConfigError",1,["sudachi::config::ConfigError"]],["impl RefUnwindSafe for SurfaceProjection",1,["sudachi::config::SurfaceProjection"]],["impl RefUnwindSafe for Config",1,["sudachi::config::Config"]],["impl RefUnwindSafe for ConfigBuilder",1,["sudachi::config::ConfigBuilder"]],["impl !RefUnwindSafe for DicBuildError",1,["sudachi::dic::build::error::DicBuildError"]],["impl !RefUnwindSafe for BuildFailure",1,["sudachi::dic::build::error::BuildFailure"]],["impl RefUnwindSafe for DictPartReport",1,["sudachi::dic::build::report::DictPartReport"]],["impl<'a> RefUnwindSafe for DataSource<'a>",1,["sudachi::dic::build::DataSource"]],["impl RefUnwindSafe for NoDic",1,["sudachi::dic::build::NoDic"]],["impl<D> RefUnwindSafe for DictBuilder<D>where\n D: RefUnwindSafe,",1,["sudachi::dic::build::DictBuilder"]],["impl RefUnwindSafe for CategoryType",1,["sudachi::dic::category_type::CategoryType"]],["impl RefUnwindSafe for Error",1,["sudachi::dic::character_category::Error"]],["impl RefUnwindSafe for CharacterCategory",1,["sudachi::dic::character_category::CharacterCategory"]],["impl<'a> RefUnwindSafe for CharCategoryIter<'a>",1,["sudachi::dic::character_category::CharCategoryIter"]],["impl<'a> RefUnwindSafe for ConnectionMatrix<'a>",1,["sudachi::dic::connect::ConnectionMatrix"]],["impl !RefUnwindSafe for JapaneseDictionary",1,["sudachi::dic::dictionary::JapaneseDictionary"]],["impl<'a> RefUnwindSafe for Grammar<'a>",1,["sudachi::dic::grammar::Grammar"]],["impl RefUnwindSafe for HeaderError",1,["sudachi::dic::header::HeaderError"]],["impl RefUnwindSafe for HeaderVersion",1,["sudachi::dic::header::HeaderVersion"]],["impl RefUnwindSafe for SystemDictVersion",1,["sudachi::dic::header::SystemDictVersion"]],["impl RefUnwindSafe for UserDictVersion",1,["sudachi::dic::header::UserDictVersion"]],["impl RefUnwindSafe for Header",1,["sudachi::dic::header::Header"]],["impl RefUnwindSafe for TrieEntry",1,["sudachi::dic::lexicon::trie::TrieEntry"]],["impl<'a> RefUnwindSafe for Trie<'a>",1,["sudachi::dic::lexicon::trie::Trie"]],["impl<'a> RefUnwindSafe for TrieEntryIter<'a>",1,["sudachi::dic::lexicon::trie::TrieEntryIter"]],["impl<'a> RefUnwindSafe for WordIdTable<'a>",1,["sudachi::dic::lexicon::word_id_table::WordIdTable"]],["impl RefUnwindSafe for WordIdIter",1,["sudachi::dic::lexicon::word_id_table::WordIdIter"]],["impl<'a> RefUnwindSafe for WordInfos<'a>",1,["sudachi::dic::lexicon::word_infos::WordInfos"]],["impl RefUnwindSafe for WordInfoData",1,["sudachi::dic::lexicon::word_infos::WordInfoData"]],["impl RefUnwindSafe for WordInfo",1,["sudachi::dic::lexicon::word_infos::WordInfo"]],["impl<'a> RefUnwindSafe for WordParams<'a>",1,["sudachi::dic::lexicon::word_params::WordParams"]],["impl<'a> RefUnwindSafe for Lexicon<'a>",1,["sudachi::dic::lexicon::Lexicon"]],["impl RefUnwindSafe for LexiconEntry",1,["sudachi::dic::lexicon::LexiconEntry"]],["impl RefUnwindSafe for LexiconSetError",1,["sudachi::dic::lexicon_set::LexiconSetError"]],["impl<'a> RefUnwindSafe for LexiconSet<'a>",1,["sudachi::dic::lexicon_set::LexiconSet"]],["impl RefUnwindSafe for Storage",1,["sudachi::dic::storage::Storage"]],["impl RefUnwindSafe for SudachiDicData",1,["sudachi::dic::storage::SudachiDicData"]],["impl RefUnwindSafe for InfoSubset",1,["sudachi::dic::subset::InfoSubset"]],["impl RefUnwindSafe for WordId",1,["sudachi::dic::word_id::WordId"]],["impl<'a> RefUnwindSafe for LoadedDictionary<'a>",1,["sudachi::dic::LoadedDictionary"]],["impl<'a> RefUnwindSafe for DictionaryLoader<'a>",1,["sudachi::dic::DictionaryLoader"]],["impl !RefUnwindSafe for SudachiError",1,["sudachi::error::SudachiError"]],["impl<I> RefUnwindSafe for SudachiNomError<I>where\n I: RefUnwindSafe,",1,["sudachi::error::SudachiNomError"]],["impl<'a> RefUnwindSafe for InputEditor<'a>",1,["sudachi::input_text::buffer::edit::InputEditor"]],["impl RefUnwindSafe for InputBuffer",1,["sudachi::input_text::buffer::InputBuffer"]],["impl RefUnwindSafe for DefaultInputTextPlugin",1,["sudachi::plugin::input_text::default_input_text::DefaultInputTextPlugin"]],["impl RefUnwindSafe for MeCabOovPlugin",1,["sudachi::plugin::oov::mecab_oov::MeCabOovPlugin"]],["impl RefUnwindSafe for BoundaryMode",1,["sudachi::plugin::oov::regex_oov::BoundaryMode"]],["impl RefUnwindSafe for SimpleOovPlugin",1,["sudachi::plugin::oov::simple_oov::SimpleOovPlugin"]],["impl RefUnwindSafe for JoinKatakanaOovPlugin",1,["sudachi::plugin::path_rewrite::join_katakana_oov::JoinKatakanaOovPlugin"]],["impl RefUnwindSafe for JoinNumericPlugin",1,["sudachi::plugin::path_rewrite::join_numeric::JoinNumericPlugin"]],["impl !RefUnwindSafe for PluginError",1,["sudachi::plugin::PluginError"]],["impl<'a> RefUnwindSafe for NonBreakChecker<'a>",1,["sudachi::sentence_detector::NonBreakChecker"]],["impl RefUnwindSafe for SentenceDetector",1,["sudachi::sentence_detector::SentenceDetector"]],["impl<'s, 'x> RefUnwindSafe for SentenceIter<'s, 'x>",1,["sudachi::sentence_splitter::SentenceIter"]],["impl<'a> RefUnwindSafe for SentenceSplitter<'a>",1,["sudachi::sentence_splitter::SentenceSplitter"]],["impl RefUnwindSafe for PosMatcher",1,["sudachi::pos::PosMatcher"]]] +"sudachi":[["impl RefUnwindSafe for CreatedWords",1,["sudachi::analysis::created::CreatedWords"]],["impl RefUnwindSafe for HasWord",1,["sudachi::analysis::created::HasWord"]],["impl RefUnwindSafe for Node",1,["sudachi::analysis::inner::Node"]],["impl RefUnwindSafe for Lattice",1,["sudachi::analysis::lattice::Lattice"]],["impl<T> !RefUnwindSafe for MorphemeList<T>",1,["sudachi::analysis::mlist::MorphemeList"]],["impl<'a, T> !RefUnwindSafe for MorphemeIter<'a, T>",1,["sudachi::analysis::mlist::MorphemeIter"]],["impl<'a, T> !RefUnwindSafe for Morpheme<'a, T>",1,["sudachi::analysis::morpheme::Morpheme"]],["impl RefUnwindSafe for ResultNode",1,["sudachi::analysis::node::ResultNode"]],["impl<'a> RefUnwindSafe for NodeSplitIterator<'a>",1,["sudachi::analysis::node::NodeSplitIterator"]],["impl<D> RefUnwindSafe for StatefulTokenizer<D>where\n D: RefUnwindSafe,",1,["sudachi::analysis::stateful_tokenizer::StatefulTokenizer"]],["impl<T> RefUnwindSafe for StatelessTokenizer<T>where\n T: RefUnwindSafe,",1,["sudachi::analysis::stateless_tokenizer::StatelessTokenizer"]],["impl RefUnwindSafe for Mode",1,["sudachi::analysis::Mode"]],["impl !RefUnwindSafe for ConfigError",1,["sudachi::config::ConfigError"]],["impl RefUnwindSafe for SurfaceProjection",1,["sudachi::config::SurfaceProjection"]],["impl RefUnwindSafe for Config",1,["sudachi::config::Config"]],["impl RefUnwindSafe for ConfigBuilder",1,["sudachi::config::ConfigBuilder"]],["impl !RefUnwindSafe for DicBuildError",1,["sudachi::dic::build::error::DicBuildError"]],["impl !RefUnwindSafe for BuildFailure",1,["sudachi::dic::build::error::BuildFailure"]],["impl RefUnwindSafe for DictPartReport",1,["sudachi::dic::build::report::DictPartReport"]],["impl<'a> RefUnwindSafe for DataSource<'a>",1,["sudachi::dic::build::DataSource"]],["impl RefUnwindSafe for NoDic",1,["sudachi::dic::build::NoDic"]],["impl<D> RefUnwindSafe for DictBuilder<D>where\n D: RefUnwindSafe,",1,["sudachi::dic::build::DictBuilder"]],["impl RefUnwindSafe for CategoryType",1,["sudachi::dic::category_type::CategoryType"]],["impl RefUnwindSafe for Error",1,["sudachi::dic::character_category::Error"]],["impl RefUnwindSafe for CharacterCategory",1,["sudachi::dic::character_category::CharacterCategory"]],["impl<'a> RefUnwindSafe for CharCategoryIter<'a>",1,["sudachi::dic::character_category::CharCategoryIter"]],["impl<'a> RefUnwindSafe for ConnectionMatrix<'a>",1,["sudachi::dic::connect::ConnectionMatrix"]],["impl !RefUnwindSafe for JapaneseDictionary",1,["sudachi::dic::dictionary::JapaneseDictionary"]],["impl<'a> RefUnwindSafe for Grammar<'a>",1,["sudachi::dic::grammar::Grammar"]],["impl RefUnwindSafe for HeaderError",1,["sudachi::dic::header::HeaderError"]],["impl RefUnwindSafe for HeaderVersion",1,["sudachi::dic::header::HeaderVersion"]],["impl RefUnwindSafe for SystemDictVersion",1,["sudachi::dic::header::SystemDictVersion"]],["impl RefUnwindSafe for UserDictVersion",1,["sudachi::dic::header::UserDictVersion"]],["impl RefUnwindSafe for Header",1,["sudachi::dic::header::Header"]],["impl RefUnwindSafe for TrieEntry",1,["sudachi::dic::lexicon::trie::TrieEntry"]],["impl<'a> RefUnwindSafe for Trie<'a>",1,["sudachi::dic::lexicon::trie::Trie"]],["impl<'a> RefUnwindSafe for TrieEntryIter<'a>",1,["sudachi::dic::lexicon::trie::TrieEntryIter"]],["impl<'a> RefUnwindSafe for WordIdTable<'a>",1,["sudachi::dic::lexicon::word_id_table::WordIdTable"]],["impl RefUnwindSafe for WordIdIter",1,["sudachi::dic::lexicon::word_id_table::WordIdIter"]],["impl<'a> RefUnwindSafe for WordInfos<'a>",1,["sudachi::dic::lexicon::word_infos::WordInfos"]],["impl RefUnwindSafe for WordInfoData",1,["sudachi::dic::lexicon::word_infos::WordInfoData"]],["impl RefUnwindSafe for WordInfo",1,["sudachi::dic::lexicon::word_infos::WordInfo"]],["impl<'a> RefUnwindSafe for WordParams<'a>",1,["sudachi::dic::lexicon::word_params::WordParams"]],["impl<'a> RefUnwindSafe for Lexicon<'a>",1,["sudachi::dic::lexicon::Lexicon"]],["impl RefUnwindSafe for LexiconEntry",1,["sudachi::dic::lexicon::LexiconEntry"]],["impl RefUnwindSafe for LexiconSetError",1,["sudachi::dic::lexicon_set::LexiconSetError"]],["impl<'a> RefUnwindSafe for LexiconSet<'a>",1,["sudachi::dic::lexicon_set::LexiconSet"]],["impl RefUnwindSafe for Storage",1,["sudachi::dic::storage::Storage"]],["impl RefUnwindSafe for SudachiDicData",1,["sudachi::dic::storage::SudachiDicData"]],["impl RefUnwindSafe for InfoSubset",1,["sudachi::dic::subset::InfoSubset"]],["impl RefUnwindSafe for WordId",1,["sudachi::dic::word_id::WordId"]],["impl<'a> RefUnwindSafe for LoadedDictionary<'a>",1,["sudachi::dic::LoadedDictionary"]],["impl<'a> RefUnwindSafe for DictionaryLoader<'a>",1,["sudachi::dic::DictionaryLoader"]],["impl !RefUnwindSafe for SudachiError",1,["sudachi::error::SudachiError"]],["impl<I> RefUnwindSafe for SudachiNomError<I>where\n I: RefUnwindSafe,",1,["sudachi::error::SudachiNomError"]],["impl<'a> RefUnwindSafe for InputEditor<'a>",1,["sudachi::input_text::buffer::edit::InputEditor"]],["impl RefUnwindSafe for InputBuffer",1,["sudachi::input_text::buffer::InputBuffer"]],["impl RefUnwindSafe for DefaultInputTextPlugin",1,["sudachi::plugin::input_text::default_input_text::DefaultInputTextPlugin"]],["impl RefUnwindSafe for MeCabOovPlugin",1,["sudachi::plugin::oov::mecab_oov::MeCabOovPlugin"]],["impl RefUnwindSafe for BoundaryMode",1,["sudachi::plugin::oov::regex_oov::BoundaryMode"]],["impl RefUnwindSafe for SimpleOovPlugin",1,["sudachi::plugin::oov::simple_oov::SimpleOovPlugin"]],["impl RefUnwindSafe for JoinKatakanaOovPlugin",1,["sudachi::plugin::path_rewrite::join_katakana_oov::JoinKatakanaOovPlugin"]],["impl RefUnwindSafe for JoinNumericPlugin",1,["sudachi::plugin::path_rewrite::join_numeric::JoinNumericPlugin"]],["impl !RefUnwindSafe for PluginError",1,["sudachi::plugin::PluginError"]],["impl<'a> RefUnwindSafe for NonBreakChecker<'a>",1,["sudachi::sentence_detector::NonBreakChecker"]],["impl RefUnwindSafe for SentenceDetector",1,["sudachi::sentence_detector::SentenceDetector"]],["impl<'s, 'x> RefUnwindSafe for SentenceIter<'s, 'x>",1,["sudachi::sentence_splitter::SentenceIter"]],["impl<'a> RefUnwindSafe for SentenceSplitter<'a>",1,["sudachi::sentence_splitter::SentenceSplitter"]],["impl RefUnwindSafe for PosMatcher",1,["sudachi::pos::PosMatcher"]]] };if (window.register_implementors) {window.register_implementors(implementors);} else {window.pending_implementors = implementors;}})() \ No newline at end of file diff --git a/rust/implementors/core/panic/unwind_safe/trait.UnwindSafe.js b/rust/trait.impl/core/panic/unwind_safe/trait.UnwindSafe.js similarity index 83% rename from rust/implementors/core/panic/unwind_safe/trait.UnwindSafe.js rename to rust/trait.impl/core/panic/unwind_safe/trait.UnwindSafe.js index 1403cea6..f5bcbad8 100644 --- a/rust/implementors/core/panic/unwind_safe/trait.UnwindSafe.js +++ b/rust/trait.impl/core/panic/unwind_safe/trait.UnwindSafe.js @@ -1,3 +1,3 @@ (function() {var implementors = { -"sudachi":[["impl UnwindSafe for CreatedWords",1,["sudachi::analysis::created::CreatedWords"]],["impl UnwindSafe for HasWord",1,["sudachi::analysis::created::HasWord"]],["impl UnwindSafe for Node",1,["sudachi::analysis::inner::Node"]],["impl UnwindSafe for Lattice",1,["sudachi::analysis::lattice::Lattice"]],["impl<T> !UnwindSafe for MorphemeList<T>",1,["sudachi::analysis::mlist::MorphemeList"]],["impl<'a, T> !UnwindSafe for MorphemeIter<'a, T>",1,["sudachi::analysis::mlist::MorphemeIter"]],["impl<'a, T> !UnwindSafe for Morpheme<'a, T>",1,["sudachi::analysis::morpheme::Morpheme"]],["impl UnwindSafe for ResultNode",1,["sudachi::analysis::node::ResultNode"]],["impl<'a> UnwindSafe for NodeSplitIterator<'a>",1,["sudachi::analysis::node::NodeSplitIterator"]],["impl<D> UnwindSafe for StatefulTokenizer<D>where\n D: UnwindSafe,",1,["sudachi::analysis::stateful_tokenizer::StatefulTokenizer"]],["impl<T> UnwindSafe for StatelessTokenizer<T>where\n T: UnwindSafe,",1,["sudachi::analysis::stateless_tokenizer::StatelessTokenizer"]],["impl UnwindSafe for Mode",1,["sudachi::analysis::Mode"]],["impl !UnwindSafe for ConfigError",1,["sudachi::config::ConfigError"]],["impl UnwindSafe for SurfaceProjection",1,["sudachi::config::SurfaceProjection"]],["impl UnwindSafe for Config",1,["sudachi::config::Config"]],["impl UnwindSafe for ConfigBuilder",1,["sudachi::config::ConfigBuilder"]],["impl !UnwindSafe for DicBuildError",1,["sudachi::dic::build::error::DicBuildError"]],["impl !UnwindSafe for BuildFailure",1,["sudachi::dic::build::error::BuildFailure"]],["impl UnwindSafe for DictPartReport",1,["sudachi::dic::build::report::DictPartReport"]],["impl<'a> UnwindSafe for DataSource<'a>",1,["sudachi::dic::build::DataSource"]],["impl UnwindSafe for NoDic",1,["sudachi::dic::build::NoDic"]],["impl<D> UnwindSafe for DictBuilder<D>where\n D: UnwindSafe,",1,["sudachi::dic::build::DictBuilder"]],["impl UnwindSafe for CategoryType",1,["sudachi::dic::category_type::CategoryType"]],["impl UnwindSafe for Error",1,["sudachi::dic::character_category::Error"]],["impl UnwindSafe for CharacterCategory",1,["sudachi::dic::character_category::CharacterCategory"]],["impl<'a> UnwindSafe for CharCategoryIter<'a>",1,["sudachi::dic::character_category::CharCategoryIter"]],["impl<'a> UnwindSafe for ConnectionMatrix<'a>",1,["sudachi::dic::connect::ConnectionMatrix"]],["impl !UnwindSafe for JapaneseDictionary",1,["sudachi::dic::dictionary::JapaneseDictionary"]],["impl<'a> UnwindSafe for Grammar<'a>",1,["sudachi::dic::grammar::Grammar"]],["impl UnwindSafe for HeaderError",1,["sudachi::dic::header::HeaderError"]],["impl UnwindSafe for HeaderVersion",1,["sudachi::dic::header::HeaderVersion"]],["impl UnwindSafe for SystemDictVersion",1,["sudachi::dic::header::SystemDictVersion"]],["impl UnwindSafe for UserDictVersion",1,["sudachi::dic::header::UserDictVersion"]],["impl UnwindSafe for Header",1,["sudachi::dic::header::Header"]],["impl UnwindSafe for TrieEntry",1,["sudachi::dic::lexicon::trie::TrieEntry"]],["impl<'a> UnwindSafe for Trie<'a>",1,["sudachi::dic::lexicon::trie::Trie"]],["impl<'a> UnwindSafe for TrieEntryIter<'a>",1,["sudachi::dic::lexicon::trie::TrieEntryIter"]],["impl<'a> UnwindSafe for WordIdTable<'a>",1,["sudachi::dic::lexicon::word_id_table::WordIdTable"]],["impl UnwindSafe for WordIdIter",1,["sudachi::dic::lexicon::word_id_table::WordIdIter"]],["impl<'a> UnwindSafe for WordInfos<'a>",1,["sudachi::dic::lexicon::word_infos::WordInfos"]],["impl UnwindSafe for WordInfoData",1,["sudachi::dic::lexicon::word_infos::WordInfoData"]],["impl UnwindSafe for WordInfo",1,["sudachi::dic::lexicon::word_infos::WordInfo"]],["impl<'a> UnwindSafe for WordParams<'a>",1,["sudachi::dic::lexicon::word_params::WordParams"]],["impl<'a> UnwindSafe for Lexicon<'a>",1,["sudachi::dic::lexicon::Lexicon"]],["impl UnwindSafe for LexiconEntry",1,["sudachi::dic::lexicon::LexiconEntry"]],["impl UnwindSafe for LexiconSetError",1,["sudachi::dic::lexicon_set::LexiconSetError"]],["impl<'a> UnwindSafe for LexiconSet<'a>",1,["sudachi::dic::lexicon_set::LexiconSet"]],["impl UnwindSafe for Storage",1,["sudachi::dic::storage::Storage"]],["impl UnwindSafe for SudachiDicData",1,["sudachi::dic::storage::SudachiDicData"]],["impl UnwindSafe for InfoSubset",1,["sudachi::dic::subset::InfoSubset"]],["impl UnwindSafe for WordId",1,["sudachi::dic::word_id::WordId"]],["impl<'a> UnwindSafe for LoadedDictionary<'a>",1,["sudachi::dic::LoadedDictionary"]],["impl<'a> UnwindSafe for DictionaryLoader<'a>",1,["sudachi::dic::DictionaryLoader"]],["impl !UnwindSafe for SudachiError",1,["sudachi::error::SudachiError"]],["impl<I> UnwindSafe for SudachiNomError<I>where\n I: UnwindSafe,",1,["sudachi::error::SudachiNomError"]],["impl<'a> !UnwindSafe for InputEditor<'a>",1,["sudachi::input_text::buffer::edit::InputEditor"]],["impl UnwindSafe for InputBuffer",1,["sudachi::input_text::buffer::InputBuffer"]],["impl UnwindSafe for DefaultInputTextPlugin",1,["sudachi::plugin::input_text::default_input_text::DefaultInputTextPlugin"]],["impl UnwindSafe for MeCabOovPlugin",1,["sudachi::plugin::oov::mecab_oov::MeCabOovPlugin"]],["impl UnwindSafe for BoundaryMode",1,["sudachi::plugin::oov::regex_oov::BoundaryMode"]],["impl UnwindSafe for SimpleOovPlugin",1,["sudachi::plugin::oov::simple_oov::SimpleOovPlugin"]],["impl UnwindSafe for JoinKatakanaOovPlugin",1,["sudachi::plugin::path_rewrite::join_katakana_oov::JoinKatakanaOovPlugin"]],["impl UnwindSafe for JoinNumericPlugin",1,["sudachi::plugin::path_rewrite::join_numeric::JoinNumericPlugin"]],["impl !UnwindSafe for PluginError",1,["sudachi::plugin::PluginError"]],["impl<'a> UnwindSafe for NonBreakChecker<'a>",1,["sudachi::sentence_detector::NonBreakChecker"]],["impl UnwindSafe for SentenceDetector",1,["sudachi::sentence_detector::SentenceDetector"]],["impl<'s, 'x> UnwindSafe for SentenceIter<'s, 'x>",1,["sudachi::sentence_splitter::SentenceIter"]],["impl<'a> UnwindSafe for SentenceSplitter<'a>",1,["sudachi::sentence_splitter::SentenceSplitter"]],["impl UnwindSafe for PosMatcher",1,["sudachi::pos::PosMatcher"]]] +"sudachi":[["impl UnwindSafe for CreatedWords",1,["sudachi::analysis::created::CreatedWords"]],["impl UnwindSafe for HasWord",1,["sudachi::analysis::created::HasWord"]],["impl UnwindSafe for Node",1,["sudachi::analysis::inner::Node"]],["impl UnwindSafe for Lattice",1,["sudachi::analysis::lattice::Lattice"]],["impl<T> !UnwindSafe for MorphemeList<T>",1,["sudachi::analysis::mlist::MorphemeList"]],["impl<'a, T> !UnwindSafe for MorphemeIter<'a, T>",1,["sudachi::analysis::mlist::MorphemeIter"]],["impl<'a, T> !UnwindSafe for Morpheme<'a, T>",1,["sudachi::analysis::morpheme::Morpheme"]],["impl UnwindSafe for ResultNode",1,["sudachi::analysis::node::ResultNode"]],["impl<'a> UnwindSafe for NodeSplitIterator<'a>",1,["sudachi::analysis::node::NodeSplitIterator"]],["impl<D> UnwindSafe for StatefulTokenizer<D>where\n D: UnwindSafe,",1,["sudachi::analysis::stateful_tokenizer::StatefulTokenizer"]],["impl<T> UnwindSafe for StatelessTokenizer<T>where\n T: UnwindSafe,",1,["sudachi::analysis::stateless_tokenizer::StatelessTokenizer"]],["impl UnwindSafe for Mode",1,["sudachi::analysis::Mode"]],["impl !UnwindSafe for ConfigError",1,["sudachi::config::ConfigError"]],["impl UnwindSafe for SurfaceProjection",1,["sudachi::config::SurfaceProjection"]],["impl UnwindSafe for Config",1,["sudachi::config::Config"]],["impl UnwindSafe for ConfigBuilder",1,["sudachi::config::ConfigBuilder"]],["impl !UnwindSafe for DicBuildError",1,["sudachi::dic::build::error::DicBuildError"]],["impl !UnwindSafe for BuildFailure",1,["sudachi::dic::build::error::BuildFailure"]],["impl UnwindSafe for DictPartReport",1,["sudachi::dic::build::report::DictPartReport"]],["impl<'a> UnwindSafe for DataSource<'a>",1,["sudachi::dic::build::DataSource"]],["impl UnwindSafe for NoDic",1,["sudachi::dic::build::NoDic"]],["impl<D> UnwindSafe for DictBuilder<D>where\n D: UnwindSafe,",1,["sudachi::dic::build::DictBuilder"]],["impl UnwindSafe for CategoryType",1,["sudachi::dic::category_type::CategoryType"]],["impl UnwindSafe for Error",1,["sudachi::dic::character_category::Error"]],["impl UnwindSafe for CharacterCategory",1,["sudachi::dic::character_category::CharacterCategory"]],["impl<'a> UnwindSafe for CharCategoryIter<'a>",1,["sudachi::dic::character_category::CharCategoryIter"]],["impl<'a> UnwindSafe for ConnectionMatrix<'a>",1,["sudachi::dic::connect::ConnectionMatrix"]],["impl !UnwindSafe for JapaneseDictionary",1,["sudachi::dic::dictionary::JapaneseDictionary"]],["impl<'a> UnwindSafe for Grammar<'a>",1,["sudachi::dic::grammar::Grammar"]],["impl UnwindSafe for HeaderError",1,["sudachi::dic::header::HeaderError"]],["impl UnwindSafe for HeaderVersion",1,["sudachi::dic::header::HeaderVersion"]],["impl UnwindSafe for SystemDictVersion",1,["sudachi::dic::header::SystemDictVersion"]],["impl UnwindSafe for UserDictVersion",1,["sudachi::dic::header::UserDictVersion"]],["impl UnwindSafe for Header",1,["sudachi::dic::header::Header"]],["impl UnwindSafe for TrieEntry",1,["sudachi::dic::lexicon::trie::TrieEntry"]],["impl<'a> UnwindSafe for Trie<'a>",1,["sudachi::dic::lexicon::trie::Trie"]],["impl<'a> UnwindSafe for TrieEntryIter<'a>",1,["sudachi::dic::lexicon::trie::TrieEntryIter"]],["impl<'a> UnwindSafe for WordIdTable<'a>",1,["sudachi::dic::lexicon::word_id_table::WordIdTable"]],["impl UnwindSafe for WordIdIter",1,["sudachi::dic::lexicon::word_id_table::WordIdIter"]],["impl<'a> UnwindSafe for WordInfos<'a>",1,["sudachi::dic::lexicon::word_infos::WordInfos"]],["impl UnwindSafe for WordInfoData",1,["sudachi::dic::lexicon::word_infos::WordInfoData"]],["impl UnwindSafe for WordInfo",1,["sudachi::dic::lexicon::word_infos::WordInfo"]],["impl<'a> UnwindSafe for WordParams<'a>",1,["sudachi::dic::lexicon::word_params::WordParams"]],["impl<'a> UnwindSafe for Lexicon<'a>",1,["sudachi::dic::lexicon::Lexicon"]],["impl UnwindSafe for LexiconEntry",1,["sudachi::dic::lexicon::LexiconEntry"]],["impl UnwindSafe for LexiconSetError",1,["sudachi::dic::lexicon_set::LexiconSetError"]],["impl<'a> UnwindSafe for LexiconSet<'a>",1,["sudachi::dic::lexicon_set::LexiconSet"]],["impl UnwindSafe for Storage",1,["sudachi::dic::storage::Storage"]],["impl UnwindSafe for SudachiDicData",1,["sudachi::dic::storage::SudachiDicData"]],["impl UnwindSafe for InfoSubset",1,["sudachi::dic::subset::InfoSubset"]],["impl UnwindSafe for WordId",1,["sudachi::dic::word_id::WordId"]],["impl<'a> UnwindSafe for LoadedDictionary<'a>",1,["sudachi::dic::LoadedDictionary"]],["impl<'a> UnwindSafe for DictionaryLoader<'a>",1,["sudachi::dic::DictionaryLoader"]],["impl !UnwindSafe for SudachiError",1,["sudachi::error::SudachiError"]],["impl<I> UnwindSafe for SudachiNomError<I>where\n I: UnwindSafe,",1,["sudachi::error::SudachiNomError"]],["impl<'a> !UnwindSafe for InputEditor<'a>",1,["sudachi::input_text::buffer::edit::InputEditor"]],["impl UnwindSafe for InputBuffer",1,["sudachi::input_text::buffer::InputBuffer"]],["impl UnwindSafe for DefaultInputTextPlugin",1,["sudachi::plugin::input_text::default_input_text::DefaultInputTextPlugin"]],["impl UnwindSafe for MeCabOovPlugin",1,["sudachi::plugin::oov::mecab_oov::MeCabOovPlugin"]],["impl UnwindSafe for BoundaryMode",1,["sudachi::plugin::oov::regex_oov::BoundaryMode"]],["impl UnwindSafe for SimpleOovPlugin",1,["sudachi::plugin::oov::simple_oov::SimpleOovPlugin"]],["impl UnwindSafe for JoinKatakanaOovPlugin",1,["sudachi::plugin::path_rewrite::join_katakana_oov::JoinKatakanaOovPlugin"]],["impl UnwindSafe for JoinNumericPlugin",1,["sudachi::plugin::path_rewrite::join_numeric::JoinNumericPlugin"]],["impl !UnwindSafe for PluginError",1,["sudachi::plugin::PluginError"]],["impl<'a> UnwindSafe for NonBreakChecker<'a>",1,["sudachi::sentence_detector::NonBreakChecker"]],["impl UnwindSafe for SentenceDetector",1,["sudachi::sentence_detector::SentenceDetector"]],["impl<'s, 'x> UnwindSafe for SentenceIter<'s, 'x>",1,["sudachi::sentence_splitter::SentenceIter"]],["impl<'a> UnwindSafe for SentenceSplitter<'a>",1,["sudachi::sentence_splitter::SentenceSplitter"]],["impl UnwindSafe for PosMatcher",1,["sudachi::pos::PosMatcher"]]] };if (window.register_implementors) {window.register_implementors(implementors);} else {window.pending_implementors = implementors;}})() \ No newline at end of file diff --git a/rust/trait.impl/core/str/traits/trait.FromStr.js b/rust/trait.impl/core/str/traits/trait.FromStr.js new file mode 100644 index 00000000..b335e2bf --- /dev/null +++ b/rust/trait.impl/core/str/traits/trait.FromStr.js @@ -0,0 +1,3 @@ +(function() {var implementors = { +"sudachi":[["impl FromStr for Mode"],["impl FromStr for CategoryType"]] +};if (window.register_implementors) {window.register_implementors(implementors);} else {window.pending_implementors = implementors;}})() \ No newline at end of file diff --git a/rust/implementors/nom/error/trait.ParseError.js b/rust/trait.impl/nom/error/trait.ParseError.js similarity index 100% rename from rust/implementors/nom/error/trait.ParseError.js rename to rust/trait.impl/nom/error/trait.ParseError.js diff --git a/rust/trait.impl/serde/de/trait.Deserialize.js b/rust/trait.impl/serde/de/trait.Deserialize.js new file mode 100644 index 00000000..feeb6d98 --- /dev/null +++ b/rust/trait.impl/serde/de/trait.Deserialize.js @@ -0,0 +1,3 @@ +(function() {var implementors = { +"sudachi":[["impl<'de> Deserialize<'de> for ConfigBuilder"],["impl<'de> Deserialize<'de> for BoundaryMode"],["impl<'de> Deserialize<'de> for SurfaceProjection"]] +};if (window.register_implementors) {window.register_implementors(implementors);} else {window.pending_implementors = implementors;}})() \ No newline at end of file diff --git a/rust/implementors/sudachi/analysis/node/trait.LatticeNode.js b/rust/trait.impl/sudachi/analysis/node/trait.LatticeNode.js similarity index 100% rename from rust/implementors/sudachi/analysis/node/trait.LatticeNode.js rename to rust/trait.impl/sudachi/analysis/node/trait.LatticeNode.js diff --git a/rust/implementors/sudachi/analysis/node/trait.PathCost.js b/rust/trait.impl/sudachi/analysis/node/trait.PathCost.js similarity index 100% rename from rust/implementors/sudachi/analysis/node/trait.PathCost.js rename to rust/trait.impl/sudachi/analysis/node/trait.PathCost.js diff --git a/rust/implementors/sudachi/analysis/node/trait.RightId.js b/rust/trait.impl/sudachi/analysis/node/trait.RightId.js similarity index 100% rename from rust/implementors/sudachi/analysis/node/trait.RightId.js rename to rust/trait.impl/sudachi/analysis/node/trait.RightId.js diff --git a/rust/implementors/sudachi/analysis/stateless_tokenizer/trait.DictionaryAccess.js b/rust/trait.impl/sudachi/analysis/stateless_tokenizer/trait.DictionaryAccess.js similarity index 100% rename from rust/implementors/sudachi/analysis/stateless_tokenizer/trait.DictionaryAccess.js rename to rust/trait.impl/sudachi/analysis/stateless_tokenizer/trait.DictionaryAccess.js diff --git a/rust/implementors/sudachi/analysis/trait.Tokenize.js b/rust/trait.impl/sudachi/analysis/trait.Tokenize.js similarity index 100% rename from rust/implementors/sudachi/analysis/trait.Tokenize.js rename to rust/trait.impl/sudachi/analysis/trait.Tokenize.js diff --git a/rust/implementors/sudachi/dic/build/trait.AsDataSource.js b/rust/trait.impl/sudachi/dic/build/trait.AsDataSource.js similarity index 100% rename from rust/implementors/sudachi/dic/build/trait.AsDataSource.js rename to rust/trait.impl/sudachi/dic/build/trait.AsDataSource.js diff --git a/rust/implementors/sudachi/input_text/trait.InputTextIndex.js b/rust/trait.impl/sudachi/input_text/trait.InputTextIndex.js similarity index 100% rename from rust/implementors/sudachi/input_text/trait.InputTextIndex.js rename to rust/trait.impl/sudachi/input_text/trait.InputTextIndex.js diff --git a/rust/implementors/sudachi/plugin/input_text/trait.InputTextPlugin.js b/rust/trait.impl/sudachi/plugin/input_text/trait.InputTextPlugin.js similarity index 100% rename from rust/implementors/sudachi/plugin/input_text/trait.InputTextPlugin.js rename to rust/trait.impl/sudachi/plugin/input_text/trait.InputTextPlugin.js diff --git a/rust/implementors/sudachi/plugin/loader/trait.PluginCategory.js b/rust/trait.impl/sudachi/plugin/loader/trait.PluginCategory.js similarity index 100% rename from rust/implementors/sudachi/plugin/loader/trait.PluginCategory.js rename to rust/trait.impl/sudachi/plugin/loader/trait.PluginCategory.js diff --git a/rust/implementors/sudachi/plugin/oov/trait.OovProviderPlugin.js b/rust/trait.impl/sudachi/plugin/oov/trait.OovProviderPlugin.js similarity index 100% rename from rust/implementors/sudachi/plugin/oov/trait.OovProviderPlugin.js rename to rust/trait.impl/sudachi/plugin/oov/trait.OovProviderPlugin.js diff --git a/rust/implementors/sudachi/plugin/path_rewrite/trait.PathRewritePlugin.js b/rust/trait.impl/sudachi/plugin/path_rewrite/trait.PathRewritePlugin.js similarity index 100% rename from rust/implementors/sudachi/plugin/path_rewrite/trait.PathRewritePlugin.js rename to rust/trait.impl/sudachi/plugin/path_rewrite/trait.PathRewritePlugin.js diff --git a/rust/implementors/sudachi/sentence_splitter/trait.SplitSentences.js b/rust/trait.impl/sudachi/sentence_splitter/trait.SplitSentences.js similarity index 100% rename from rust/implementors/sudachi/sentence_splitter/trait.SplitSentences.js rename to rust/trait.impl/sudachi/sentence_splitter/trait.SplitSentences.js diff --git a/rust/type.impl/core/result/enum.Result.js b/rust/type.impl/core/result/enum.Result.js new file mode 100644 index 00000000..84d68cbf --- /dev/null +++ b/rust/type.impl/core/result/enum.Result.js @@ -0,0 +1,3 @@ +(function() {var type_impls = { +"sudachi":[["
source§

impl<T, E> Result<T, E>

1.0.0 (const: 1.48.0) · source

pub const fn is_ok(&self) -> bool

Returns true if the result is Ok.

\n
Examples
\n
let x: Result<i32, &str> = Ok(-3);\nassert_eq!(x.is_ok(), true);\n\nlet x: Result<i32, &str> = Err("Some error message");\nassert_eq!(x.is_ok(), false);
\n
1.70.0 · source

pub fn is_ok_and(self, f: impl FnOnce(T) -> bool) -> bool

Returns true if the result is Ok and the value inside of it matches a predicate.

\n
Examples
\n
let x: Result<u32, &str> = Ok(2);\nassert_eq!(x.is_ok_and(|x| x > 1), true);\n\nlet x: Result<u32, &str> = Ok(0);\nassert_eq!(x.is_ok_and(|x| x > 1), false);\n\nlet x: Result<u32, &str> = Err("hey");\nassert_eq!(x.is_ok_and(|x| x > 1), false);
\n
1.0.0 (const: 1.48.0) · source

pub const fn is_err(&self) -> bool

Returns true if the result is Err.

\n
Examples
\n
let x: Result<i32, &str> = Ok(-3);\nassert_eq!(x.is_err(), false);\n\nlet x: Result<i32, &str> = Err("Some error message");\nassert_eq!(x.is_err(), true);
\n
1.70.0 · source

pub fn is_err_and(self, f: impl FnOnce(E) -> bool) -> bool

Returns true if the result is Err and the value inside of it matches a predicate.

\n
Examples
\n
use std::io::{Error, ErrorKind};\n\nlet x: Result<u32, Error> = Err(Error::new(ErrorKind::NotFound, "!"));\nassert_eq!(x.is_err_and(|x| x.kind() == ErrorKind::NotFound), true);\n\nlet x: Result<u32, Error> = Err(Error::new(ErrorKind::PermissionDenied, "!"));\nassert_eq!(x.is_err_and(|x| x.kind() == ErrorKind::NotFound), false);\n\nlet x: Result<u32, Error> = Ok(123);\nassert_eq!(x.is_err_and(|x| x.kind() == ErrorKind::NotFound), false);
\n
1.0.0 · source

pub fn ok(self) -> Option<T>

Converts from Result<T, E> to Option<T>.

\n

Converts self into an Option<T>, consuming self,\nand discarding the error, if any.

\n
Examples
\n
let x: Result<u32, &str> = Ok(2);\nassert_eq!(x.ok(), Some(2));\n\nlet x: Result<u32, &str> = Err("Nothing here");\nassert_eq!(x.ok(), None);
\n
1.0.0 · source

pub fn err(self) -> Option<E>

Converts from Result<T, E> to Option<E>.

\n

Converts self into an Option<E>, consuming self,\nand discarding the success value, if any.

\n
Examples
\n
let x: Result<u32, &str> = Ok(2);\nassert_eq!(x.err(), None);\n\nlet x: Result<u32, &str> = Err("Nothing here");\nassert_eq!(x.err(), Some("Nothing here"));
\n
1.0.0 (const: 1.48.0) · source

pub const fn as_ref(&self) -> Result<&T, &E>

Converts from &Result<T, E> to Result<&T, &E>.

\n

Produces a new Result, containing a reference\ninto the original, leaving the original in place.

\n
Examples
\n
let x: Result<u32, &str> = Ok(2);\nassert_eq!(x.as_ref(), Ok(&2));\n\nlet x: Result<u32, &str> = Err("Error");\nassert_eq!(x.as_ref(), Err(&"Error"));
\n
1.0.0 (const: unstable) · source

pub fn as_mut(&mut self) -> Result<&mut T, &mut E>

Converts from &mut Result<T, E> to Result<&mut T, &mut E>.

\n
Examples
\n
fn mutate(r: &mut Result<i32, i32>) {\n    match r.as_mut() {\n        Ok(v) => *v = 42,\n        Err(e) => *e = 0,\n    }\n}\n\nlet mut x: Result<i32, i32> = Ok(2);\nmutate(&mut x);\nassert_eq!(x.unwrap(), 42);\n\nlet mut x: Result<i32, i32> = Err(13);\nmutate(&mut x);\nassert_eq!(x.unwrap_err(), 0);
\n
1.0.0 · source

pub fn map<U, F>(self, op: F) -> Result<U, E>where\n F: FnOnce(T) -> U,

Maps a Result<T, E> to Result<U, E> by applying a function to a\ncontained Ok value, leaving an Err value untouched.

\n

This function can be used to compose the results of two functions.

\n
Examples
\n

Print the numbers on each line of a string multiplied by two.

\n\n
let line = "1\\n2\\n3\\n4\\n";\n\nfor num in line.lines() {\n    match num.parse::<i32>().map(|i| i * 2) {\n        Ok(n) => println!("{n}"),\n        Err(..) => {}\n    }\n}
\n
1.41.0 · source

pub fn map_or<U, F>(self, default: U, f: F) -> Uwhere\n F: FnOnce(T) -> U,

Returns the provided default (if Err), or\napplies a function to the contained value (if Ok).

\n

Arguments passed to map_or are eagerly evaluated; if you are passing\nthe result of a function call, it is recommended to use map_or_else,\nwhich is lazily evaluated.

\n
Examples
\n
let x: Result<_, &str> = Ok("foo");\nassert_eq!(x.map_or(42, |v| v.len()), 3);\n\nlet x: Result<&str, _> = Err("bar");\nassert_eq!(x.map_or(42, |v| v.len()), 42);
\n
1.41.0 · source

pub fn map_or_else<U, D, F>(self, default: D, f: F) -> Uwhere\n D: FnOnce(E) -> U,\n F: FnOnce(T) -> U,

Maps a Result<T, E> to U by applying fallback function default to\na contained Err value, or function f to a contained Ok value.

\n

This function can be used to unpack a successful result\nwhile handling an error.

\n
Examples
\n
let k = 21;\n\nlet x : Result<_, &str> = Ok("foo");\nassert_eq!(x.map_or_else(|e| k * 2, |v| v.len()), 3);\n\nlet x : Result<&str, _> = Err("bar");\nassert_eq!(x.map_or_else(|e| k * 2, |v| v.len()), 42);
\n
1.0.0 · source

pub fn map_err<F, O>(self, op: O) -> Result<T, F>where\n O: FnOnce(E) -> F,

Maps a Result<T, E> to Result<T, F> by applying a function to a\ncontained Err value, leaving an Ok value untouched.

\n

This function can be used to pass through a successful result while handling\nan error.

\n
Examples
\n
fn stringify(x: u32) -> String { format!("error code: {x}") }\n\nlet x: Result<u32, u32> = Ok(2);\nassert_eq!(x.map_err(stringify), Ok(2));\n\nlet x: Result<u32, u32> = Err(13);\nassert_eq!(x.map_err(stringify), Err("error code: 13".to_string()));
\n
source

pub fn inspect<F>(self, f: F) -> Result<T, E>where\n F: FnOnce(&T),

🔬This is a nightly-only experimental API. (result_option_inspect)

Calls the provided closure with a reference to the contained value (if Ok).

\n
Examples
\n
#![feature(result_option_inspect)]\n\nlet x: u8 = "4"\n    .parse::<u8>()\n    .inspect(|x| println!("original: {x}"))\n    .map(|x| x.pow(3))\n    .expect("failed to parse number");
\n
source

pub fn inspect_err<F>(self, f: F) -> Result<T, E>where\n F: FnOnce(&E),

🔬This is a nightly-only experimental API. (result_option_inspect)

Calls the provided closure with a reference to the contained error (if Err).

\n
Examples
\n
#![feature(result_option_inspect)]\n\nuse std::{fs, io};\n\nfn read() -> io::Result<String> {\n    fs::read_to_string("address.txt")\n        .inspect_err(|e| eprintln!("failed to read file: {e}"))\n}
\n
1.47.0 · source

pub fn as_deref(&self) -> Result<&<T as Deref>::Target, &E>where\n T: Deref,

Converts from Result<T, E> (or &Result<T, E>) to Result<&<T as Deref>::Target, &E>.

\n

Coerces the Ok variant of the original Result via Deref\nand returns the new Result.

\n
Examples
\n
let x: Result<String, u32> = Ok("hello".to_string());\nlet y: Result<&str, &u32> = Ok("hello");\nassert_eq!(x.as_deref(), y);\n\nlet x: Result<String, u32> = Err(42);\nlet y: Result<&str, &u32> = Err(&42);\nassert_eq!(x.as_deref(), y);
\n
1.47.0 · source

pub fn as_deref_mut(&mut self) -> Result<&mut <T as Deref>::Target, &mut E>where\n T: DerefMut,

Converts from Result<T, E> (or &mut Result<T, E>) to Result<&mut <T as DerefMut>::Target, &mut E>.

\n

Coerces the Ok variant of the original Result via DerefMut\nand returns the new Result.

\n
Examples
\n
let mut s = "HELLO".to_string();\nlet mut x: Result<String, u32> = Ok("hello".to_string());\nlet y: Result<&mut str, &mut u32> = Ok(&mut s);\nassert_eq!(x.as_deref_mut().map(|x| { x.make_ascii_uppercase(); x }), y);\n\nlet mut i = 42;\nlet mut x: Result<String, u32> = Err(42);\nlet y: Result<&mut str, &mut u32> = Err(&mut i);\nassert_eq!(x.as_deref_mut().map(|x| { x.make_ascii_uppercase(); x }), y);
\n
1.0.0 · source

pub fn iter(&self) -> Iter<'_, T>

Returns an iterator over the possibly contained value.

\n

The iterator yields one value if the result is Result::Ok, otherwise none.

\n
Examples
\n
let x: Result<u32, &str> = Ok(7);\nassert_eq!(x.iter().next(), Some(&7));\n\nlet x: Result<u32, &str> = Err("nothing!");\nassert_eq!(x.iter().next(), None);
\n
1.0.0 · source

pub fn iter_mut(&mut self) -> IterMut<'_, T>

Returns a mutable iterator over the possibly contained value.

\n

The iterator yields one value if the result is Result::Ok, otherwise none.

\n
Examples
\n
let mut x: Result<u32, &str> = Ok(7);\nmatch x.iter_mut().next() {\n    Some(v) => *v = 40,\n    None => {},\n}\nassert_eq!(x, Ok(40));\n\nlet mut x: Result<u32, &str> = Err("nothing!");\nassert_eq!(x.iter_mut().next(), None);
\n
1.4.0 · source

pub fn expect(self, msg: &str) -> Twhere\n E: Debug,

Returns the contained Ok value, consuming the self value.

\n

Because this function may panic, its use is generally discouraged.\nInstead, prefer to use pattern matching and handle the Err\ncase explicitly, or call unwrap_or, unwrap_or_else, or\nunwrap_or_default.

\n
Panics
\n

Panics if the value is an Err, with a panic message including the\npassed message, and the content of the Err.

\n
Examples
\n
let x: Result<u32, &str> = Err("emergency failure");\nx.expect("Testing expect"); // panics with `Testing expect: emergency failure`
\n
Recommended Message Style
\n

We recommend that expect messages are used to describe the reason you\nexpect the Result should be Ok.

\n\n
let path = std::env::var("IMPORTANT_PATH")\n    .expect("env variable `IMPORTANT_PATH` should be set by `wrapper_script.sh`");
\n

Hint: If you’re having trouble remembering how to phrase expect\nerror messages remember to focus on the word “should” as in “env\nvariable should be set by blah” or “the given binary should be available\nand executable by the current user”.

\n

For more detail on expect message styles and the reasoning behind our recommendation please\nrefer to the section on “Common Message\nStyles” in the\nstd::error module docs.

\n
1.0.0 · source

pub fn unwrap(self) -> Twhere\n E: Debug,

Returns the contained Ok value, consuming the self value.

\n

Because this function may panic, its use is generally discouraged.\nInstead, prefer to use pattern matching and handle the Err\ncase explicitly, or call unwrap_or, unwrap_or_else, or\nunwrap_or_default.

\n
Panics
\n

Panics if the value is an Err, with a panic message provided by the\nErr’s value.

\n
Examples
\n

Basic usage:

\n\n
let x: Result<u32, &str> = Ok(2);\nassert_eq!(x.unwrap(), 2);
\n\n
let x: Result<u32, &str> = Err("emergency failure");\nx.unwrap(); // panics with `emergency failure`
\n
1.16.0 · source

pub fn unwrap_or_default(self) -> Twhere\n T: Default,

Returns the contained Ok value or a default

\n

Consumes the self argument then, if Ok, returns the contained\nvalue, otherwise if Err, returns the default value for that\ntype.

\n
Examples
\n

Converts a string to an integer, turning poorly-formed strings\ninto 0 (the default value for integers). parse converts\na string to any other type that implements FromStr, returning an\nErr on error.

\n\n
let good_year_from_input = "1909";\nlet bad_year_from_input = "190blarg";\nlet good_year = good_year_from_input.parse().unwrap_or_default();\nlet bad_year = bad_year_from_input.parse().unwrap_or_default();\n\nassert_eq!(1909, good_year);\nassert_eq!(0, bad_year);
\n
1.17.0 · source

pub fn expect_err(self, msg: &str) -> Ewhere\n T: Debug,

Returns the contained Err value, consuming the self value.

\n
Panics
\n

Panics if the value is an Ok, with a panic message including the\npassed message, and the content of the Ok.

\n
Examples
\n
let x: Result<u32, &str> = Ok(10);\nx.expect_err("Testing expect_err"); // panics with `Testing expect_err: 10`
\n
1.0.0 · source

pub fn unwrap_err(self) -> Ewhere\n T: Debug,

Returns the contained Err value, consuming the self value.

\n
Panics
\n

Panics if the value is an Ok, with a custom panic message provided\nby the Ok’s value.

\n
Examples
\n
let x: Result<u32, &str> = Ok(2);\nx.unwrap_err(); // panics with `2`
\n\n
let x: Result<u32, &str> = Err("emergency failure");\nassert_eq!(x.unwrap_err(), "emergency failure");
\n
source

pub fn into_ok(self) -> Twhere\n E: Into<!>,

🔬This is a nightly-only experimental API. (unwrap_infallible)

Returns the contained Ok value, but never panics.

\n

Unlike unwrap, this method is known to never panic on the\nresult types it is implemented for. Therefore, it can be used\ninstead of unwrap as a maintainability safeguard that will fail\nto compile if the error type of the Result is later changed\nto an error that can actually occur.

\n
Examples
\n
\nfn only_good_news() -> Result<String, !> {\n    Ok("this is fine".into())\n}\n\nlet s: String = only_good_news().into_ok();\nprintln!("{s}");
\n
source

pub fn into_err(self) -> Ewhere\n T: Into<!>,

🔬This is a nightly-only experimental API. (unwrap_infallible)

Returns the contained Err value, but never panics.

\n

Unlike unwrap_err, this method is known to never panic on the\nresult types it is implemented for. Therefore, it can be used\ninstead of unwrap_err as a maintainability safeguard that will fail\nto compile if the ok type of the Result is later changed\nto a type that can actually occur.

\n
Examples
\n
\nfn only_bad_news() -> Result<!, String> {\n    Err("Oops, it failed".into())\n}\n\nlet error: String = only_bad_news().into_err();\nprintln!("{error}");
\n
1.0.0 · source

pub fn and<U>(self, res: Result<U, E>) -> Result<U, E>

Returns res if the result is Ok, otherwise returns the Err value of self.

\n

Arguments passed to and are eagerly evaluated; if you are passing the\nresult of a function call, it is recommended to use and_then, which is\nlazily evaluated.

\n
Examples
\n
let x: Result<u32, &str> = Ok(2);\nlet y: Result<&str, &str> = Err("late error");\nassert_eq!(x.and(y), Err("late error"));\n\nlet x: Result<u32, &str> = Err("early error");\nlet y: Result<&str, &str> = Ok("foo");\nassert_eq!(x.and(y), Err("early error"));\n\nlet x: Result<u32, &str> = Err("not a 2");\nlet y: Result<&str, &str> = Err("late error");\nassert_eq!(x.and(y), Err("not a 2"));\n\nlet x: Result<u32, &str> = Ok(2);\nlet y: Result<&str, &str> = Ok("different result type");\nassert_eq!(x.and(y), Ok("different result type"));
\n
1.0.0 · source

pub fn and_then<U, F>(self, op: F) -> Result<U, E>where\n F: FnOnce(T) -> Result<U, E>,

Calls op if the result is Ok, otherwise returns the Err value of self.

\n

This function can be used for control flow based on Result values.

\n
Examples
\n
fn sq_then_to_string(x: u32) -> Result<String, &'static str> {\n    x.checked_mul(x).map(|sq| sq.to_string()).ok_or("overflowed")\n}\n\nassert_eq!(Ok(2).and_then(sq_then_to_string), Ok(4.to_string()));\nassert_eq!(Ok(1_000_000).and_then(sq_then_to_string), Err("overflowed"));\nassert_eq!(Err("not a number").and_then(sq_then_to_string), Err("not a number"));
\n

Often used to chain fallible operations that may return Err.

\n\n
use std::{io::ErrorKind, path::Path};\n\n// Note: on Windows "/" maps to "C:\\"\nlet root_modified_time = Path::new("/").metadata().and_then(|md| md.modified());\nassert!(root_modified_time.is_ok());\n\nlet should_fail = Path::new("/bad/path").metadata().and_then(|md| md.modified());\nassert!(should_fail.is_err());\nassert_eq!(should_fail.unwrap_err().kind(), ErrorKind::NotFound);
\n
1.0.0 · source

pub fn or<F>(self, res: Result<T, F>) -> Result<T, F>

Returns res if the result is Err, otherwise returns the Ok value of self.

\n

Arguments passed to or are eagerly evaluated; if you are passing the\nresult of a function call, it is recommended to use or_else, which is\nlazily evaluated.

\n
Examples
\n
let x: Result<u32, &str> = Ok(2);\nlet y: Result<u32, &str> = Err("late error");\nassert_eq!(x.or(y), Ok(2));\n\nlet x: Result<u32, &str> = Err("early error");\nlet y: Result<u32, &str> = Ok(2);\nassert_eq!(x.or(y), Ok(2));\n\nlet x: Result<u32, &str> = Err("not a 2");\nlet y: Result<u32, &str> = Err("late error");\nassert_eq!(x.or(y), Err("late error"));\n\nlet x: Result<u32, &str> = Ok(2);\nlet y: Result<u32, &str> = Ok(100);\nassert_eq!(x.or(y), Ok(2));
\n
1.0.0 · source

pub fn or_else<F, O>(self, op: O) -> Result<T, F>where\n O: FnOnce(E) -> Result<T, F>,

Calls op if the result is Err, otherwise returns the Ok value of self.

\n

This function can be used for control flow based on result values.

\n
Examples
\n
fn sq(x: u32) -> Result<u32, u32> { Ok(x * x) }\nfn err(x: u32) -> Result<u32, u32> { Err(x) }\n\nassert_eq!(Ok(2).or_else(sq).or_else(sq), Ok(2));\nassert_eq!(Ok(2).or_else(err).or_else(sq), Ok(2));\nassert_eq!(Err(3).or_else(sq).or_else(err), Ok(9));\nassert_eq!(Err(3).or_else(err).or_else(err), Err(3));
\n
1.0.0 · source

pub fn unwrap_or(self, default: T) -> T

Returns the contained Ok value or a provided default.

\n

Arguments passed to unwrap_or are eagerly evaluated; if you are passing\nthe result of a function call, it is recommended to use unwrap_or_else,\nwhich is lazily evaluated.

\n
Examples
\n
let default = 2;\nlet x: Result<u32, &str> = Ok(9);\nassert_eq!(x.unwrap_or(default), 9);\n\nlet x: Result<u32, &str> = Err("error");\nassert_eq!(x.unwrap_or(default), default);
\n
1.0.0 · source

pub fn unwrap_or_else<F>(self, op: F) -> Twhere\n F: FnOnce(E) -> T,

Returns the contained Ok value or computes it from a closure.

\n
Examples
\n
fn count(x: &str) -> usize { x.len() }\n\nassert_eq!(Ok(2).unwrap_or_else(count), 2);\nassert_eq!(Err("foo").unwrap_or_else(count), 3);
\n
1.58.0 · source

pub unsafe fn unwrap_unchecked(self) -> T

Returns the contained Ok value, consuming the self value,\nwithout checking that the value is not an Err.

\n
Safety
\n

Calling this method on an Err is undefined behavior.

\n
Examples
\n
let x: Result<u32, &str> = Ok(2);\nassert_eq!(unsafe { x.unwrap_unchecked() }, 2);
\n\n
let x: Result<u32, &str> = Err("emergency failure");\nunsafe { x.unwrap_unchecked(); } // Undefined behavior!
\n
1.58.0 · source

pub unsafe fn unwrap_err_unchecked(self) -> E

Returns the contained Err value, consuming the self value,\nwithout checking that the value is not an Ok.

\n
Safety
\n

Calling this method on an Ok is undefined behavior.

\n
Examples
\n
let x: Result<u32, &str> = Ok(2);\nunsafe { x.unwrap_err_unchecked() }; // Undefined behavior!
\n\n
let x: Result<u32, &str> = Err("emergency failure");\nassert_eq!(unsafe { x.unwrap_err_unchecked() }, "emergency failure");
\n
",0,"sudachi::dic::build::error::DicWriteResult","sudachi::error::SudachiResult"],["
source§

impl<T, E> Result<&T, E>

1.59.0 · source

pub fn copied(self) -> Result<T, E>where\n T: Copy,

Maps a Result<&T, E> to a Result<T, E> by copying the contents of the\nOk part.

\n
Examples
\n
let val = 12;\nlet x: Result<&i32, i32> = Ok(&val);\nassert_eq!(x, Ok(&12));\nlet copied = x.copied();\nassert_eq!(copied, Ok(12));
\n
1.59.0 · source

pub fn cloned(self) -> Result<T, E>where\n T: Clone,

Maps a Result<&T, E> to a Result<T, E> by cloning the contents of the\nOk part.

\n
Examples
\n
let val = 12;\nlet x: Result<&i32, i32> = Ok(&val);\nassert_eq!(x, Ok(&12));\nlet cloned = x.cloned();\nassert_eq!(cloned, Ok(12));
\n
",0,"sudachi::dic::build::error::DicWriteResult","sudachi::error::SudachiResult"],["
source§

impl<T, E> Result<&mut T, E>

1.59.0 · source

pub fn copied(self) -> Result<T, E>where\n T: Copy,

Maps a Result<&mut T, E> to a Result<T, E> by copying the contents of the\nOk part.

\n
Examples
\n
let mut val = 12;\nlet x: Result<&mut i32, i32> = Ok(&mut val);\nassert_eq!(x, Ok(&mut 12));\nlet copied = x.copied();\nassert_eq!(copied, Ok(12));
\n
1.59.0 · source

pub fn cloned(self) -> Result<T, E>where\n T: Clone,

Maps a Result<&mut T, E> to a Result<T, E> by cloning the contents of the\nOk part.

\n
Examples
\n
let mut val = 12;\nlet x: Result<&mut i32, i32> = Ok(&mut val);\nassert_eq!(x, Ok(&mut 12));\nlet cloned = x.cloned();\nassert_eq!(cloned, Ok(12));
\n
",0,"sudachi::dic::build::error::DicWriteResult","sudachi::error::SudachiResult"],["
source§

impl<T, E> Result<Option<T>, E>

1.33.0 (const: unstable) · source

pub fn transpose(self) -> Option<Result<T, E>>

Transposes a Result of an Option into an Option of a Result.

\n

Ok(None) will be mapped to None.\nOk(Some(_)) and Err(_) will be mapped to Some(Ok(_)) and Some(Err(_)).

\n
Examples
\n
#[derive(Debug, Eq, PartialEq)]\nstruct SomeErr;\n\nlet x: Result<Option<i32>, SomeErr> = Ok(Some(5));\nlet y: Option<Result<i32, SomeErr>> = Some(Ok(5));\nassert_eq!(x.transpose(), y);
\n
",0,"sudachi::dic::build::error::DicWriteResult","sudachi::error::SudachiResult"],["
source§

impl<T, E> Result<Result<T, E>, E>

source

pub fn flatten(self) -> Result<T, E>

🔬This is a nightly-only experimental API. (result_flattening)

Converts from Result<Result<T, E>, E> to Result<T, E>

\n
Examples
\n
#![feature(result_flattening)]\nlet x: Result<Result<&'static str, u32>, u32> = Ok(Ok("hello"));\nassert_eq!(Ok("hello"), x.flatten());\n\nlet x: Result<Result<&'static str, u32>, u32> = Ok(Err(6));\nassert_eq!(Err(6), x.flatten());\n\nlet x: Result<Result<&'static str, u32>, u32> = Err(6);\nassert_eq!(Err(6), x.flatten());
\n

Flattening only removes one level of nesting at a time:

\n\n
#![feature(result_flattening)]\nlet x: Result<Result<Result<&'static str, u32>, u32>, u32> = Ok(Ok(Ok("hello")));\nassert_eq!(Ok(Ok("hello")), x.flatten());\nassert_eq!(Ok("hello"), x.flatten().flatten());
\n
",0,"sudachi::dic::build::error::DicWriteResult","sudachi::error::SudachiResult"],["
1.61.0 · source§

impl<T, E> Termination for Result<T, E>where\n T: Termination,\n E: Debug,

source§

fn report(self) -> ExitCode

Is called to get the representation of the value as status code.\nThis status code is returned to the operating system.
","Termination","sudachi::dic::build::error::DicWriteResult","sudachi::error::SudachiResult"],["
source§

impl<T, E, F> FromResidual<Yeet<E>> for Result<T, F>where\n F: From<E>,

source§

fn from_residual(_: Yeet<E>) -> Result<T, F>

🔬This is a nightly-only experimental API. (try_trait_v2)
Constructs the type from a compatible Residual type. Read more
","FromResidual>","sudachi::dic::build::error::DicWriteResult","sudachi::error::SudachiResult"],["
source§

impl<T, E, F> FromResidual<Result<Infallible, E>> for Result<T, F>where\n F: From<E>,

source§

fn from_residual(residual: Result<Infallible, E>) -> Result<T, F>

🔬This is a nightly-only experimental API. (try_trait_v2)
Constructs the type from a compatible Residual type. Read more
","FromResidual>","sudachi::dic::build::error::DicWriteResult","sudachi::error::SudachiResult"],["
source§

impl<T, E> Try for Result<T, E>

§

type Output = T

🔬This is a nightly-only experimental API. (try_trait_v2)
The type of the value produced by ? when not short-circuiting.
§

type Residual = Result<Infallible, E>

🔬This is a nightly-only experimental API. (try_trait_v2)
The type of the value passed to FromResidual::from_residual\nas part of ? when short-circuiting. Read more
source§

fn from_output(output: <Result<T, E> as Try>::Output) -> Result<T, E>

🔬This is a nightly-only experimental API. (try_trait_v2)
Constructs the type from its Output type. Read more
source§

fn branch(\n self\n) -> ControlFlow<<Result<T, E> as Try>::Residual, <Result<T, E> as Try>::Output>

🔬This is a nightly-only experimental API. (try_trait_v2)
Used in ? to decide whether the operator should produce a value\n(because this returned ControlFlow::Continue)\nor propagate a value back to the caller\n(because this returned ControlFlow::Break). Read more
","Try","sudachi::dic::build::error::DicWriteResult","sudachi::error::SudachiResult"],["
1.0.0 · source§

impl<T, E> StructuralEq for Result<T, E>

","StructuralEq","sudachi::dic::build::error::DicWriteResult","sudachi::error::SudachiResult"],["
1.0.0 · source§

impl<T, E> Eq for Result<T, E>where\n T: Eq,\n E: Eq,

","Eq","sudachi::dic::build::error::DicWriteResult","sudachi::error::SudachiResult"],["
1.0.0 · source§

impl<A, E, V> FromIterator<Result<A, E>> for Result<V, E>where\n V: FromIterator<A>,

source§

fn from_iter<I>(iter: I) -> Result<V, E>where\n I: IntoIterator<Item = Result<A, E>>,

Takes each element in the Iterator: if it is an Err, no further\nelements are taken, and the Err is returned. Should no Err occur, a\ncontainer with the values of each Result is returned.

\n

Here is an example which increments every integer in a vector,\nchecking for overflow:

\n\n
let v = vec![1, 2];\nlet res: Result<Vec<u32>, &'static str> = v.iter().map(|x: &u32|\n    x.checked_add(1).ok_or("Overflow!")\n).collect();\nassert_eq!(res, Ok(vec![2, 3]));
\n

Here is another example that tries to subtract one from another list\nof integers, this time checking for underflow:

\n\n
let v = vec![1, 2, 0];\nlet res: Result<Vec<u32>, &'static str> = v.iter().map(|x: &u32|\n    x.checked_sub(1).ok_or("Underflow!")\n).collect();\nassert_eq!(res, Err("Underflow!"));
\n

Here is a variation on the previous example, showing that no\nfurther elements are taken from iter after the first Err.

\n\n
let v = vec![3, 2, 1, 10];\nlet mut shared = 0;\nlet res: Result<Vec<u32>, &'static str> = v.iter().map(|x: &u32| {\n    shared += x;\n    x.checked_sub(2).ok_or("Underflow!")\n}).collect();\nassert_eq!(res, Err("Underflow!"));\nassert_eq!(shared, 6);
\n

Since the third element caused an underflow, no further elements were taken,\nso the final value of shared is 6 (= 3 + 2 + 1), not 16.

\n
","FromIterator>","sudachi::dic::build::error::DicWriteResult","sudachi::error::SudachiResult"],["
1.0.0 · source§

impl<T, E> Ord for Result<T, E>where\n T: Ord,\n E: Ord,

source§

fn cmp(&self, other: &Result<T, E>) -> Ordering

This method returns an Ordering between self and other. Read more
1.21.0 · source§

fn max(self, other: Self) -> Selfwhere\n Self: Sized,

Compares and returns the maximum of two values. Read more
1.21.0 · source§

fn min(self, other: Self) -> Selfwhere\n Self: Sized,

Compares and returns the minimum of two values. Read more
1.50.0 · source§

fn clamp(self, min: Self, max: Self) -> Selfwhere\n Self: Sized + PartialOrd,

Restrict a value to a certain interval. Read more
","Ord","sudachi::dic::build::error::DicWriteResult","sudachi::error::SudachiResult"],["
1.0.0 · source§

impl<T, E> PartialEq for Result<T, E>where\n T: PartialEq,\n E: PartialEq,

source§

fn eq(&self, other: &Result<T, E>) -> bool

This method tests for self and other values to be equal, and is used\nby ==.
1.0.0 · source§

fn ne(&self, other: &Rhs) -> bool

This method tests for !=. The default implementation is almost always\nsufficient, and should not be overridden without very good reason.
","PartialEq","sudachi::dic::build::error::DicWriteResult","sudachi::error::SudachiResult"],["
1.0.0 · source§

impl<T, E> Clone for Result<T, E>where\n T: Clone,\n E: Clone,

source§

fn clone(&self) -> Result<T, E>

Returns a copy of the value. Read more
source§

fn clone_from(&mut self, source: &Result<T, E>)

Performs copy-assignment from source. Read more
","Clone","sudachi::dic::build::error::DicWriteResult","sudachi::error::SudachiResult"],["
1.0.0 · source§

impl<T, E> Hash for Result<T, E>where\n T: Hash,\n E: Hash,

source§

fn hash<__H>(&self, state: &mut __H)where\n __H: Hasher,

Feeds this value into the given Hasher. Read more
1.3.0 · source§

fn hash_slice<H>(data: &[Self], state: &mut H)where\n H: Hasher,\n Self: Sized,

Feeds a slice of this type into the given Hasher. Read more
","Hash","sudachi::dic::build::error::DicWriteResult","sudachi::error::SudachiResult"],["
1.0.0 · source§

impl<T, E> IntoIterator for Result<T, E>

source§

fn into_iter(self) -> IntoIter<T>

Returns a consuming iterator over the possibly contained value.

\n

The iterator yields one value if the result is Result::Ok, otherwise none.

\n
Examples
\n
let x: Result<u32, &str> = Ok(5);\nlet v: Vec<u32> = x.into_iter().collect();\nassert_eq!(v, [5]);\n\nlet x: Result<u32, &str> = Err("nothing!");\nlet v: Vec<u32> = x.into_iter().collect();\nassert_eq!(v, []);
\n
§

type Item = T

The type of the elements being iterated over.
§

type IntoIter = IntoIter<T>

Which kind of iterator are we turning this into?
","IntoIterator","sudachi::dic::build::error::DicWriteResult","sudachi::error::SudachiResult"],["
source§

impl<T, E> Residual<T> for Result<Infallible, E>

§

type TryType = Result<T, E>

🔬This is a nightly-only experimental API. (try_trait_v2_residual)
The “return” type of this meta-function.
","Residual","sudachi::dic::build::error::DicWriteResult","sudachi::error::SudachiResult"],["
1.0.0 · source§

impl<T, E> StructuralPartialEq for Result<T, E>

","StructuralPartialEq","sudachi::dic::build::error::DicWriteResult","sudachi::error::SudachiResult"],["
1.16.0 · source§

impl<T, U, E> Sum<Result<U, E>> for Result<T, E>where\n T: Sum<U>,

source§

fn sum<I>(iter: I) -> Result<T, E>where\n I: Iterator<Item = Result<U, E>>,

Takes each element in the Iterator: if it is an Err, no further\nelements are taken, and the Err is returned. Should no Err\noccur, the sum of all elements is returned.

\n
Examples
\n

This sums up every integer in a vector, rejecting the sum if a negative\nelement is encountered:

\n\n
let f = |&x: &i32| if x < 0 { Err("Negative element found") } else { Ok(x) };\nlet v = vec![1, 2];\nlet res: Result<i32, _> = v.iter().map(f).sum();\nassert_eq!(res, Ok(3));\nlet v = vec![1, -2];\nlet res: Result<i32, _> = v.iter().map(f).sum();\nassert_eq!(res, Err("Negative element found"));
\n
","Sum>","sudachi::dic::build::error::DicWriteResult","sudachi::error::SudachiResult"],["
1.0.0 · source§

impl<T, E> Debug for Result<T, E>where\n T: Debug,\n E: Debug,

source§

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

Formats the value using the given formatter. Read more
","Debug","sudachi::dic::build::error::DicWriteResult","sudachi::error::SudachiResult"],["
1.0.0 · source§

impl<T, E> PartialOrd for Result<T, E>where\n T: PartialOrd,\n E: PartialOrd,

source§

fn partial_cmp(&self, other: &Result<T, E>) -> Option<Ordering>

This method returns an ordering between self and other values if one exists. Read more
1.0.0 · source§

fn lt(&self, other: &Rhs) -> bool

This method tests less than (for self and other) and is used by the < operator. Read more
1.0.0 · source§

fn le(&self, other: &Rhs) -> bool

This method tests less than or equal to (for self and other) and is used by the <=\noperator. Read more
1.0.0 · source§

fn gt(&self, other: &Rhs) -> bool

This method tests greater than (for self and other) and is used by the > operator. Read more
1.0.0 · source§

fn ge(&self, other: &Rhs) -> bool

This method tests greater than or equal to (for self and other) and is used by the >=\noperator. Read more
","PartialOrd","sudachi::dic::build::error::DicWriteResult","sudachi::error::SudachiResult"],["
1.0.0 · source§

impl<T, E> Copy for Result<T, E>where\n T: Copy,\n E: Copy,

","Copy","sudachi::dic::build::error::DicWriteResult","sudachi::error::SudachiResult"],["
1.16.0 · source§

impl<T, U, E> Product<Result<U, E>> for Result<T, E>where\n T: Product<U>,

source§

fn product<I>(iter: I) -> Result<T, E>where\n I: Iterator<Item = Result<U, E>>,

Takes each element in the Iterator: if it is an Err, no further\nelements are taken, and the Err is returned. Should no Err\noccur, the product of all elements is returned.

\n
Examples
\n

This multiplies each number in a vector of strings,\nif a string could not be parsed the operation returns Err:

\n\n
let nums = vec!["5", "10", "1", "2"];\nlet total: Result<usize, _> = nums.iter().map(|w| w.parse::<usize>()).product();\nassert_eq!(total, Ok(100));\nlet nums = vec!["5", "10", "one", "2"];\nlet total: Result<usize, _> = nums.iter().map(|w| w.parse::<usize>()).product();\nassert!(total.is_err());
\n
","Product>","sudachi::dic::build::error::DicWriteResult","sudachi::error::SudachiResult"],["
source§

impl<T, E> Serialize for Result<T, E>where\n T: Serialize,\n E: Serialize,

source§

fn serialize<S>(\n &self,\n serializer: S\n) -> Result<<S as Serializer>::Ok, <S as Serializer>::Error>where\n S: Serializer,

Serialize this value into the given Serde serializer. Read more
","Serialize","sudachi::dic::build::error::DicWriteResult","sudachi::error::SudachiResult"],["
source§

impl<'de, T, E> Deserialize<'de> for Result<T, E>where\n T: Deserialize<'de>,\n E: Deserialize<'de>,

source§

fn deserialize<D>(\n deserializer: D\n) -> Result<Result<T, E>, <D as Deserializer<'de>>::Error>where\n D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer. Read more
","Deserialize<'de>","sudachi::dic::build::error::DicWriteResult","sudachi::error::SudachiResult"]] +};if (window.register_type_impls) {window.register_type_impls(type_impls);} else {window.pending_type_impls = type_impls;}})() \ No newline at end of file diff --git a/rust/type.impl/nom/internal/type.IResult.js b/rust/type.impl/nom/internal/type.IResult.js new file mode 100644 index 00000000..9404ab3f --- /dev/null +++ b/rust/type.impl/nom/internal/type.IResult.js @@ -0,0 +1,3 @@ +(function() {var type_impls = { +"sudachi":[] +};if (window.register_type_impls) {window.register_type_impls(type_impls);} else {window.pending_type_impls = type_impls;}})() \ No newline at end of file